Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978700298.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-030B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978700298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 8.4K Feb 25 23:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 25 23:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 23:08 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 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 23:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 23:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Feb 25 23:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 364K 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 ShieldRVt-PT-030B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679348762080

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=ShieldRVt-PT-030B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:46:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:46:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:46:04] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2023-03-20 21:46:04] [INFO ] Transformed 1503 places.
[2023-03-20 21:46:04] [INFO ] Transformed 1503 transitions.
[2023-03-20 21:46:04] [INFO ] Found NUPN structural information;
[2023-03-20 21:46:04] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 119 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 292 places :
Symmetric choice reduction at 0 with 292 rule applications. Total rules 292 place count 1211 transition count 1211
Iterating global reduction 0 with 292 rules applied. Total rules applied 584 place count 1211 transition count 1211
Applied a total of 584 rules in 263 ms. Remains 1211 /1503 variables (removed 292) and now considering 1211/1503 (removed 292) transitions.
// Phase 1: matrix 1211 rows 1211 cols
[2023-03-20 21:46:04] [INFO ] Computed 121 place invariants in 34 ms
[2023-03-20 21:46:05] [INFO ] Implicit Places using invariants in 558 ms returned []
[2023-03-20 21:46:05] [INFO ] Invariant cache hit.
[2023-03-20 21:46:06] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
[2023-03-20 21:46:06] [INFO ] Invariant cache hit.
[2023-03-20 21:46:06] [INFO ] Dead Transitions using invariants and state equation in 597 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1211/1503 places, 1211/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2437 ms. Remains : 1211/1503 places, 1211/1503 transitions.
Support contains 119 out of 1211 places after structural reductions.
[2023-03-20 21:46:07] [INFO ] Flatten gal took : 94 ms
[2023-03-20 21:46:07] [INFO ] Flatten gal took : 47 ms
[2023-03-20 21:46:07] [INFO ] Input system was already deterministic with 1211 transitions.
Support contains 109 out of 1211 places (down from 119) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 70) seen :38
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Running SMT prover for 32 properties.
[2023-03-20 21:46:08] [INFO ] Invariant cache hit.
[2023-03-20 21:46:09] [INFO ] [Real]Absence check using 121 positive place invariants in 31 ms returned sat
[2023-03-20 21:46:09] [INFO ] After 403ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:30
[2023-03-20 21:46:09] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 6 ms to minimize.
[2023-03-20 21:46:10] [INFO ] Deduced a trap composed of 23 places in 251 ms of which 2 ms to minimize.
[2023-03-20 21:46:10] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 4 ms to minimize.
[2023-03-20 21:46:10] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 2 ms to minimize.
[2023-03-20 21:46:11] [INFO ] Deduced a trap composed of 36 places in 291 ms of which 1 ms to minimize.
[2023-03-20 21:46:11] [INFO ] Deduced a trap composed of 25 places in 250 ms of which 2 ms to minimize.
[2023-03-20 21:46:11] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 1 ms to minimize.
[2023-03-20 21:46:12] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 1 ms to minimize.
[2023-03-20 21:46:12] [INFO ] Deduced a trap composed of 21 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:46:12] [INFO ] Deduced a trap composed of 33 places in 230 ms of which 1 ms to minimize.
[2023-03-20 21:46:12] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 0 ms to minimize.
[2023-03-20 21:46:13] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 0 ms to minimize.
[2023-03-20 21:46:13] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 0 ms to minimize.
[2023-03-20 21:46:13] [INFO ] Deduced a trap composed of 44 places in 238 ms of which 1 ms to minimize.
[2023-03-20 21:46:13] [INFO ] Deduced a trap composed of 38 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:46:14] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 1 ms to minimize.
[2023-03-20 21:46:14] [INFO ] Deduced a trap composed of 47 places in 172 ms of which 0 ms to minimize.
[2023-03-20 21:46:14] [INFO ] Deduced a trap composed of 43 places in 158 ms of which 1 ms to minimize.
[2023-03-20 21:46:14] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 0 ms to minimize.
[2023-03-20 21:46:14] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 5433 ms
[2023-03-20 21:46:15] [INFO ] After 6027ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-20 21:46:15] [INFO ] After 6821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-20 21:46:15] [INFO ] [Nat]Absence check using 121 positive place invariants in 62 ms returned sat
[2023-03-20 21:46:19] [INFO ] After 2634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :32
[2023-03-20 21:46:19] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 1 ms to minimize.
[2023-03-20 21:46:19] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 1 ms to minimize.
[2023-03-20 21:46:20] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 2 ms to minimize.
[2023-03-20 21:46:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 859 ms
[2023-03-20 21:46:21] [INFO ] Deduced a trap composed of 46 places in 211 ms of which 1 ms to minimize.
[2023-03-20 21:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 353 ms
[2023-03-20 21:46:21] [INFO ] Deduced a trap composed of 54 places in 189 ms of which 1 ms to minimize.
[2023-03-20 21:46:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2023-03-20 21:46:22] [INFO ] Deduced a trap composed of 29 places in 240 ms of which 1 ms to minimize.
[2023-03-20 21:46:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
[2023-03-20 21:46:22] [INFO ] Deduced a trap composed of 45 places in 220 ms of which 1 ms to minimize.
[2023-03-20 21:46:23] [INFO ] Deduced a trap composed of 45 places in 227 ms of which 1 ms to minimize.
[2023-03-20 21:46:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 612 ms
[2023-03-20 21:46:23] [INFO ] Deduced a trap composed of 62 places in 222 ms of which 0 ms to minimize.
[2023-03-20 21:46:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 327 ms
[2023-03-20 21:46:24] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 0 ms to minimize.
[2023-03-20 21:46:24] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 0 ms to minimize.
[2023-03-20 21:46:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
[2023-03-20 21:46:24] [INFO ] Deduced a trap composed of 30 places in 207 ms of which 1 ms to minimize.
[2023-03-20 21:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 323 ms
[2023-03-20 21:46:25] [INFO ] Deduced a trap composed of 28 places in 206 ms of which 1 ms to minimize.
[2023-03-20 21:46:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 311 ms
[2023-03-20 21:46:26] [INFO ] Deduced a trap composed of 46 places in 188 ms of which 1 ms to minimize.
[2023-03-20 21:46:26] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 4 ms to minimize.
[2023-03-20 21:46:26] [INFO ] Deduced a trap composed of 47 places in 173 ms of which 1 ms to minimize.
[2023-03-20 21:46:27] [INFO ] Deduced a trap composed of 53 places in 148 ms of which 1 ms to minimize.
[2023-03-20 21:46:27] [INFO ] Deduced a trap composed of 47 places in 143 ms of which 0 ms to minimize.
[2023-03-20 21:46:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1150 ms
[2023-03-20 21:46:27] [INFO ] Deduced a trap composed of 50 places in 181 ms of which 1 ms to minimize.
[2023-03-20 21:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-20 21:46:28] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 1 ms to minimize.
[2023-03-20 21:46:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2023-03-20 21:46:28] [INFO ] After 12308ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :32
Attempting to minimize the solution found.
Minimization took 2105 ms.
[2023-03-20 21:46:30] [INFO ] After 15682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :32
Parikh walk visited 2 properties in 1011 ms.
Support contains 49 out of 1211 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Drop transitions removed 305 transitions
Trivial Post-agglo rules discarded 305 transitions
Performed 305 trivial Post agglomeration. Transition count delta: 305
Iterating post reduction 0 with 305 rules applied. Total rules applied 305 place count 1211 transition count 906
Reduce places removed 305 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 315 rules applied. Total rules applied 620 place count 906 transition count 896
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 630 place count 896 transition count 896
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 208 Pre rules applied. Total rules applied 630 place count 896 transition count 688
Deduced a syphon composed of 208 places in 2 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 416 rules applied. Total rules applied 1046 place count 688 transition count 688
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1061 place count 673 transition count 673
Iterating global reduction 3 with 15 rules applied. Total rules applied 1076 place count 673 transition count 673
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 1076 place count 673 transition count 660
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 1102 place count 660 transition count 660
Performed 267 Post agglomeration using F-continuation condition.Transition count delta: 267
Deduced a syphon composed of 267 places in 1 ms
Reduce places removed 267 places and 0 transitions.
Iterating global reduction 3 with 534 rules applied. Total rules applied 1636 place count 393 transition count 393
Renaming transitions due to excessive name length > 1024 char.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -63
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 1788 place count 317 transition count 456
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 1794 place count 317 transition count 450
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1800 place count 311 transition count 450
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1801 place count 311 transition count 449
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1802 place count 311 transition count 449
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1803 place count 310 transition count 448
Applied a total of 1803 rules in 177 ms. Remains 310 /1211 variables (removed 901) and now considering 448/1211 (removed 763) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 310/1211 places, 448/1211 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 300 ms. (steps per millisecond=33 ) properties (out of 30) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 448 rows 310 cols
[2023-03-20 21:46:32] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-20 21:46:32] [INFO ] [Real]Absence check using 121 positive place invariants in 14 ms returned sat
[2023-03-20 21:46:32] [INFO ] After 116ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:21
[2023-03-20 21:46:32] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 21:46:32] [INFO ] After 22ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-20 21:46:32] [INFO ] After 282ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-20 21:46:32] [INFO ] [Nat]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-20 21:46:33] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-20 21:46:33] [INFO ] After 207ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-20 21:46:33] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 203 ms.
[2023-03-20 21:46:34] [INFO ] After 1257ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 0 properties in 258 ms.
Support contains 38 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 448/448 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 310 transition count 445
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 307 transition count 444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 306 transition count 444
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 306 transition count 439
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 18 place count 301 transition count 439
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 299 transition count 437
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 294 transition count 438
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 294 transition count 437
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 294 transition count 437
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 35 place count 293 transition count 436
Iterating global reduction 3 with 1 rules applied. Total rules applied 36 place count 293 transition count 436
Applied a total of 36 rules in 50 ms. Remains 293 /310 variables (removed 17) and now considering 436/448 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 293/310 places, 436/448 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 485 ms. (steps per millisecond=20 ) properties (out of 23) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
// Phase 1: matrix 436 rows 293 cols
[2023-03-20 21:46:34] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 21:46:35] [INFO ] [Real]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-20 21:46:35] [INFO ] After 254ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:14
[2023-03-20 21:46:35] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 21:46:35] [INFO ] After 33ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-20 21:46:35] [INFO ] After 442ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-03-20 21:46:35] [INFO ] [Nat]Absence check using 121 positive place invariants in 13 ms returned sat
[2023-03-20 21:46:35] [INFO ] After 232ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-03-20 21:46:35] [INFO ] After 144ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-20 21:46:36] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 192 ms.
[2023-03-20 21:46:36] [INFO ] After 965ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 17 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 202 ms.
Support contains 32 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 436/436 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 293 transition count 434
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 291 transition count 434
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 291 transition count 432
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 289 transition count 432
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 288 transition count 431
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 284 transition count 437
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 284 transition count 436
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 284 transition count 435
Applied a total of 20 rules in 38 ms. Remains 284 /293 variables (removed 9) and now considering 435/436 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 284/293 places, 435/436 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 171064 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 7=1, 8=1, 12=1, 14=1, 15=1, 16=1}
Probabilistic random walk after 171064 steps, saw 105397 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :12
Running SMT prover for 5 properties.
// Phase 1: matrix 435 rows 284 cols
[2023-03-20 21:46:40] [INFO ] Computed 121 place invariants in 1 ms
[2023-03-20 21:46:40] [INFO ] [Real]Absence check using 121 positive place invariants in 11 ms returned sat
[2023-03-20 21:46:40] [INFO ] After 184ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2023-03-20 21:46:40] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 21:46:40] [INFO ] After 25ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 21:46:40] [INFO ] After 308ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 21:46:40] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-20 21:46:40] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 21:46:40] [INFO ] After 49ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 21:46:40] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-20 21:46:40] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 16 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 435/435 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 284 transition count 432
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 281 transition count 431
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 280 transition count 431
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 8 place count 280 transition count 423
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 24 place count 272 transition count 423
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 34 place count 267 transition count 418
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 40 place count 264 transition count 419
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 264 transition count 418
Applied a total of 41 rules in 35 ms. Remains 264 /284 variables (removed 20) and now considering 418/435 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 264/284 places, 418/435 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 178480 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :{}
Probabilistic random walk after 178480 steps, saw 115121 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 418 rows 264 cols
[2023-03-20 21:46:44] [INFO ] Computed 121 place invariants in 3 ms
[2023-03-20 21:46:44] [INFO ] [Real]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-20 21:46:44] [INFO ] After 218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 21:46:44] [INFO ] [Nat]Absence check using 121 positive place invariants in 12 ms returned sat
[2023-03-20 21:46:44] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 21:46:44] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 21:46:44] [INFO ] After 42ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 21:46:44] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-20 21:46:44] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 27 ms.
Support contains 16 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 418/418 transitions.
Applied a total of 0 rules in 6 ms. Remains 264 /264 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 264/264 places, 418/418 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 418/418 transitions.
Applied a total of 0 rules in 6 ms. Remains 264 /264 variables (removed 0) and now considering 418/418 (removed 0) transitions.
[2023-03-20 21:46:44] [INFO ] Invariant cache hit.
[2023-03-20 21:46:45] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-20 21:46:45] [INFO ] Invariant cache hit.
[2023-03-20 21:46:45] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-20 21:46:45] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-20 21:46:45] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-20 21:46:45] [INFO ] Invariant cache hit.
[2023-03-20 21:46:45] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 264/264 places, 418/418 transitions.
Graph (trivial) has 103 edges and 264 vertex of which 4 / 264 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 102 edges and 260 vertex of which 6 / 260 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 257 transition count 409
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 100 edges and 254 vertex of which 6 / 254 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 15 rules applied. Total rules applied 23 place count 251 transition count 398
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 96 edges and 249 vertex of which 4 / 249 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 35 place count 247 transition count 389
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 43 place count 246 transition count 382
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 43 place count 246 transition count 381
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 245 transition count 381
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 244 transition count 380
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 795 edges and 244 vertex of which 243 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 50 place count 243 transition count 378
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 55 place count 243 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 56 place count 242 transition count 373
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 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 59 place count 240 transition count 372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 63 place count 240 transition count 368
Applied a total of 63 rules in 43 ms. Remains 240 /264 variables (removed 24) and now considering 368/418 (removed 50) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 368 rows 240 cols
[2023-03-20 21:46:45] [INFO ] Computed 110 place invariants in 2 ms
[2023-03-20 21:46:45] [INFO ] [Real]Absence check using 110 positive place invariants in 14 ms returned sat
[2023-03-20 21:46:45] [INFO ] After 138ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-20 21:46:45] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 21:46:45] [INFO ] After 11ms SMT Verify possible using 3 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 21:46:45] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-20 21:46:45] [INFO ] [Nat]Absence check using 110 positive place invariants in 14 ms returned sat
[2023-03-20 21:46:46] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-20 21:46:46] [INFO ] After 53ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-20 21:46:46] [INFO ] After 126ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-20 21:46:46] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 33 ms
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 35 ms
[2023-03-20 21:46:46] [INFO ] Input system was already deterministic with 1211 transitions.
Computed a total of 371 stabilizing places and 371 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1172 transition count 1172
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1171 transition count 1171
Applied a total of 80 rules in 96 ms. Remains 1171 /1211 variables (removed 40) and now considering 1171/1211 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1171/1211 places, 1171/1211 transitions.
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 27 ms
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 26 ms
[2023-03-20 21:46:46] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 341 place count 1210 transition count 869
Reduce places removed 341 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 343 rules applied. Total rules applied 684 place count 869 transition count 867
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 685 place count 868 transition count 867
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 685 place count 868 transition count 650
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1119 place count 651 transition count 650
Discarding 27 places :
Symmetric choice reduction at 3 with 27 rule applications. Total rules 1146 place count 624 transition count 623
Iterating global reduction 3 with 27 rules applied. Total rules applied 1173 place count 624 transition count 623
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1173 place count 624 transition count 600
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1219 place count 601 transition count 600
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 3 with 476 rules applied. Total rules applied 1695 place count 363 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1697 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1698 place count 360 transition count 360
Applied a total of 1698 rules in 87 ms. Remains 360 /1211 variables (removed 851) and now considering 360/1211 (removed 851) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 87 ms. Remains : 360/1211 places, 360/1211 transitions.
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 10 ms
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 11 ms
[2023-03-20 21:46:46] [INFO ] Input system was already deterministic with 360 transitions.
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
FORMULA ShieldRVt-PT-030B-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1210 transition count 870
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 342 rules applied. Total rules applied 682 place count 870 transition count 868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 683 place count 869 transition count 868
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 218 Pre rules applied. Total rules applied 683 place count 869 transition count 650
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 3 with 436 rules applied. Total rules applied 1119 place count 651 transition count 650
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1145 place count 625 transition count 624
Iterating global reduction 3 with 26 rules applied. Total rules applied 1171 place count 625 transition count 624
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 1171 place count 625 transition count 602
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1215 place count 603 transition count 602
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1693 place count 364 transition count 363
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1695 place count 362 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1696 place count 361 transition count 361
Applied a total of 1696 rules in 78 ms. Remains 361 /1211 variables (removed 850) and now considering 361/1211 (removed 850) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 361/1211 places, 361/1211 transitions.
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:46:46] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:46:46] [INFO ] Input system was already deterministic with 361 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1174 transition count 1174
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1173 transition count 1173
Applied a total of 76 rules in 95 ms. Remains 1173 /1211 variables (removed 38) and now considering 1173/1211 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 1173/1211 places, 1173/1211 transitions.
[2023-03-20 21:46:47] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:46:47] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:46:47] [INFO ] Input system was already deterministic with 1173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1174 transition count 1174
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 1173 transition count 1173
Applied a total of 76 rules in 89 ms. Remains 1173 /1211 variables (removed 38) and now considering 1173/1211 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1173/1211 places, 1173/1211 transitions.
[2023-03-20 21:46:47] [INFO ] Flatten gal took : 21 ms
[2023-03-20 21:46:47] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:46:47] [INFO ] Input system was already deterministic with 1173 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 341 transitions
Trivial Post-agglo rules discarded 341 transitions
Performed 341 trivial Post agglomeration. Transition count delta: 341
Iterating post reduction 0 with 341 rules applied. Total rules applied 341 place count 1210 transition count 869
Reduce places removed 341 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 343 rules applied. Total rules applied 684 place count 869 transition count 867
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 686 place count 868 transition count 866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 687 place count 867 transition count 866
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 216 Pre rules applied. Total rules applied 687 place count 867 transition count 650
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 4 with 432 rules applied. Total rules applied 1119 place count 651 transition count 650
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 1146 place count 624 transition count 623
Iterating global reduction 4 with 27 rules applied. Total rules applied 1173 place count 624 transition count 623
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1173 place count 624 transition count 600
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1219 place count 601 transition count 600
Performed 238 Post agglomeration using F-continuation condition.Transition count delta: 238
Deduced a syphon composed of 238 places in 0 ms
Reduce places removed 238 places and 0 transitions.
Iterating global reduction 4 with 476 rules applied. Total rules applied 1695 place count 363 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1697 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1698 place count 360 transition count 360
Applied a total of 1698 rules in 73 ms. Remains 360 /1211 variables (removed 851) and now considering 360/1211 (removed 851) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 360/1211 places, 360/1211 transitions.
[2023-03-20 21:46:47] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:46:47] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:46:47] [INFO ] Input system was already deterministic with 360 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 787040 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :{}
Probabilistic random walk after 787040 steps, saw 701256 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 360 rows 360 cols
[2023-03-20 21:46:50] [INFO ] Computed 120 place invariants in 3 ms
[2023-03-20 21:46:50] [INFO ] [Real]Absence check using 120 positive place invariants in 19 ms returned sat
[2023-03-20 21:46:50] [INFO ] After 118ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 21:46:50] [INFO ] After 136ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-20 21:46:50] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 566 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=188 )
FORMULA ShieldRVt-PT-030B-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 342 transitions
Trivial Post-agglo rules discarded 342 transitions
Performed 342 trivial Post agglomeration. Transition count delta: 342
Iterating post reduction 0 with 342 rules applied. Total rules applied 342 place count 1210 transition count 868
Reduce places removed 342 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 344 rules applied. Total rules applied 686 place count 868 transition count 866
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 687 place count 867 transition count 866
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 687 place count 867 transition count 649
Deduced a syphon composed of 217 places in 2 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1121 place count 650 transition count 649
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 1147 place count 624 transition count 623
Iterating global reduction 3 with 26 rules applied. Total rules applied 1173 place count 624 transition count 623
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 1173 place count 624 transition count 601
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 1217 place count 602 transition count 601
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 239
Deduced a syphon composed of 239 places in 0 ms
Reduce places removed 239 places and 0 transitions.
Iterating global reduction 3 with 478 rules applied. Total rules applied 1695 place count 363 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1697 place count 361 transition count 360
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1698 place count 360 transition count 360
Applied a total of 1698 rules in 76 ms. Remains 360 /1211 variables (removed 851) and now considering 360/1211 (removed 851) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 360/1211 places, 360/1211 transitions.
[2023-03-20 21:46:50] [INFO ] Flatten gal took : 9 ms
[2023-03-20 21:46:50] [INFO ] Flatten gal took : 8 ms
[2023-03-20 21:46:50] [INFO ] Input system was already deterministic with 360 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1172 transition count 1172
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1171 transition count 1171
Applied a total of 80 rules in 114 ms. Remains 1171 /1211 variables (removed 40) and now considering 1171/1211 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 1171/1211 places, 1171/1211 transitions.
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 23 ms
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 22 ms
[2023-03-20 21:46:51] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1173 transition count 1173
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1172 transition count 1172
Applied a total of 78 rules in 122 ms. Remains 1172 /1211 variables (removed 39) and now considering 1172/1211 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 1172/1211 places, 1172/1211 transitions.
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 20 ms
[2023-03-20 21:46:51] [INFO ] Input system was already deterministic with 1172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1184 transition count 1184
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1184 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1183 transition count 1183
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1183 transition count 1183
Applied a total of 56 rules in 89 ms. Remains 1183 /1211 variables (removed 28) and now considering 1183/1211 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1183/1211 places, 1183/1211 transitions.
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 21 ms
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 21 ms
[2023-03-20 21:46:51] [INFO ] Input system was already deterministic with 1183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1178 transition count 1178
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1177 transition count 1177
Applied a total of 68 rules in 118 ms. Remains 1177 /1211 variables (removed 34) and now considering 1177/1211 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 1177/1211 places, 1177/1211 transitions.
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 20 ms
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 21 ms
[2023-03-20 21:46:51] [INFO ] Input system was already deterministic with 1177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1173 transition count 1173
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 1172 transition count 1172
Applied a total of 78 rules in 87 ms. Remains 1172 /1211 variables (removed 39) and now considering 1172/1211 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 1172/1211 places, 1172/1211 transitions.
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 20 ms
[2023-03-20 21:46:51] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:46:51] [INFO ] Input system was already deterministic with 1172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1172 transition count 1172
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 1171 transition count 1171
Applied a total of 80 rules in 90 ms. Remains 1171 /1211 variables (removed 40) and now considering 1171/1211 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 1171/1211 places, 1171/1211 transitions.
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 18 ms
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 17 ms
[2023-03-20 21:46:52] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1179 transition count 1179
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1179 transition count 1179
Applied a total of 64 rules in 70 ms. Remains 1179 /1211 variables (removed 32) and now considering 1179/1211 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 1179/1211 places, 1179/1211 transitions.
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 19 ms
[2023-03-20 21:46:52] [INFO ] Input system was already deterministic with 1179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1210 transition count 870
Reduce places removed 340 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 342 rules applied. Total rules applied 682 place count 870 transition count 868
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 683 place count 869 transition count 868
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 683 place count 869 transition count 652
Deduced a syphon composed of 216 places in 0 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1115 place count 653 transition count 652
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 1143 place count 625 transition count 624
Iterating global reduction 3 with 28 rules applied. Total rules applied 1171 place count 625 transition count 624
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 1171 place count 625 transition count 601
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 1217 place count 602 transition count 601
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 237
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 3 with 474 rules applied. Total rules applied 1691 place count 365 transition count 364
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1693 place count 363 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1694 place count 362 transition count 362
Applied a total of 1694 rules in 61 ms. Remains 362 /1211 variables (removed 849) and now considering 362/1211 (removed 849) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 362/1211 places, 362/1211 transitions.
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 6 ms
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 7 ms
[2023-03-20 21:46:52] [INFO ] Input system was already deterministic with 362 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1211/1211 places, 1211/1211 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 1210 transition count 873
Reduce places removed 337 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 339 rules applied. Total rules applied 676 place count 873 transition count 871
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 678 place count 872 transition count 870
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 679 place count 871 transition count 870
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 216 Pre rules applied. Total rules applied 679 place count 871 transition count 654
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 4 with 432 rules applied. Total rules applied 1111 place count 655 transition count 654
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 1139 place count 627 transition count 626
Iterating global reduction 4 with 28 rules applied. Total rules applied 1167 place count 627 transition count 626
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 1167 place count 627 transition count 603
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 1213 place count 604 transition count 603
Performed 237 Post agglomeration using F-continuation condition.Transition count delta: 237
Deduced a syphon composed of 237 places in 0 ms
Reduce places removed 237 places and 0 transitions.
Iterating global reduction 4 with 474 rules applied. Total rules applied 1687 place count 367 transition count 366
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1689 place count 365 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1690 place count 364 transition count 364
Applied a total of 1690 rules in 60 ms. Remains 364 /1211 variables (removed 847) and now considering 364/1211 (removed 847) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 364/1211 places, 364/1211 transitions.
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 7 ms
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 7 ms
[2023-03-20 21:46:52] [INFO ] Input system was already deterministic with 364 transitions.
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 18 ms
[2023-03-20 21:46:52] [INFO ] Flatten gal took : 18 ms
[2023-03-20 21:46:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-20 21:46:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1211 places, 1211 transitions and 2962 arcs took 5 ms.
Total runtime 48340 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: 1211 NrTr: 1211 NrArc: 2962)

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

net check time: 0m 0.000sec

init dd package: 0m 3.543sec


before gc: list nodes free: 1334088

after gc: idd nodes used:45893822, unused:18106178; list nodes free:80782212

RS generation: 29m 7.867sec


-> last computed set: #nodes 45892613 (4.6e+07) #states 182,373,978,697,375,784,666,045 (23)


CANNOT_COMPUTE


BK_STOP 1679350593627

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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.003sec

idd.cc:820: DD Exception: No free nodes

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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r426-tajo-167905978700298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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