About the Execution of Marcie+red for Szymanski-PT-a10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7521.876 | 110679.00 | 106360.00 | 7115.70 | FFTFFFFFTFTFFTFT | 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-167912708600434.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-a10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708600434
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 5.7K Feb 26 17:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 17:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 16:59 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.1K Feb 25 17:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 26 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 17:01 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-a10-CTLFireability-00
FORMULA_NAME Szymanski-PT-a10-CTLFireability-01
FORMULA_NAME Szymanski-PT-a10-CTLFireability-02
FORMULA_NAME Szymanski-PT-a10-CTLFireability-03
FORMULA_NAME Szymanski-PT-a10-CTLFireability-04
FORMULA_NAME Szymanski-PT-a10-CTLFireability-05
FORMULA_NAME Szymanski-PT-a10-CTLFireability-06
FORMULA_NAME Szymanski-PT-a10-CTLFireability-07
FORMULA_NAME Szymanski-PT-a10-CTLFireability-08
FORMULA_NAME Szymanski-PT-a10-CTLFireability-09
FORMULA_NAME Szymanski-PT-a10-CTLFireability-10
FORMULA_NAME Szymanski-PT-a10-CTLFireability-11
FORMULA_NAME Szymanski-PT-a10-CTLFireability-12
FORMULA_NAME Szymanski-PT-a10-CTLFireability-13
FORMULA_NAME Szymanski-PT-a10-CTLFireability-14
FORMULA_NAME Szymanski-PT-a10-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679255160178
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-a10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:46:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 19:46:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:46:01] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-19 19:46:01] [INFO ] Transformed 61 places.
[2023-03-19 19:46:01] [INFO ] Transformed 224 transitions.
[2023-03-19 19:46:01] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a10-CTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 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 12 ms. Remains 47 /49 variables (removed 2) and now considering 216/216 (removed 0) transitions.
[2023-03-19 19:46:01] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 47 cols
[2023-03-19 19:46:01] [INFO ] Computed 1 place invariants in 12 ms
[2023-03-19 19:46:01] [INFO ] Implicit Places using invariants in 151 ms returned []
[2023-03-19 19:46:01] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:46:01] [INFO ] Invariant cache hit.
[2023-03-19 19:46:02] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:46:02] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-19 19:46:02] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:46:02] [INFO ] Invariant cache hit.
[2023-03-19 19:46:02] [INFO ] Dead Transitions using invariants and state equation in 112 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 379 ms. Remains : 47/49 places, 216/216 transitions.
Support contains 43 out of 47 places after structural reductions.
[2023-03-19 19:46:02] [INFO ] Flatten gal took : 34 ms
[2023-03-19 19:46:02] [INFO ] Flatten gal took : 14 ms
[2023-03-19 19:46:02] [INFO ] Input system was already deterministic with 216 transitions.
Incomplete random walk after 10000 steps, including 14 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 79) seen :47
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) 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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) 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 31) 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 31) 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 31) seen :7
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) 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 21) seen :0
Running SMT prover for 21 properties.
[2023-03-19 19:46:02] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2023-03-19 19:46:02] [INFO ] Invariant cache hit.
[2023-03-19 19:46:02] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:46:02] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-19 19:46:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-19 19:46:03] [INFO ] After 307ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :14
[2023-03-19 19:46:03] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:46:03] [INFO ] After 58ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :7 sat :14
[2023-03-19 19:46:03] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :14
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-19 19:46:03] [INFO ] After 623ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :14
Fused 21 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 85 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.
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 22 ms. Remains 42 /47 variables (removed 5) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 42/47 places, 180/216 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Finished probabilistic random walk after 5905 steps, run visited all 13 properties in 28 ms. (steps per millisecond=210 )
Probabilistic random walk after 5905 steps, saw 4530 distinct states, run finished after 28 ms. (steps per millisecond=210 ) properties seen :13
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-a10-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a10-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 10 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 216 transitions.
Computed a total of 9 stabilizing places and 36 stable 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 3 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 3 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:46:04] [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 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:46:04] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:46:04] [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 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
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 44 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 42 transition count 180
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 42 transition count 180
Applied a total of 26 rules in 21 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 21 ms. Remains : 42/47 places, 180/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 180 transitions.
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:46:04] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 204 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 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 13 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 200 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 2 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 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 200 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 2 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 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [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 13 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 13 ms. Remains : 42/47 places, 180/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in SI_CTL 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
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 22 place count 44 transition count 188
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 42 transition count 180
Iterating global reduction 0 with 2 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:46:04] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 180 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:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [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 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 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 22 place count 42 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 41 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 41 transition count 180
Applied a total of 24 rules in 11 ms. Remains 41 /47 variables (removed 6) and now considering 180/216 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 41/47 places, 180/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 4 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 180 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:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [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 2 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 2 ms. Remains : 43/47 places, 200/216 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:46:04] [INFO ] Input system was already deterministic with 200 transitions.
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:46:04] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:46:04] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-19 19:46:04] [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 3673 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.787sec
RS generation: 0m14.647sec
-> reachability set: #nodes 8414 (8.4e+03) #states 284,523,132,989,069 (14)
starting MCC model checker
--------------------------
checking: EG [AG [EF [~ [A [[1<=p2 & 1<=p32] U [1<=p2 & 1<=p21]]]]]]
normalized: EG [~ [E [true U ~ [E [true U ~ [[~ [E [~ [[1<=p2 & 1<=p21]] U [~ [[1<=p2 & 1<=p32]] & ~ [[1<=p2 & 1<=p21]]]]] & ~ [EG [~ [[1<=p2 & 1<=p21]]]]]]]]]]]
abstracting: (1<=p21)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
..
EG iterations: 2
abstracting: (1<=p21)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p32)
states: 98,949,358,231,399 (13)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p21)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
EG iterations: 0
-> the formula is TRUE
FORMULA Szymanski-PT-a10-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.567sec
checking: AX [EG [[EF [[1<=p0 & 1<=p12]] & EG [AX [[p2<=0 | p31<=0]]]]]]
normalized: ~ [EX [~ [EG [[EG [~ [EX [~ [[p2<=0 | p31<=0]]]]] & E [true U [1<=p0 & 1<=p12]]]]]]]
abstracting: (1<=p12)
states: 119,852,796,887,252 (14)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (p31<=0)
states: 185,573,774,757,670 (14)
abstracting: (p2<=0)
states: 204,230,445,686,203 (14)
.....................
EG iterations: 20
......................
EG iterations: 22
.-> the formula is TRUE
FORMULA Szymanski-PT-a10-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.003sec
checking: EF [AG [[1<=p2 & [1<=p40 & [AG [[1<=p1 & 1<=p37]] | 1<=p29]]]]]
normalized: E [true U ~ [E [true U ~ [[1<=p2 & [1<=p40 & [1<=p29 | ~ [E [true U ~ [[1<=p1 & 1<=p37]]]]]]]]]]]
abstracting: (1<=p37)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p29)
states: 98,949,317,480,910 (13)
abstracting: (1<=p40)
states: 98,949,358,231,399 (13)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.947sec
checking: AG [AX [EF [[EF [[p0<=0 | p16<=0]] | [[p1<=0 | p17<=0] & [p0<=0 | p24<=0]]]]]]
normalized: ~ [E [true U EX [~ [E [true U [[[p0<=0 | p24<=0] & [p1<=0 | p17<=0]] | E [true U [p0<=0 | p16<=0]]]]]]]]
abstracting: (p16<=0)
states: 181,664,378,033,697 (14)
abstracting: (p0<=0)
states: 264,575,398,550,007 (14)
abstracting: (p17<=0)
states: 181,664,378,033,697 (14)
abstracting: (p1<=0)
states: 204,230,465,716,212 (14)
abstracting: (p24<=0)
states: 181,664,378,033,697 (14)
abstracting: (p0<=0)
states: 264,575,398,550,007 (14)
.-> the formula is TRUE
FORMULA Szymanski-PT-a10-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.098sec
checking: AG [AX [[A [[1<=p2 & 1<=p44] U [1<=p2 & 1<=p25]] & [p3<=0 | p40<=0]]]]
normalized: ~ [E [true U EX [~ [[[p3<=0 | p40<=0] & [~ [EG [~ [[1<=p2 & 1<=p25]]]] & ~ [E [~ [[1<=p2 & 1<=p25]] U [~ [[1<=p2 & 1<=p44]] & ~ [[1<=p2 & 1<=p25]]]]]]]]]]]
abstracting: (1<=p25)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p44)
states: 98,949,358,231,399 (13)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p25)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p25)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
..
EG iterations: 2
abstracting: (p40<=0)
states: 185,573,774,757,670 (14)
abstracting: (p3<=0)
states: 264,575,405,456,908 (14)
.-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.882sec
checking: AG [~ [A [[EX [[1<=p1 & 1<=p31]] & [1<=p0 & 1<=p8]] U AF [[[1<=p3 & 1<=p8] & [1<=p3 & 1<=p39]]]]]]
normalized: ~ [E [true U [~ [EG [EG [~ [[[1<=p3 & 1<=p39] & [1<=p3 & 1<=p8]]]]]] & ~ [E [EG [~ [[[1<=p3 & 1<=p39] & [1<=p3 & 1<=p8]]]] U [~ [[[1<=p0 & 1<=p8] & EX [[1<=p1 & 1<=p31]]]] & EG [~ [[[1<=p3 & 1<=p39] & [1<=p3 & 1<=p8]]]]]]]]]]
abstracting: (1<=p8)
states: 35,905,489,609,834 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p39)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
abstracting: (1<=p31)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
.abstracting: (1<=p8)
states: 35,905,489,609,834 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p8)
states: 35,905,489,609,834 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p39)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
abstracting: (1<=p8)
states: 35,905,489,609,834 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p39)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.787sec
checking: E [AG [[~ [A [[1<=p2 & 1<=p13] U [1<=p0 & 1<=p30]]] | ~ [[AF [[1<=p1 & 1<=p16]] & [1<=p3 & 1<=p42]]]]] U [1<=p3 & 1<=p9]]
normalized: E [~ [E [true U ~ [[~ [[[1<=p3 & 1<=p42] & ~ [EG [~ [[1<=p1 & 1<=p16]]]]]] | ~ [[~ [EG [~ [[1<=p0 & 1<=p30]]]] & ~ [E [~ [[1<=p0 & 1<=p30]] U [~ [[1<=p2 & 1<=p13]] & ~ [[1<=p0 & 1<=p30]]]]]]]]]]] U [1<=p3 & 1<=p9]]
abstracting: (1<=p9)
states: 54,409,301,006,723 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p30)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p13)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p30)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p30)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
..
EG iterations: 2
abstracting: (1<=p16)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
..
EG iterations: 2
abstracting: (1<=p42)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
-> the formula is TRUE
FORMULA Szymanski-PT-a10-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.811sec
checking: AG [[EF [[p3<=0 | p38<=0]] & [[[EX [[1<=p1 & 1<=p38]] & [AG [[p3<=0 | p35<=0]] & EX [[p3<=0 | p8<=0]]]] | [EF [EG [[1<=p2 & 1<=p17]]] & EF [[p3<=0 | p28<=0]]]] & [p0<=0 | p24<=0]]]]
normalized: ~ [E [true U ~ [[[[[E [true U [p3<=0 | p28<=0]] & E [true U EG [[1<=p2 & 1<=p17]]]] | [[EX [[p3<=0 | p8<=0]] & ~ [E [true U ~ [[p3<=0 | p35<=0]]]]] & EX [[1<=p1 & 1<=p38]]]] & [p0<=0 | p24<=0]] & E [true U [p3<=0 | p38<=0]]]]]]
abstracting: (p38<=0)
states: 185,573,774,757,670 (14)
abstracting: (p3<=0)
states: 264,575,405,456,908 (14)
abstracting: (p24<=0)
states: 181,664,378,033,697 (14)
abstracting: (p0<=0)
states: 264,575,398,550,007 (14)
abstracting: (1<=p38)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
.abstracting: (p35<=0)
states: 185,573,774,757,670 (14)
abstracting: (p3<=0)
states: 264,575,405,456,908 (14)
abstracting: (p8<=0)
states: 248,617,643,379,235 (14)
abstracting: (p3<=0)
states: 264,575,405,456,908 (14)
.abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
.............................
EG iterations: 29
abstracting: (p28<=0)
states: 181,664,378,033,697 (14)
abstracting: (p3<=0)
states: 264,575,405,456,908 (14)
-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 9.916sec
checking: AG [A [~ [[1<=p1 & 1<=p26]] U [~ [[[AG [[1<=p1 & 1<=p16]] | [1<=p2 & 1<=p17]] | [[1<=p0 & 1<=p20] | [1<=p3 & 1<=p17]]]] & AG [[~ [[1<=p2 & 1<=p22]] | [1<=p3 & 1<=p11]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [E [true U ~ [[[1<=p3 & 1<=p11] | ~ [[1<=p2 & 1<=p22]]]]]] & ~ [[[[1<=p3 & 1<=p17] | [1<=p0 & 1<=p20]] | [[1<=p2 & 1<=p17] | ~ [E [true U ~ [[1<=p1 & 1<=p16]]]]]]]]]]] & ~ [E [~ [[~ [E [true U ~ [[[1<=p3 & 1<=p11] | ~ [[1<=p2 & 1<=p22]]]]]] & ~ [[[[1<=p3 & 1<=p17] | [1<=p0 & 1<=p20]] | [[1<=p2 & 1<=p17] | ~ [E [true U ~ [[1<=p1 & 1<=p16]]]]]]]]] U [[1<=p1 & 1<=p26] & ~ [[~ [E [true U ~ [[[1<=p3 & 1<=p11] | ~ [[1<=p2 & 1<=p22]]]]]] & ~ [[[[1<=p3 & 1<=p17] | [1<=p0 & 1<=p20]] | [[1<=p2 & 1<=p17] | ~ [E [true U ~ [[1<=p1 & 1<=p16]]]]]]]]]]]]]]]]
abstracting: (1<=p16)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p20)
states: 102,858,754,955,372 (14)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p22)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p11)
states: 58,813,402,884,028 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p26)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p16)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p20)
states: 102,858,754,955,372 (14)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p22)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p11)
states: 58,813,402,884,028 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p16)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p20)
states: 102,858,754,955,372 (14)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p22)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p11)
states: 58,813,402,884,028 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.347sec
checking: A [[E [[1<=p2 & 1<=p20] U [1<=p1 & 1<=p11]] | [AX [[1<=p0 & 1<=p16]] | A [~ [[1<=p3 & 1<=p9]] U EX [[1<=p1 & 1<=p31]]]]] U EF [[[AF [AG [[1<=p1 & 1<=p19]]] & 1<=p2] & [1<=p26 & ~ [[1<=p2 & 1<=p17]]]]]]
normalized: [~ [EG [~ [E [true U [[1<=p26 & ~ [[1<=p2 & 1<=p17]]] & [1<=p2 & ~ [EG [E [true U ~ [[1<=p1 & 1<=p19]]]]]]]]]]] & ~ [E [~ [E [true U [[1<=p26 & ~ [[1<=p2 & 1<=p17]]] & [1<=p2 & ~ [EG [E [true U ~ [[1<=p1 & 1<=p19]]]]]]]]] U [~ [[[[~ [EG [~ [EX [[1<=p1 & 1<=p31]]]]] & ~ [E [~ [EX [[1<=p1 & 1<=p31]]] U [[1<=p3 & 1<=p9] & ~ [EX [[1<=p1 & 1<=p31]]]]]]] | ~ [EX [~ [[1<=p0 & 1<=p16]]]]] | E [[1<=p2 & 1<=p20] U [1<=p1 & 1<=p11]]]] & ~ [E [true U [[1<=p26 & ~ [[1<=p2 & 1<=p17]]] & [1<=p2 & ~ [EG [E [true U ~ [[1<=p1 & 1<=p19]]]]]]]]]]]]]
abstracting: (1<=p19)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
EG iterations: 0
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p26)
states: 102,858,754,955,372 (14)
abstracting: (1<=p11)
states: 58,813,402,884,028 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p20)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p16)
states: 102,858,754,955,372 (14)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
.abstracting: (1<=p31)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
.abstracting: (1<=p9)
states: 54,409,301,006,723 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p31)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
.abstracting: (1<=p31)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
...
EG iterations: 2
abstracting: (1<=p19)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
EG iterations: 0
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p26)
states: 102,858,754,955,372 (14)
abstracting: (1<=p19)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
EG iterations: 0
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p26)
states: 102,858,754,955,372 (14)
EG iterations: 0
-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.661sec
checking: [~ [E [[A [A [[1<=p5 & 1<=p11] U [1<=p3 & 1<=p23]] U EF [[1<=p1 & 1<=p9]]] | E [[1<=p3 & 1<=p16] U EF [[1<=p6 & 1<=p11]]]] U [1<=p1 & 1<=p21]]] | EF [AG [EX [~ [A [[1<=p3 & 1<=p36] U [1<=p1 & 1<=p8]]]]]]]
normalized: [E [true U ~ [E [true U ~ [EX [~ [[~ [E [~ [[1<=p1 & 1<=p8]] U [~ [[1<=p3 & 1<=p36]] & ~ [[1<=p1 & 1<=p8]]]]] & ~ [EG [~ [[1<=p1 & 1<=p8]]]]]]]]]]] | ~ [E [[E [[1<=p3 & 1<=p16] U E [true U [1<=p6 & 1<=p11]]] | [~ [EG [~ [E [true U [1<=p1 & 1<=p9]]]]] & ~ [E [~ [E [true U [1<=p1 & 1<=p9]]] U [~ [[~ [EG [~ [[1<=p3 & 1<=p23]]]] & ~ [E [~ [[1<=p3 & 1<=p23]] U [~ [[1<=p5 & 1<=p11]] & ~ [[1<=p3 & 1<=p23]]]]]]] & ~ [E [true U [1<=p1 & 1<=p9]]]]]]]] U [1<=p1 & 1<=p21]]]]
abstracting: (1<=p21)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p9)
states: 54,409,301,006,723 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p23)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p11)
states: 58,813,402,884,028 (13)
abstracting: (1<=p5)
states: 10,584,851,471,870 (13)
abstracting: (1<=p23)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p23)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
abstracting: (1<=p9)
states: 54,409,301,006,723 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p9)
states: 54,409,301,006,723 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
.
EG iterations: 1
abstracting: (1<=p11)
states: 58,813,402,884,028 (13)
abstracting: (1<=p6)
states: 10,584,858,378,770 (13)
abstracting: (1<=p16)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p8)
states: 35,905,489,609,834 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
..
EG iterations: 2
abstracting: (1<=p8)
states: 35,905,489,609,834 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p36)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p8)
states: 35,905,489,609,834 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
.-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.235sec
checking: EX [[EF [AX [[E [[1<=p1 & 1<=p28] U [1<=p1 & 1<=p16]] & [[1<=p1 & 1<=p34] | [1<=p1 & 1<=p31]]]]] & [[AX [~ [E [[1<=p3 & 1<=p41] U [1<=p2 & 1<=p19]]]] | [~ [E [[1<=p1 & 1<=p35] U [1<=p3 & 1<=p31]]] & [[p3<=0 | p9<=0] & [p3<=0 | p34<=0]]]] & [[1<=p0 & 1<=p38] | [[p2<=0 | p23<=0] & [AG [[1<=p3 & 1<=p14]] | [1<=p1 & 1<=p24]]]]]]]
normalized: EX [[[[[[~ [E [true U ~ [[1<=p3 & 1<=p14]]]] | [1<=p1 & 1<=p24]] & [p2<=0 | p23<=0]] | [1<=p0 & 1<=p38]] & [[[[p3<=0 | p34<=0] & [p3<=0 | p9<=0]] & ~ [E [[1<=p1 & 1<=p35] U [1<=p3 & 1<=p31]]]] | ~ [EX [E [[1<=p3 & 1<=p41] U [1<=p2 & 1<=p19]]]]]] & E [true U ~ [EX [~ [[[[1<=p1 & 1<=p31] | [1<=p1 & 1<=p34]] & E [[1<=p1 & 1<=p28] U [1<=p1 & 1<=p16]]]]]]]]]
abstracting: (1<=p16)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p28)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p34)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p31)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
.abstracting: (1<=p19)
states: 102,858,754,955,372 (14)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p41)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
.abstracting: (1<=p31)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p35)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (p9<=0)
states: 230,113,831,982,346 (14)
abstracting: (p3<=0)
states: 264,575,405,456,908 (14)
abstracting: (p34<=0)
states: 185,573,774,757,670 (14)
abstracting: (p3<=0)
states: 264,575,405,456,908 (14)
abstracting: (1<=p38)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (p23<=0)
states: 181,664,378,033,697 (14)
abstracting: (p2<=0)
states: 204,230,445,686,203 (14)
abstracting: (1<=p24)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
abstracting: (1<=p14)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
.-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m14.651sec
checking: E [~ [[[A [[1<=p3 & 1<=p25] U AF [[1<=p1 & 1<=p24]]] | [1<=p2 & 1<=p38]] & A [[[[1<=p0 & 1<=p39] | [1<=p3 & 1<=p41]] & EG [[1<=p0 & 1<=p42]]] U [A [[1<=p0 & 1<=p40] U [1<=p3 & 1<=p33]] | [[1<=p3 & 1<=p36] | [1<=p3 & 1<=p17]]]]]] U ~ [E [[EX [~ [[1<=p3 & 1<=p43]]] | [1<=p3 & 1<=p40]] U [AF [[1<=p1 & 1<=p42]] | EF [~ [[1<=p2 & 1<=p33]]]]]]]
normalized: E [~ [[[~ [EG [~ [[[[1<=p3 & 1<=p17] | [1<=p3 & 1<=p36]] | [~ [EG [~ [[1<=p3 & 1<=p33]]]] & ~ [E [~ [[1<=p3 & 1<=p33]] U [~ [[1<=p0 & 1<=p40]] & ~ [[1<=p3 & 1<=p33]]]]]]]]]] & ~ [E [~ [[[[1<=p3 & 1<=p17] | [1<=p3 & 1<=p36]] | [~ [EG [~ [[1<=p3 & 1<=p33]]]] & ~ [E [~ [[1<=p3 & 1<=p33]] U [~ [[1<=p0 & 1<=p40]] & ~ [[1<=p3 & 1<=p33]]]]]]]] U [~ [[EG [[1<=p0 & 1<=p42]] & [[1<=p3 & 1<=p41] | [1<=p0 & 1<=p39]]]] & ~ [[[[1<=p3 & 1<=p17] | [1<=p3 & 1<=p36]] | [~ [EG [~ [[1<=p3 & 1<=p33]]]] & ~ [E [~ [[1<=p3 & 1<=p33]] U [~ [[1<=p0 & 1<=p40]] & ~ [[1<=p3 & 1<=p33]]]]]]]]]]]] & [[1<=p2 & 1<=p38] | [~ [EG [EG [~ [[1<=p1 & 1<=p24]]]]] & ~ [E [EG [~ [[1<=p1 & 1<=p24]]] U [~ [[1<=p3 & 1<=p25]] & EG [~ [[1<=p1 & 1<=p24]]]]]]]]]] U ~ [E [[[1<=p3 & 1<=p40] | EX [~ [[1<=p3 & 1<=p43]]]] U [E [true U ~ [[1<=p2 & 1<=p33]]] | ~ [EG [~ [[1<=p1 & 1<=p42]]]]]]]]
abstracting: (1<=p42)
states: 98,949,358,231,399 (13)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
..
EG iterations: 2
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p43)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
.abstracting: (1<=p40)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p24)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
..
EG iterations: 2
abstracting: (1<=p25)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p24)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
..
EG iterations: 2
abstracting: (1<=p24)
states: 102,858,754,955,372 (14)
abstracting: (1<=p1)
states: 80,292,667,272,857 (13)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p38)
states: 98,949,358,231,399 (13)
abstracting: (1<=p2)
states: 80,292,687,302,866 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p40)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
abstracting: (1<=p36)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p39)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p41)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p42)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
...................
EG iterations: 19
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p40)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
abstracting: (1<=p36)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p40)
states: 98,949,358,231,399 (13)
abstracting: (1<=p0)
states: 19,947,734,439,062 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p33)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
abstracting: (1<=p36)
states: 98,949,358,231,399 (13)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
abstracting: (1<=p17)
states: 102,858,754,955,372 (14)
abstracting: (1<=p3)
states: 19,947,727,532,161 (13)
..
EG iterations: 2
-> the formula is FALSE
FORMULA Szymanski-PT-a10-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.686sec
totally nodes used: 13682740 (1.4e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 719190935 185269738 904460673
used/not used/entry size/cache size: 62254930 4853934 16 1024MB
basic ops cache: hits/miss/sum: 46999016 11081792 58080808
used/not used/entry size/cache size: 11736507 5040709 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: 447351 121582 568933
used/not used/entry size/cache size: 120775 8267833 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 55095268
1 10728066
2 1139818
3 103337
4 15275
5 5350
6 4878
7 4506
8 2462
9 1410
>= 10 8494
Total processing time: 1m32.845sec
BK_STOP 1679255270857
--------------------
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
7272 7831 14390 13680 14251 8900
iterations count:607275 (2811), effective:16435 (76)
initing FirstDep: 0m 0.000sec
iterations count:1328 (6), effective:14 (0)
iterations count:598 (2), effective:14 (0)
iterations count:33534 (155), effective:406 (1)
iterations count:3250 (15), effective:21 (0)
iterations count:757 (3), effective:13 (0)
iterations count:265 (1), effective:4 (0)
iterations count:216 (1), effective:0 (0)
iterations count:878 (4), effective:14 (0)
iterations count:651 (3), effective:19 (0)
iterations count:224 (1), effective:8 (0)
iterations count:48286 (223), effective:560 (2)
iterations count:454 (2), effective:11 (0)
iterations count:8757 (40), effective:110 (0)
iterations count:446 (2), effective:3 (0)
iterations count:46592 (215), effective:532 (2)
iterations count:5322 (24), effective:96 (0)
iterations count:446 (2), effective:3 (0)
iterations count:31263 (144), effective:355 (1)
iterations count:2145 (9), effective:13 (0)
iterations count:5346 (24), effective:93 (0)
iterations count:2145 (9), effective:13 (0)
iterations count:5346 (24), effective:93 (0)
iterations count:30202 (139), effective:428 (1)
iterations count:2145 (9), effective:13 (0)
iterations count:5346 (24), effective:93 (0)
iterations count:216 (1), effective:0 (0)
iterations count:1351 (6), effective:8 (0)
iterations count:2102 (9), effective:20 (0)
iterations count:14698 (68), effective:216 (1)
iterations count:1351 (6), effective:8 (0)
iterations count:13566 (62), effective:174 (0)
iterations count:1351 (6), effective:8 (0)
iterations count:24489 (113), effective:356 (1)
iterations count:368 (1), effective:1 (0)
iterations count:24489 (113), effective:356 (1)
iterations count:294 (1), effective:1 (0)
iterations count:24489 (113), effective:356 (1)
iterations count:4181 (19), effective:38 (0)
iterations count:216 (1), effective:0 (0)
iterations count:23944 (110), effective:362 (1)
iterations count:446 (2), effective:3 (0)
iterations count:31315 (144), effective:357 (1)
iterations count:1581 (7), effective:9 (0)
iterations count:42911 (198), effective:468 (2)
iterations count:1458 (6), effective:16 (0)
iterations count:1967 (9), effective:18 (0)
iterations count:446 (2), effective:3 (0)
iterations count:1398 (6), effective:14 (0)
iterations count:216 (1), effective:0 (0)
iterations count:446 (2), effective:3 (0)
iterations count:265 (1), effective:4 (0)
iterations count:265 (1), effective:4 (0)
iterations count:265 (1), effective:4 (0)
iterations count:265 (1), effective:4 (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-a10"
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-a10, 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-167912708600434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a10.tgz
mv Szymanski-PT-a10 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 ;