About the Execution of Marcie+red for Szymanski-PT-a08
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6766.123 | 72207.00 | 72212.00 | 6832.10 | TFFFTTTFTTFFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r490-tall-167912708600426.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is Szymanski-PT-a08, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600426
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 16:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K 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 Szymanski-PT-a08-CTLFireability-00
FORMULA_NAME Szymanski-PT-a08-CTLFireability-01
FORMULA_NAME Szymanski-PT-a08-CTLFireability-02
FORMULA_NAME Szymanski-PT-a08-CTLFireability-03
FORMULA_NAME Szymanski-PT-a08-CTLFireability-04
FORMULA_NAME Szymanski-PT-a08-CTLFireability-05
FORMULA_NAME Szymanski-PT-a08-CTLFireability-06
FORMULA_NAME Szymanski-PT-a08-CTLFireability-07
FORMULA_NAME Szymanski-PT-a08-CTLFireability-08
FORMULA_NAME Szymanski-PT-a08-CTLFireability-09
FORMULA_NAME Szymanski-PT-a08-CTLFireability-10
FORMULA_NAME Szymanski-PT-a08-CTLFireability-11
FORMULA_NAME Szymanski-PT-a08-CTLFireability-12
FORMULA_NAME Szymanski-PT-a08-CTLFireability-13
FORMULA_NAME Szymanski-PT-a08-CTLFireability-14
FORMULA_NAME Szymanski-PT-a08-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679254787570
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=Szymanski-PT-a08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:39:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 19:39:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:39:49] [INFO ] Load time of PNML (sax parser for PT used): 51 ms
[2023-03-19 19:39:49] [INFO ] Transformed 61 places.
[2023-03-19 19:39:49] [INFO ] Transformed 224 transitions.
[2023-03-19 19:39:49] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
Support contains 38 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 216
Applied a total of 2 rules in 13 ms. Remains 47 /49 variables (removed 2) and now considering 216/216 (removed 0) transitions.
[2023-03-19 19:39:49] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 47 cols
[2023-03-19 19:39:49] [INFO ] Computed 1 place invariants in 6 ms
[2023-03-19 19:39:49] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-19 19:39:49] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:39:49] [INFO ] Invariant cache hit.
[2023-03-19 19:39:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:39:50] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-19 19:39:50] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:39:50] [INFO ] Invariant cache hit.
[2023-03-19 19:39:50] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 216/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 358 ms. Remains : 47/49 places, 216/216 transitions.
Support contains 38 out of 47 places after structural reductions.
[2023-03-19 19:39:50] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 19:39:50] [INFO ] Flatten gal took : 35 ms
FORMULA Szymanski-PT-a08-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:39:50] [INFO ] Flatten gal took : 15 ms
[2023-03-19 19:39:50] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 67) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 28) 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 28) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 22) seen :5
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 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 16 ms. (steps per millisecond=62 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-19 19:39:50] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:39:50] [INFO ] Invariant cache hit.
[2023-03-19 19:39:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:39:51] [INFO ] After 76ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2 real:11
[2023-03-19 19:39:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:39:51] [INFO ] After 16ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :3 sat :0 real:13
[2023-03-19 19:39:51] [INFO ] After 191ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:13
[2023-03-19 19:39:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:39:51] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :13
[2023-03-19 19:39:51] [INFO ] After 50ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :3 sat :13
[2023-03-19 19:39:51] [INFO ] After 157ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :13
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 19:39:51] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :13
Fused 16 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 81 ms.
Support contains 14 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 216/216 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 215
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 4 place count 44 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 44 transition count 203
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 23 place count 44 transition count 187
Applied a total of 23 rules in 36 ms. Remains 44 /47 variables (removed 3) and now considering 187/216 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 44/47 places, 187/216 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) 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 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Finished probabilistic random walk after 52426 steps, run visited all 13 properties in 216 ms. (steps per millisecond=242 )
Probabilistic random walk after 52426 steps, saw 38558 distinct states, run finished after 216 ms. (steps per millisecond=242 ) properties seen :13
Successfully simplified 3 atomic propositions for a total of 15 simplifications.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 12 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 216 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 19 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 172 transitions.
Incomplete random walk after 10002 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 600 steps, run visited all 1 properties in 6 ms. (steps per millisecond=100 )
Probabilistic random walk after 600 steps, saw 435 distinct states, run finished after 6 ms. (steps per millisecond=100 ) properties seen :1
FORMULA Szymanski-PT-a08-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 204
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 204/216 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/47 places, 204/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 3 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 208
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 208
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 208/216 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/47 places, 208/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 208 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 41 transition count 176
Applied a total of 28 rules in 13 ms. Remains 41 /47 variables (removed 6) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 41/47 places, 176/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 176 transitions.
Finished random walk after 339 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=339 )
FORMULA Szymanski-PT-a08-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 212
Applied a total of 2 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 212/216 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 46/47 places, 212/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 212 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 26 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 40 transition count 172
Applied a total of 30 rules in 11 ms. Remains 40 /47 variables (removed 7) and now considering 172/216 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 40/47 places, 172/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 172 transitions.
Finished random walk after 907 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=453 )
FORMULA Szymanski-PT-a08-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 41 transition count 176
Applied a total of 28 rules in 11 ms. Remains 41 /47 variables (removed 6) and now considering 176/216 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 41/47 places, 176/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 1 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 24 place count 43 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 42 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 42 transition count 180
Applied a total of 26 rules in 11 ms. Remains 42 /47 variables (removed 5) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 42/47 places, 180/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 1 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 1 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /47 variables (removed 5) and now considering 196/216 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/47 places, 196/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 216/216 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 1 ms. Remains 43 /47 variables (removed 4) and now considering 200/216 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:39:52] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:39:52] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:39:52] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 19:39:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 216 transitions and 860 arcs took 2 ms.
Total runtime 3253 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: 47 NrTr: 216 NrArc: 860)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 2.898sec
RS generation: 0m 7.805sec
-> reachability set: #nodes 5558 (5.6e+03) #states 3,955,934,872,799 (12)
starting MCC model checker
--------------------------
checking: ~ [A [EX [AF [AX [[1<=p0 & 1<=p13]]]] U EX [EF [[1<=p1 & 1<=p43]]]]]
normalized: ~ [[~ [EG [~ [EX [E [true U [1<=p1 & 1<=p43]]]]]] & ~ [E [~ [EX [E [true U [1<=p1 & 1<=p43]]]] U [~ [EX [E [true U [1<=p1 & 1<=p43]]]] & ~ [EX [~ [EG [EX [~ [[1<=p0 & 1<=p13]]]]]]]]]]]]
abstracting: (1<=p13)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
..
EG iterations: 1
.abstracting: (1<=p43)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
.abstracting: (1<=p43)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
.abstracting: (1<=p43)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
..
EG iterations: 1
-> the formula is FALSE
FORMULA Szymanski-PT-a08-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.232sec
checking: A [AX [[1<=p0 & 1<=p31]] U ~ [AX [EF [[AF [[1<=p3 & 1<=p38]] | [1<=p1 & 1<=p25]]]]]]
normalized: [~ [EG [~ [EX [~ [E [true U [[1<=p1 & 1<=p25] | ~ [EG [~ [[1<=p3 & 1<=p38]]]]]]]]]]] & ~ [E [~ [EX [~ [E [true U [[1<=p1 & 1<=p25] | ~ [EG [~ [[1<=p3 & 1<=p38]]]]]]]]] U [~ [EX [~ [E [true U [[1<=p1 & 1<=p25] | ~ [EG [~ [[1<=p3 & 1<=p38]]]]]]]]] & EX [~ [[1<=p0 & 1<=p31]]]]]]]
abstracting: (1<=p31)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
.abstracting: (1<=p38)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
..
EG iterations: 2
abstracting: (1<=p25)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
.abstracting: (1<=p38)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
..
EG iterations: 2
abstracting: (1<=p25)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
.abstracting: (1<=p38)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
..
EG iterations: 2
abstracting: (1<=p25)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
...
EG iterations: 2
-> the formula is FALSE
FORMULA Szymanski-PT-a08-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.039sec
checking: EX [AX [[AF [[[p1<=0 | p31<=0] & [p2<=0 | p24<=0]]] | AX [[p1<=0 | p20<=0]]]]]
normalized: EX [~ [EX [~ [[~ [EX [~ [[p1<=0 | p20<=0]]]] | ~ [EG [~ [[[p2<=0 | p24<=0] & [p1<=0 | p31<=0]]]]]]]]]]
abstracting: (p31<=0)
states: 2,769,915,460,895 (12)
abstracting: (p1<=0)
states: 2,733,954,774,395 (12)
abstracting: (p24<=0)
states: 2,719,579,903,615 (12)
abstracting: (p2<=0)
states: 2,733,952,554,321 (12)
.......................
EG iterations: 23
abstracting: (p20<=0)
states: 2,719,579,903,615 (12)
abstracting: (p1<=0)
states: 2,733,954,774,395 (12)
...-> the formula is TRUE
FORMULA Szymanski-PT-a08-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.271sec
checking: AX [[AF [[p1<=0 | p39<=0]] & AF [[EG [[1<=p2 & 1<=p42]] | EF [[1<=p1 & 1<=p31]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[E [true U [1<=p1 & 1<=p31]] | EG [[1<=p2 & 1<=p42]]]]]] & ~ [EG [~ [[p1<=0 | p39<=0]]]]]]]]
abstracting: (p39<=0)
states: 2,769,915,460,895 (12)
abstracting: (p1<=0)
states: 2,733,954,774,395 (12)
................
EG iterations: 16
abstracting: (1<=p42)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
.
EG iterations: 1
abstracting: (1<=p31)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA Szymanski-PT-a08-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.008sec
checking: [AF [AG [[p0<=0 | p42<=0]]] | [AX [[AX [[1<=p0 & 1<=p24]] | [1<=p2 & 1<=p44]]] | [AF [[p3<=0 | p38<=0]] & AX [[1<=p0 & 1<=p37]]]]]
normalized: [[~ [EX [~ [[[1<=p2 & 1<=p44] | ~ [EX [~ [[1<=p0 & 1<=p24]]]]]]]] | [~ [EX [~ [[1<=p0 & 1<=p37]]]] & ~ [EG [~ [[p3<=0 | p38<=0]]]]]] | ~ [EG [E [true U ~ [[p0<=0 | p42<=0]]]]]]
abstracting: (p42<=0)
states: 2,769,915,460,895 (12)
abstracting: (p0<=0)
states: 3,724,010,395,780 (12)
.
EG iterations: 1
abstracting: (p38<=0)
states: 2,769,915,460,895 (12)
abstracting: (p3<=0)
states: 3,724,011,053,581 (12)
...............
EG iterations: 15
abstracting: (1<=p37)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
.abstracting: (1<=p24)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
.abstracting: (1<=p44)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
.-> the formula is FALSE
FORMULA Szymanski-PT-a08-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.695sec
checking: [EG [AX [[EF [[p2<=0 | p43<=0]] & [p2<=0 | p23<=0]]]] & AF [[AG [[p2<=0 | p43<=0]] | [[1<=p2 & 1<=p22] | EF [[1<=p1 & 1<=p28]]]]]]
normalized: [EG [~ [EX [~ [[[p2<=0 | p23<=0] & E [true U [p2<=0 | p43<=0]]]]]]] & ~ [EG [~ [[[[1<=p2 & 1<=p22] | E [true U [1<=p1 & 1<=p28]]] | ~ [E [true U ~ [[p2<=0 | p43<=0]]]]]]]]]
abstracting: (p43<=0)
states: 2,769,915,460,895 (12)
abstracting: (p2<=0)
states: 2,733,952,554,321 (12)
abstracting: (1<=p28)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p22)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
.
EG iterations: 1
abstracting: (p43<=0)
states: 2,769,915,460,895 (12)
abstracting: (p2<=0)
states: 2,733,952,554,321 (12)
abstracting: (p23<=0)
states: 2,719,579,903,615 (12)
abstracting: (p2<=0)
states: 2,733,952,554,321 (12)
...
EG iterations: 2
-> the formula is TRUE
FORMULA Szymanski-PT-a08-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.596sec
checking: AF [AG [[[[[1<=p0 & 1<=p34] | [[p2<=0 | p13<=0] & [p2<=0 | p32<=0]]] | [p2<=0 | p21<=0]] & [~ [A [[1<=p7 & 1<=p11] U [1<=p2 & 1<=p42]]] | EX [[p3<=0 | p15<=0]]]]]]
normalized: ~ [EG [E [true U ~ [[[EX [[p3<=0 | p15<=0]] | ~ [[~ [EG [~ [[1<=p2 & 1<=p42]]]] & ~ [E [~ [[1<=p2 & 1<=p42]] U [~ [[1<=p7 & 1<=p11]] & ~ [[1<=p2 & 1<=p42]]]]]]]] & [[p2<=0 | p21<=0] | [[[p2<=0 | p32<=0] & [p2<=0 | p13<=0]] | [1<=p0 & 1<=p34]]]]]]]]
abstracting: (1<=p34)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (p13<=0)
states: 2,719,579,903,615 (12)
abstracting: (p2<=0)
states: 2,733,952,554,321 (12)
abstracting: (p32<=0)
states: 2,769,915,460,895 (12)
abstracting: (p2<=0)
states: 2,733,952,554,321 (12)
abstracting: (p21<=0)
states: 2,719,579,903,615 (12)
abstracting: (p2<=0)
states: 2,733,952,554,321 (12)
abstracting: (1<=p42)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p11)
states: 630,458,076,954 (11)
abstracting: (1<=p7)
states: 19,313,262,708 (10)
abstracting: (1<=p42)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p42)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
..
EG iterations: 2
abstracting: (p15<=0)
states: 2,719,579,903,615 (12)
abstracting: (p3<=0)
states: 3,724,011,053,581 (12)
..
EG iterations: 1
-> the formula is FALSE
FORMULA Szymanski-PT-a08-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.539sec
checking: EF [[A [~ [EG [[1<=p2 & 1<=p37]]] U ~ [[EF [[[1<=p1 & 1<=p41] | [1<=p0 & 1<=p9]]] | E [[1<=p0 & 1<=p9] U ~ [[p3<=0 | p15<=0]]]]]] & [p1<=0 | [p33<=0 | [1<=p0 & 1<=p15]]]]]
normalized: E [true U [[p1<=0 | [p33<=0 | [1<=p0 & 1<=p15]]] & [~ [EG [[E [[1<=p0 & 1<=p9] U ~ [[p3<=0 | p15<=0]]] | E [true U [[1<=p0 & 1<=p9] | [1<=p1 & 1<=p41]]]]]] & ~ [E [[E [[1<=p0 & 1<=p9] U ~ [[p3<=0 | p15<=0]]] | E [true U [[1<=p0 & 1<=p9] | [1<=p1 & 1<=p41]]]] U [EG [[1<=p2 & 1<=p37]] & [E [[1<=p0 & 1<=p9] U ~ [[p3<=0 | p15<=0]]] | E [true U [[1<=p0 & 1<=p9] | [1<=p1 & 1<=p41]]]]]]]]]]
abstracting: (1<=p41)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (p15<=0)
states: 2,719,579,903,615 (12)
abstracting: (p3<=0)
states: 3,724,011,053,581 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p37)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
.
EG iterations: 1
abstracting: (1<=p41)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (p15<=0)
states: 2,719,579,903,615 (12)
abstracting: (p3<=0)
states: 3,724,011,053,581 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p41)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (p15<=0)
states: 2,719,579,903,615 (12)
abstracting: (p3<=0)
states: 3,724,011,053,581 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
.
EG iterations: 1
abstracting: (1<=p15)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (p33<=0)
states: 2,769,915,460,895 (12)
abstracting: (p1<=0)
states: 2,733,954,774,395 (12)
-> the formula is TRUE
FORMULA Szymanski-PT-a08-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.084sec
checking: E [~ [[1<=p2 & 1<=p25]] U [AG [~ [[AF [[1<=p2 & 1<=p27]] | [1<=p1 & 1<=p8]]]] | [[1<=p3 & 1<=p21] | [A [~ [[1<=p3 & 1<=p41]] U ~ [AX [[1<=p3 & 1<=p22]]]] & EG [~ [EF [[1<=p2 & 1<=p26]]]]]]]]
normalized: E [~ [[1<=p2 & 1<=p25]] U [[[[~ [EG [~ [EX [~ [[1<=p3 & 1<=p22]]]]]] & ~ [E [~ [EX [~ [[1<=p3 & 1<=p22]]]] U [~ [EX [~ [[1<=p3 & 1<=p22]]]] & [1<=p3 & 1<=p41]]]]] & EG [~ [E [true U [1<=p2 & 1<=p26]]]]] | [1<=p3 & 1<=p21]] | ~ [E [true U [[1<=p1 & 1<=p8] | ~ [EG [~ [[1<=p2 & 1<=p27]]]]]]]]]
abstracting: (1<=p27)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
..
EG iterations: 2
abstracting: (1<=p8)
states: 372,482,170,234 (11)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p26)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
.
EG iterations: 1
abstracting: (1<=p41)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p22)
states: 1,236,354,969,184 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
.abstracting: (1<=p22)
states: 1,236,354,969,184 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
.abstracting: (1<=p22)
states: 1,236,354,969,184 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
...
EG iterations: 2
abstracting: (1<=p25)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
-> the formula is TRUE
FORMULA Szymanski-PT-a08-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.742sec
checking: [AG [A [[[AF [[1<=p3 & 1<=p40]] & ~ [[1<=p1 & 1<=p21]]] | [1<=p0 & 1<=p21]] U [~ [[1<=p2 & 1<=p44]] & ~ [[~ [[1<=p3 & 1<=p20]] & AF [[1<=p0 & 1<=p21]]]]]]] & [EG [[p1<=0 | p8<=0]] | ~ [E [[1<=p0 & 1<=p8] U AF [~ [[1<=p0 & 1<=p18]]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [[~ [[~ [EG [~ [[1<=p0 & 1<=p21]]]] & ~ [[1<=p3 & 1<=p20]]]] & ~ [[1<=p2 & 1<=p44]]]]]] & ~ [E [~ [[~ [[~ [EG [~ [[1<=p0 & 1<=p21]]]] & ~ [[1<=p3 & 1<=p20]]]] & ~ [[1<=p2 & 1<=p44]]]] U [~ [[[~ [EG [~ [[1<=p3 & 1<=p40]]]] & ~ [[1<=p1 & 1<=p21]]] | [1<=p0 & 1<=p21]]] & ~ [[~ [[~ [EG [~ [[1<=p0 & 1<=p21]]]] & ~ [[1<=p3 & 1<=p20]]]] & ~ [[1<=p2 & 1<=p44]]]]]]]]]]] & [~ [E [[1<=p0 & 1<=p8] U ~ [EG [[1<=p0 & 1<=p18]]]]] | EG [[p1<=0 | p8<=0]]]]
abstracting: (p8<=0)
states: 3,583,452,702,565 (12)
abstracting: (p1<=0)
states: 2,733,954,774,395 (12)
..
EG iterations: 2
abstracting: (1<=p18)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
...............
EG iterations: 15
abstracting: (1<=p8)
states: 372,482,170,234 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p44)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p20)
states: 1,236,354,969,184 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
..
EG iterations: 2
abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p40)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
..
EG iterations: 2
abstracting: (1<=p44)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p20)
states: 1,236,354,969,184 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
..
EG iterations: 2
abstracting: (1<=p44)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p20)
states: 1,236,354,969,184 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
..
EG iterations: 2
...............
EG iterations: 15
-> the formula is FALSE
FORMULA Szymanski-PT-a08-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.510sec
checking: AX [[[EG [AG [[p3<=0 | p25<=0]]] & [p1<=0 | [p45<=0 | [1<=p1 & 1<=p27]]]] | [AX [E [[1<=p1 & 1<=p9] U [1<=p1 & 1<=p24]]] & [[E [[1<=p0 & 1<=p43] U [1<=p1 & 1<=p21]] | AG [[1<=p0 & 1<=p46]]] | [[AG [[1<=p2 & 1<=p33]] & A [[1<=p3 & 1<=p45] U [1<=p2 & 1<=p37]]] | [[1<=p3 & 1<=p35] | [1<=p2 & 1<=p36]]]]]]]
normalized: ~ [EX [~ [[[[[[[~ [EG [~ [[1<=p2 & 1<=p37]]]] & ~ [E [~ [[1<=p2 & 1<=p37]] U [~ [[1<=p3 & 1<=p45]] & ~ [[1<=p2 & 1<=p37]]]]]] & ~ [E [true U ~ [[1<=p2 & 1<=p33]]]]] | [[1<=p2 & 1<=p36] | [1<=p3 & 1<=p35]]] | [~ [E [true U ~ [[1<=p0 & 1<=p46]]]] | E [[1<=p0 & 1<=p43] U [1<=p1 & 1<=p21]]]] & ~ [EX [~ [E [[1<=p1 & 1<=p9] U [1<=p1 & 1<=p24]]]]]] | [[p1<=0 | [p45<=0 | [1<=p1 & 1<=p27]]] & EG [~ [E [true U ~ [[p3<=0 | p25<=0]]]]]]]]]]
abstracting: (p25<=0)
states: 2,719,579,903,615 (12)
abstracting: (p3<=0)
states: 3,724,011,053,581 (12)
.
EG iterations: 1
abstracting: (1<=p27)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (p45<=0)
states: 2,769,915,460,895 (12)
abstracting: (p1<=0)
states: 2,733,954,774,395 (12)
abstracting: (1<=p24)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
.abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p43)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p46)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p35)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p36)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p33)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p37)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p45)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p37)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p37)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
..
EG iterations: 2
.-> the formula is FALSE
FORMULA Szymanski-PT-a08-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.617sec
checking: E [[[[~ [[1<=p2 & 1<=p45]] & [EX [[1<=p1 & 1<=p35]] | ~ [[1<=p0 & 1<=p8]]]] & E [[1<=p3 & 1<=p34] U [1<=p2 & 1<=p37]]] & [EX [[[A [[1<=p1 & 1<=p25] U [1<=p2 & 1<=p13]] | EF [[1<=p3 & 1<=p41]]] | [~ [[1<=p0 & 1<=p41]] | [1<=p2 & 1<=p14]]]] & AG [[1<=p3 & 1<=p36]]]] U [E [[EF [[1<=p0 & 1<=p36]] | ~ [[1<=p0 & 1<=p35]]] U [~ [[1<=p2 & 1<=p11]] & [[[1<=p0 & 1<=p8] | E [[1<=p2 & 1<=p15] U [1<=p0 & 1<=p21]]] & [EF [[1<=p1 & 1<=p42]] | [[1<=p3 & 1<=p9] | [1<=p1 & 1<=p32]]]]]] | [1<=p2 & 1<=p12]]]
normalized: E [[[~ [E [true U ~ [[1<=p3 & 1<=p36]]]] & EX [[[[1<=p2 & 1<=p14] | ~ [[1<=p0 & 1<=p41]]] | [E [true U [1<=p3 & 1<=p41]] | [~ [EG [~ [[1<=p2 & 1<=p13]]]] & ~ [E [~ [[1<=p2 & 1<=p13]] U [~ [[1<=p1 & 1<=p25]] & ~ [[1<=p2 & 1<=p13]]]]]]]]]] & [E [[1<=p3 & 1<=p34] U [1<=p2 & 1<=p37]] & [[~ [[1<=p0 & 1<=p8]] | EX [[1<=p1 & 1<=p35]]] & ~ [[1<=p2 & 1<=p45]]]]] U [E [[E [true U [1<=p0 & 1<=p36]] | ~ [[1<=p0 & 1<=p35]]] U [[[[[1<=p1 & 1<=p32] | [1<=p3 & 1<=p9]] | E [true U [1<=p1 & 1<=p42]]] & [E [[1<=p2 & 1<=p15] U [1<=p0 & 1<=p21]] | [1<=p0 & 1<=p8]]] & ~ [[1<=p2 & 1<=p11]]]] | [1<=p2 & 1<=p12]]]
abstracting: (1<=p12)
states: 1,435,817,531,152 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p11)
states: 630,458,076,954 (11)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p8)
states: 372,482,170,234 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p21)
states: 1,236,354,969,184 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p15)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p42)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p9)
states: 593,158,212,918 (11)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p32)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p35)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p36)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p45)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p35)
states: 1,186,019,411,904 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
.abstracting: (1<=p8)
states: 372,482,170,234 (11)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p37)
states: 1,186,019,411,904 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p34)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p13)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p25)
states: 1,236,354,969,184 (12)
abstracting: (1<=p1)
states: 1,221,980,098,404 (12)
abstracting: (1<=p13)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
abstracting: (1<=p13)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
..
EG iterations: 2
abstracting: (1<=p41)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
abstracting: (1<=p41)
states: 1,186,019,411,904 (12)
abstracting: (1<=p0)
states: 231,924,477,019 (11)
abstracting: (1<=p14)
states: 1,236,354,969,184 (12)
abstracting: (1<=p2)
states: 1,221,982,318,478 (12)
.abstracting: (1<=p36)
states: 1,186,019,411,904 (12)
abstracting: (1<=p3)
states: 231,923,819,218 (11)
-> the formula is TRUE
FORMULA Szymanski-PT-a08-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.515sec
totally nodes used: 9902415 (9.9e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 411016083 126432626 537448709
used/not used/entry size/cache size: 56544873 10563991 16 1024MB
basic ops cache: hits/miss/sum: 30382342 8450022 38832364
used/not used/entry size/cache size: 10096670 6680546 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 230220 77953 308173
used/not used/entry size/cache size: 77575 8311033 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 58086694
1 8313045
2 648878
3 43735
4 4949
5 2250
6 1716
7 1672
8 918
9 497
>= 10 4510
Total processing time: 0m58.105sec
BK_STOP 1679254859777
--------------------
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.000sec
5554 11261 9114 10306
iterations count:461165 (2135), effective:12357 (57)
initing FirstDep: 0m 0.001sec
iterations count:39332 (182), effective:474 (2)
iterations count:39332 (182), effective:474 (2)
iterations count:412 (1), effective:1 (0)
iterations count:39332 (182), effective:474 (2)
iterations count:53514 (247), effective:733 (3)
iterations count:53514 (247), effective:733 (3)
iterations count:226 (1), effective:1 (0)
iterations count:53514 (247), effective:733 (3)
iterations count:35915 (166), effective:439 (2)
iterations count:74592 (345), effective:856 (3)
iterations count:28492 (131), effective:312 (1)
iterations count:29254 (135), effective:427 (1)
iterations count:698 (3), effective:12 (0)
iterations count:298 (1), effective:1 (0)
iterations count:6276 (29), effective:140 (0)
iterations count:25264 (116), effective:219 (1)
iterations count:216 (1), effective:0 (0)
iterations count:25264 (116), effective:219 (1)
iterations count:216 (1), effective:0 (0)
iterations count:16738 (77), effective:178 (0)
iterations count:25264 (116), effective:219 (1)
iterations count:216 (1), effective:0 (0)
iterations count:29264 (135), effective:343 (1)
iterations count:5568 (25), effective:115 (0)
iterations count:5655 (26), effective:112 (0)
iterations count:50102 (231), effective:591 (2)
iterations count:242 (1), effective:2 (0)
iterations count:403 (1), effective:6 (0)
iterations count:50316 (232), effective:568 (2)
iterations count:7688 (35), effective:143 (0)
iterations count:524 (2), effective:2 (0)
iterations count:3082 (14), effective:47 (0)
iterations count:265 (1), effective:4 (0)
iterations count:1178 (5), effective:12 (0)
iterations count:810 (3), effective:10 (0)
iterations count:677 (3), effective:17 (0)
iterations count:39346 (182), effective:474 (2)
iterations count:64220 (297), effective:726 (3)
iterations count:27304 (126), effective:370 (1)
iterations count:1303 (6), effective:17 (0)
iterations count:2937 (13), effective:18 (0)
iterations count:55629 (257), effective:601 (2)
iterations count:446 (2), effective:3 (0)
iterations count:216 (1), effective:0 (0)
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="Szymanski-PT-a08"
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 Szymanski-PT-a08, 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 r490-tall-167912708600426"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a08.tgz
mv Szymanski-PT-a08 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 '
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 ;