About the Execution of Marcie+red for ClientsAndServers-PT-N0005P1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13939.436 | 3600000.00 | 3621129.00 | 11236.00 | TT????????FF??F? | 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.r074-smll-167814400000234.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 ClientsAndServers-PT-N0005P1, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400000234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.2K Feb 26 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 13:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 5 18:22 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 ClientsAndServers-PT-N0005P1-CTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0005P1-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678338930003
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=ClientsAndServers-PT-N0005P1
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 05:15:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 05:15:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:15:33] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-09 05:15:33] [INFO ] Transformed 25 places.
[2023-03-09 05:15:33] [INFO ] Transformed 18 transitions.
[2023-03-09 05:15:33] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 21 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 05:15:33] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-09 05:15:33] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-09 05:15:33] [INFO ] Invariant cache hit.
[2023-03-09 05:15:34] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2023-03-09 05:15:34] [INFO ] Invariant cache hit.
[2023-03-09 05:15:34] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 535 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-09 05:15:34] [INFO ] Flatten gal took : 33 ms
[2023-03-09 05:15:34] [INFO ] Flatten gal took : 16 ms
[2023-03-09 05:15:34] [INFO ] Input system was already deterministic with 18 transitions.
Finished random walk after 2971 steps, including 2 resets, run visited all 39 properties in 185 ms. (steps per millisecond=16 )
[2023-03-09 05:15:34] [INFO ] Flatten gal took : 8 ms
[2023-03-09 05:15:34] [INFO ] Flatten gal took : 8 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 17 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 14 place count 16 transition count 11
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 23 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 12/25 places, 9/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 22 transition count 15
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 19 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 13 place count 17 transition count 13
Applied a total of 13 rules in 7 ms. Remains 17 /25 variables (removed 8) and now considering 13/18 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 17/25 places, 13/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 9 place count 19 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 13 place count 17 transition count 13
Applied a total of 13 rules in 7 ms. Remains 17 /25 variables (removed 8) and now considering 13/18 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 17/25 places, 13/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 13 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 23 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 22 transition count 17
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 22 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 21 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 20 transition count 15
Applied a total of 8 rules in 8 ms. Remains 20 /25 variables (removed 5) and now considering 15/18 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 20/25 places, 15/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 24 transition count 17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 23 transition count 17
Applied a total of 3 rules in 5 ms. Remains 23 /25 variables (removed 2) and now considering 17/18 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 23/25 places, 17/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 2 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 3 ms
[2023-03-09 05:15:35] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 05:15:35] [INFO ] Flatten gal took : 4 ms
[2023-03-09 05:15:35] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 12 ms.
[2023-03-09 05:15:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 1 ms.
Total runtime 2136 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: 25 NrTr: 18 NrArc: 54)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.719sec
RS generation: 1m29.300sec
-> reachability set: #nodes 545079 (5.5e+05) #states 211,714,654,767 (11)
starting MCC model checker
--------------------------
checking: AG [EF [[EG [[1<=p14 & 1<=p3]] | p24<=0]]]
normalized: ~ [E [true U ~ [E [true U [EG [[1<=p14 & 1<=p3]] | p24<=0]]]]]
abstracting: (p24<=0)
states: 25,008,670,786 (10)
abstracting: (1<=p3)
states: 96,784,775,165 (10)
abstracting: (1<=p14)
states: 211,714,654,767 (11)
................................................................................
EG iterations: 80
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0005P1-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m52.806sec
checking: A [EF [EX [AX [1<=p18]]] U ~ [AF [AX [EX [[1<=p4 & 1<=p21]]]]]]
normalized: [~ [EG [~ [EG [EX [~ [EX [[1<=p4 & 1<=p21]]]]]]]] & ~ [E [~ [EG [EX [~ [EX [[1<=p4 & 1<=p21]]]]]] U [~ [E [true U EX [~ [EX [~ [1<=p18]]]]]] & ~ [EG [EX [~ [EX [[1<=p4 & 1<=p21]]]]]]]]]]
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
...............................................................................................................................................................................MC time: 3m51.036sec
checking: AG [EF [[AF [1<=p9] | A [~ [[1<=p18 | 1<=p12]] U AX [1<=p6]]]]]
normalized: ~ [E [true U ~ [E [true U [[~ [EG [EX [~ [1<=p6]]]] & ~ [E [EX [~ [1<=p6]] U [[1<=p18 | 1<=p12] & EX [~ [1<=p6]]]]]] | ~ [EG [~ [1<=p9]]]]]]]]
abstracting: (1<=p9)
states: 96,784,631,615 (10)
.............................................................................MC time: 3m35.141sec
checking: EF [AG [[p18<=0 & [[p4<=0 | p21<=0] & [p24<=0 | p9<=0]]]]]
normalized: E [true U ~ [E [true U ~ [[p18<=0 & [[p24<=0 | p9<=0] & [p4<=0 | p21<=0]]]]]]]
abstracting: (p21<=0)
states: 42,200,730 (7)
abstracting: (p4<=0)
states: 25,008,670,786 (10)
abstracting: (p9<=0)
states: 114,930,023,152 (11)
abstracting: (p24<=0)
states: 25,008,670,786 (10)
abstracting: (p18<=0)
states: 118,205,937,787 (11)
-> the formula is TRUE
FORMULA ClientsAndServers-PT-N0005P1-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m29.237sec
checking: A [AG [E [AG [~ [[1<=p2 & 1<=p14]]] U ~ [AX [1<=p6]]]] U [1<=p4 & 1<=p21]]
normalized: [~ [EG [~ [[1<=p4 & 1<=p21]]]] & ~ [E [~ [[1<=p4 & 1<=p21]] U [E [true U ~ [E [~ [E [true U [1<=p2 & 1<=p14]]] U EX [~ [1<=p6]]]]] & ~ [[1<=p4 & 1<=p21]]]]]]
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
abstracting: (1<=p6)
states: 93,508,716,980 (10)
.abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
............
before gc: list nodes free: 2067104
after gc: idd nodes used:2171340, unused:61828660; list nodes free:509567606
................................................................................................................................MC time: 3m33.383sec
checking: E [EG [[AX [[p20<=0 | AX [[1<=p1 & 1<=p19]]]] & AF [EX [1<=p24]]]] U [1<=p1 & 1<=p19]]
normalized: E [EG [[~ [EG [~ [EX [1<=p24]]]] & ~ [EX [~ [[p20<=0 | ~ [EX [~ [[1<=p1 & 1<=p19]]]]]]]]]] U [1<=p1 & 1<=p19]]
abstracting: (1<=p19)
states: 196,622,015,897 (11)
abstracting: (1<=p1)
states: 96,784,631,615 (10)
abstracting: (1<=p19)
states: 196,622,015,897 (11)
abstracting: (1<=p1)
states: 96,784,631,615 (10)
.abstracting: (p20<=0)
states: 114,930,023,152 (11)
.abstracting: (1<=p24)
states: 186,705,983,981 (11)
..................................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 385
........................................MC time: 3m18.072sec
checking: AF [[AG [[[[1<=p5 & 1<=p15] & [1<=p18 & [1<=p10 & 1<=p20]]] | [1<=p8 & 1<=p15]]] | [1<=p7 & 1<=p23]]]
normalized: ~ [EG [~ [[[1<=p7 & 1<=p23] | ~ [E [true U ~ [[[1<=p8 & 1<=p15] | [[1<=p18 & [1<=p10 & 1<=p20]] & [1<=p5 & 1<=p15]]]]]]]]]]
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p5)
states: 180,492,554,396 (11)
abstracting: (1<=p20)
states: 96,784,631,615 (10)
abstracting: (1<=p10)
states: 93,508,716,980 (10)
abstracting: (1<=p18)
states: 93,508,716,980 (10)
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p8)
states: 186,705,983,981 (11)
abstracting: (1<=p23)
states: 211,672,459,779 (11)
abstracting: (1<=p7)
states: 180,492,554,396 (11)
.................................................
before gc: list nodes free: 619206
after gc: idd nodes used:5488929, unused:58511071; list nodes free:487085708
..............................................MC time: 3m 4.112sec
checking: AF [[AX [[E [[[1<=p4 & 1<=p21] & [1<=p7 & 1<=p23]] U ~ [[1<=p11 & 1<=p17]]] | EG [[1<=p24 | 1<=p18]]]] & 1<=p18]]
normalized: ~ [EG [~ [[1<=p18 & ~ [EX [~ [[EG [[1<=p24 | 1<=p18]] | E [[[1<=p7 & 1<=p23] & [1<=p4 & 1<=p21]] U ~ [[1<=p11 & 1<=p17]]]]]]]]]]]
abstracting: (1<=p17)
states: 196,622,185,547 (11)
abstracting: (1<=p11)
states: 93,508,716,980 (10)
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
abstracting: (1<=p23)
states: 211,672,459,779 (11)
abstracting: (1<=p7)
states: 180,492,554,396 (11)
abstracting: (1<=p18)
states: 93,508,716,980 (10)
abstracting: (1<=p24)
states: 186,705,983,981 (11)
................................................................................
EG iterations: 80
.abstracting: (1<=p18)
states: 93,508,716,980 (10)
....................................................................................
EG iterations: 84
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P1-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 1m 1.353sec
checking: EF [[[EF [AX [[1<=p8 & 1<=p15]]] & AG [[p9<=0 & EX [p9<=0]]]] | [1<=p20 & [AG [[1<=p2 & 1<=p14]] & [p3<=0 | p14<=0]]]]]
normalized: E [true U [[1<=p20 & [[p3<=0 | p14<=0] & ~ [E [true U ~ [[1<=p2 & 1<=p14]]]]]] | [~ [E [true U ~ [[p9<=0 & EX [p9<=0]]]]] & E [true U ~ [EX [~ [[1<=p8 & 1<=p15]]]]]]]]
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p8)
states: 186,705,983,981 (11)
.abstracting: (p9<=0)
states: 114,930,023,152 (11)
.abstracting: (p9<=0)
states: 114,930,023,152 (11)
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
abstracting: (p14<=0)
states: 0
abstracting: (p3<=0)
states: 114,929,879,602 (11)
abstracting: (1<=p20)
states: 96,784,631,615 (10)
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P1-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m41.804sec
checking: A [~ [[1<=p11 & 1<=p17]] U EX [[AG [[EF [1<=p6] | EX [1<=p9]]] | A [EX [[1<=p11 & 1<=p17]] U [EG [[1<=p2 & 1<=p14]] & AF [[1<=p2 & 1<=p14]]]]]]]
normalized: [~ [EG [~ [EX [[[~ [EG [~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]] U [~ [EX [[1<=p11 & 1<=p17]]] & ~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]]]]]] | ~ [E [true U ~ [[EX [1<=p9] | E [true U 1<=p6]]]]]]]]]] & ~ [E [~ [EX [[[~ [EG [~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]] U [~ [EX [[1<=p11 & 1<=p17]]] & ~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]]]]]] | ~ [E [true U ~ [[EX [1<=p9] | E [true U 1<=p6]]]]]]]] U [[1<=p11 & 1<=p17] & ~ [EX [[[~ [EG [~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]] U [~ [EX [[1<=p11 & 1<=p17]]] & ~ [[~ [EG [~ [[1<=p2 & 1<=p14]]]] & EG [[1<=p2 & 1<=p14]]]]]]]] | ~ [E [true U ~ [[EX [1<=p9] | E [true U 1<=p6]]]]]]]]]]]]
abstracting: (1<=p6)
states: 93,508,716,980 (10)
abstracting: (1<=p9)
states: 96,784,631,615 (10)
.abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
................................................................................
EG iterations: 80
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
............................................................................................................MC time: 3m10.112sec
checking: [E [[~ [E [[1<=p2 & 1<=p14] U [1<=p5 & 1<=p15]]] & [~ [[1<=p3 & 1<=p14]] & [[1<=p9 & 1<=p18] | E [[1<=p2 & 1<=p14] U [1<=p0 & 1<=p13]]]]] U A [EX [[1<=p5 & 1<=p15]] U AF [1<=p10]]] | EG [p10<=0]]
normalized: [EG [p10<=0] | E [[[[E [[1<=p2 & 1<=p14] U [1<=p0 & 1<=p13]] | [1<=p9 & 1<=p18]] & ~ [[1<=p3 & 1<=p14]]] & ~ [E [[1<=p2 & 1<=p14] U [1<=p5 & 1<=p15]]]] U [~ [EG [EG [~ [1<=p10]]]] & ~ [E [EG [~ [1<=p10]] U [~ [EX [[1<=p5 & 1<=p15]]] & EG [~ [1<=p10]]]]]]]]
abstracting: (1<=p10)
states: 93,508,716,980 (10)
...........................................................MC time: 2m55.019sec
checking: AG [[EG [EF [1<=p6]] & [E [EF [[1<=p1 & 1<=p19]] U [1<=p16 | [1<=p24 | EG [1<=p9]]]] | [AG [EF [[1<=p4 & 1<=p21]]] | [~ [E [1<=p24 U 1<=p6]] & [[p2<=0 | p14<=0] & [[p22<=0 & [p4<=0 | p21<=0]] | [p6<=0 & [p4<=0 | p21<=0]]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p6<=0 & [p4<=0 | p21<=0]] | [p22<=0 & [p4<=0 | p21<=0]]] & [p2<=0 | p14<=0]] & ~ [E [1<=p24 U 1<=p6]]] | ~ [E [true U ~ [E [true U [1<=p4 & 1<=p21]]]]]] | E [E [true U [1<=p1 & 1<=p19]] U [1<=p16 | [1<=p24 | EG [1<=p9]]]]] & EG [E [true U 1<=p6]]]]]]
abstracting: (1<=p6)
states: 93,508,716,980 (10)
.
EG iterations: 1
abstracting: (1<=p9)
states: 96,784,631,615 (10)
................................................................................
EG iterations: 80
abstracting: (1<=p24)
states: 186,705,983,981 (11)
abstracting: (1<=p16)
states: 96,784,775,165 (10)
abstracting: (1<=p19)
states: 196,622,015,897 (11)
abstracting: (1<=p1)
states: 96,784,631,615 (10)
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
abstracting: (1<=p6)
states: 93,508,716,980 (10)
abstracting: (1<=p24)
states: 186,705,983,981 (11)
abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 118,205,937,787 (11)
abstracting: (p21<=0)
states: 42,200,730 (7)
abstracting: (p4<=0)
states: 25,008,670,786 (10)
abstracting: (p22<=0)
states: 31,222,100,371 (10)
abstracting: (p21<=0)
states: 42,200,730 (7)
abstracting: (p4<=0)
states: 25,008,670,786 (10)
abstracting: (p6<=0)
states: 118,205,937,787 (11)
-> the formula is FALSE
FORMULA ClientsAndServers-PT-N0005P1-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m50.333sec
checking: EF [~ [E [[[1<=p4 & [1<=p21 & 1<=p6]] & [[E [[1<=p2 & 1<=p14] U [1<=p5 & 1<=p15]] & 1<=p20] & [AF [1<=p10] & [A [[1<=p7 & 1<=p23] U 1<=p12] | AF [[1<=p2 & 1<=p14]]]]]] U A [[[AF [[1<=p7 & 1<=p23]] & 1<=p1] & [1<=p19 & 1<=p16]] U E [1<=p24 U [1<=p4 & 1<=p21]]]]]]
normalized: E [true U ~ [E [[[[[~ [EG [~ [[1<=p2 & 1<=p14]]]] | [~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p7 & 1<=p23]] & ~ [1<=p12]]]]]] & ~ [EG [~ [1<=p10]]]] & [1<=p20 & E [[1<=p2 & 1<=p14] U [1<=p5 & 1<=p15]]]] & [1<=p4 & [1<=p21 & 1<=p6]]] U [~ [EG [~ [E [1<=p24 U [1<=p4 & 1<=p21]]]]] & ~ [E [~ [E [1<=p24 U [1<=p4 & 1<=p21]]] U [~ [[[1<=p19 & 1<=p16] & [1<=p1 & ~ [EG [~ [[1<=p7 & 1<=p23]]]]]]] & ~ [E [1<=p24 U [1<=p4 & 1<=p21]]]]]]]]]]
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
abstracting: (1<=p24)
states: 186,705,983,981 (11)
abstracting: (1<=p23)
states: 211,672,459,779 (11)
abstracting: (1<=p7)
states: 180,492,554,396 (11)
........................................................................................................
before gc: list nodes free: 5791664
after gc: idd nodes used:7389551, unused:56610449; list nodes free:474622663
MC time: 2m58.277sec
checking: EX [[[1<=p1 & 1<=p19] | [A [[1<=p5 & [1<=p15 & AX [1<=p18]]] U [[[1<=p22 | 1<=p20] & [[1<=p2 & 1<=p14] | 1<=p12]] | [EF [[1<=p5 & 1<=p15]] | 1<=p24]]] & [AF [[1<=p4 & 1<=p21]] | [AG [[1<=p2 & [1<=p14 & 1<=p12]]] | [[p4<=0 | p21<=0] & [[p5<=0 | p15<=0] & [1<=p10 | 1<=p18]]]]]]]]
normalized: EX [[[[[[[[1<=p10 | 1<=p18] & [p5<=0 | p15<=0]] & [p4<=0 | p21<=0]] | ~ [E [true U ~ [[1<=p2 & [1<=p14 & 1<=p12]]]]]] | ~ [EG [~ [[1<=p4 & 1<=p21]]]]] & [~ [EG [~ [[[1<=p24 | E [true U [1<=p5 & 1<=p15]]] | [[1<=p12 | [1<=p2 & 1<=p14]] & [1<=p22 | 1<=p20]]]]]] & ~ [E [~ [[[1<=p24 | E [true U [1<=p5 & 1<=p15]]] | [[1<=p12 | [1<=p2 & 1<=p14]] & [1<=p22 | 1<=p20]]]] U [~ [[1<=p5 & [1<=p15 & ~ [EX [~ [1<=p18]]]]]] & ~ [[[1<=p24 | E [true U [1<=p5 & 1<=p15]]] | [[1<=p12 | [1<=p2 & 1<=p14]] & [1<=p22 | 1<=p20]]]]]]]]] | [1<=p1 & 1<=p19]]]
abstracting: (1<=p19)
states: 196,622,015,897 (11)
abstracting: (1<=p1)
states: 96,784,631,615 (10)
abstracting: (1<=p20)
states: 96,784,631,615 (10)
abstracting: (1<=p22)
states: 180,492,554,396 (11)
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
abstracting: (1<=p12)
states: 93,508,716,980 (10)
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p5)
states: 180,492,554,396 (11)
abstracting: (1<=p24)
states: 186,705,983,981 (11)
abstracting: (1<=p18)
states: 93,508,716,980 (10)
.abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p5)
states: 180,492,554,396 (11)
abstracting: (1<=p20)
states: 96,784,631,615 (10)
abstracting: (1<=p22)
states: 180,492,554,396 (11)
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
abstracting: (1<=p12)
states: 93,508,716,980 (10)
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p5)
states: 180,492,554,396 (11)
abstracting: (1<=p24)
states: 186,705,983,981 (11)
abstracting: (1<=p20)
states: 96,784,631,615 (10)
abstracting: (1<=p22)
states: 180,492,554,396 (11)
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
abstracting: (1<=p12)
states: 93,508,716,980 (10)
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p5)
states: 180,492,554,396 (11)
abstracting: (1<=p24)
states: 186,705,983,981 (11)
..............................................................................
EG iterations: 78
abstracting: (1<=p21)
states: 211,672,454,037 (11)
abstracting: (1<=p4)
states: 186,705,983,981 (11)
..............................................................................MC time: 2m34.267sec
checking: EX [[AX [AF [[1<=p2 & 1<=p14]]] & [[[A [[1<=p11 & 1<=p17] U 1<=p20] & AX [[[p1<=0 | p19<=0] & [1<=p16 & 1<=p6]]]] | [p9<=0 & [[~ [E [1<=p12 U 1<=p6]] | EX [p18<=0]] | [p10<=0 | p18<=0]]]] & [[EF [[1<=p2 & [1<=p14 & 1<=p16]]] | AG [[1<=p10 | [[1<=p8 & 1<=p15] | [1<=p22 & 1<=p12]]]]] | [[1<=p2 & 1<=p14] | [1<=p5 & 1<=p15]]]]]]
normalized: EX [[[[[[1<=p5 & 1<=p15] | [1<=p2 & 1<=p14]] | [~ [E [true U ~ [[1<=p10 | [[1<=p22 & 1<=p12] | [1<=p8 & 1<=p15]]]]]] | E [true U [1<=p2 & [1<=p14 & 1<=p16]]]]] & [[p9<=0 & [[p10<=0 | p18<=0] | [EX [p18<=0] | ~ [E [1<=p12 U 1<=p6]]]]] | [~ [EX [~ [[[1<=p16 & 1<=p6] & [p1<=0 | p19<=0]]]]] & [~ [EG [~ [1<=p20]]] & ~ [E [~ [1<=p20] U [~ [[1<=p11 & 1<=p17]] & ~ [1<=p20]]]]]]]] & ~ [EX [EG [~ [[1<=p2 & 1<=p14]]]]]]]
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
......................................................................................MC time: 2m20.949sec
checking: A [[~ [[1<=p22 & [[E [[1<=p2 & 1<=p14] U [1<=p2 & 1<=p14]] | [~ [[1<=p1 & 1<=p19]] | EF [[1<=p8 & 1<=p15]]]] & ~ [AG [[1<=p0 & 1<=p13]]]]]] | [EG [~ [[EG [1<=p22] | AX [1<=p6]]]] & [1<=p6 | [[1<=p11 & 1<=p17] | [[~ [[1<=p4 & 1<=p21]] & 1<=p16] & [1<=p10 & ~ [[1<=p8 & 1<=p15]]]]]]]] U AF [[[1<=p6 | [1<=p0 & 1<=p13]] & [~ [[1<=p5 & 1<=p15]] | ~ [[1<=p8 & 1<=p15]]]]]]
normalized: [~ [EG [EG [~ [[[~ [[1<=p8 & 1<=p15]] | ~ [[1<=p5 & 1<=p15]]] & [1<=p6 | [1<=p0 & 1<=p13]]]]]]] & ~ [E [EG [~ [[[~ [[1<=p8 & 1<=p15]] | ~ [[1<=p5 & 1<=p15]]] & [1<=p6 | [1<=p0 & 1<=p13]]]]] U [~ [[[[1<=p6 | [[[1<=p10 & ~ [[1<=p8 & 1<=p15]]] & [1<=p16 & ~ [[1<=p4 & 1<=p21]]]] | [1<=p11 & 1<=p17]]] & EG [~ [[~ [EX [~ [1<=p6]]] | EG [1<=p22]]]]] | ~ [[1<=p22 & [E [true U ~ [[1<=p0 & 1<=p13]]] & [[E [true U [1<=p8 & 1<=p15]] | ~ [[1<=p1 & 1<=p19]]] | E [[1<=p2 & 1<=p14] U [1<=p2 & 1<=p14]]]]]]]] & EG [~ [[[~ [[1<=p8 & 1<=p15]] | ~ [[1<=p5 & 1<=p15]]] & [1<=p6 | [1<=p0 & 1<=p13]]]]]]]]]
abstracting: (1<=p13)
states: 96,784,775,165 (10)
abstracting: (1<=p0)
states: 203,868,470,652 (11)
abstracting: (1<=p6)
states: 93,508,716,980 (10)
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p5)
states: 180,492,554,396 (11)
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p8)
states: 186,705,983,981 (11)
........................................................................................................................................................
EG iterations: 152
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
abstracting: (1<=p14)
states: 211,714,654,767 (11)
abstracting: (1<=p2)
states: 93,508,716,980 (10)
abstracting: (1<=p19)
states: 196,622,015,897 (11)
abstracting: (1<=p1)
states: 96,784,631,615 (10)
abstracting: (1<=p15)
states: 109,278,992,043 (11)
abstracting: (1<=p8)
states: 186,705,983,981 (11)
abstracting: (1<=p13)
states: 96,784,775,165 (10)
abstracting: (1<=p0)
states: 203,868,470,652 (11)
abstracting: (1<=p22)
states: 180,492,554,396 (11)
abstracting: (1<=p22)
states: 180,492,554,396 (11)
MC time: 2m 7.119sec
checking: A [EF [EX [AX [1<=p18]]] U ~ [AF [AX [EX [[1<=p4 & 1<=p21]]]]]]
normalized: [~ [EG [~ [EG [EX [~ [EX [[1<=p4 & 1<=p21]]]]]]]] & ~ [E [~ [EG [EX [~ [EX [[1<=p4 & 1<=p21]]]]]] U [~ [EG [EX [~ [EX [[1<=p4 & 1<=p21]]]]]] & ~ [E [true U EX [~ [EX [~ [1<=p18]]]]]]]]]]
abstracting: (1<=p18)
states: 93,508,716,980 (10)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 2209948 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16097012 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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
iterations count:4822 (267), effective:1040 (57)
initing FirstDep: 0m 0.000sec
iterations count:338 (18), effective:40 (2)
net_ddint.h:600: Timeout: after 230 sec
net_ddint.h:600: Timeout: after 214 sec
iterations count:94 (5), effective:16 (0)
iterations count:1941 (107), effective:409 (22)
iterations count:98 (5), effective:19 (1)
iterations count:18 (1), effective:0 (0)
iterations count:398 (22), effective:128 (7)
iterations count:18 (1), effective:0 (0)
net_ddint.h:600: Timeout: after 212 sec
ctl_mc.icc:221: Timeout: after 197 sec
iterations count:158 (8), effective:40 (2)
net_ddint.h:600: Timeout: after 183 sec
iterations count:78 (4), effective:10 (0)
iterations count:456 (25), effective:165 (9)
iterations count:2241 (124), effective:523 (29)
iterations count:108 (6), effective:10 (0)
iterations count:101 (5), effective:19 (1)
iterations count:1937 (107), effective:407 (22)
net_ddint.h:600: Timeout: after 189 sec
net_ddint.h:600: Timeout: after 174 sec
iterations count:101 (5), effective:19 (1)
iterations count:103 (5), effective:18 (1)
iterations count:84 (4), effective:13 (0)
iterations count:99 (5), effective:17 (0)
iterations count:1941 (107), effective:409 (22)
iterations count:101 (5), effective:19 (1)
iterations count:1937 (107), effective:407 (22)
iterations count:99 (5), effective:17 (0)
ctl_mc.icc:221: Timeout: after 169 sec
iterations count:104 (5), effective:19 (1)
iterations count:104 (5), effective:19 (1)
iterations count:18 (1), effective:0 (0)
iterations count:104 (5), effective:19 (1)
net_ddint.h:600: Timeout: after 153 sec
net_ddint.h:600: Timeout: after 139 sec
iterations count:18 (1), effective:0 (0)
iterations count:87 (4), effective:14 (0)
iterations count:48 (2), effective:10 (0)
net_ddint.h:600: Timeout: after 126 sec
iterations count:975 (54), effective:232 (12)
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="ClientsAndServers-PT-N0005P1"
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 ClientsAndServers-PT-N0005P1, 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 r074-smll-167814400000234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0005P1.tgz
mv ClientsAndServers-PT-N0005P1 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 ;