About the Execution of Marcie+red for IOTPpurchase-PT-C12M10P15D17
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 10986.371 | 3600000.00 | 3628063.00 | 24758.00 | FTFFFF?TTT?FTFFT | 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.r234-tall-167856419900129.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 IOTPpurchase-PT-C12M10P15D17, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419900129
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.1K Feb 25 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 15:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 15:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 15:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 15:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rwxr-xr-x 1 mcc users 60K 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 IOTPpurchase-PT-C12M10P15D17-CTLCardinality-00
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-01
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-02
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-03
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-04
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-05
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-06
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-07
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-08
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-09
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679451373093
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=IOTPpurchase-PT-C12M10P15D17
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:16:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:16:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:16:14] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-22 02:16:14] [INFO ] Transformed 111 places.
[2023-03-22 02:16:14] [INFO ] Transformed 45 transitions.
[2023-03-22 02:16:14] [INFO ] Parsed PT model containing 111 places and 45 transitions and 224 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Support contains 68 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 45/45 transitions.
Ensure Unique test removed 21 places
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 88 transition count 45
Applied a total of 23 rules in 12 ms. Remains 88 /111 variables (removed 23) and now considering 45/45 (removed 0) transitions.
// Phase 1: matrix 45 rows 88 cols
[2023-03-22 02:16:14] [INFO ] Computed 44 place invariants in 17 ms
[2023-03-22 02:16:15] [INFO ] Implicit Places using invariants in 382 ms returned [23, 28]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 406 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 86/111 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 86 /86 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 421 ms. Remains : 86/111 places, 45/45 transitions.
Support contains 68 out of 86 places after structural reductions.
[2023-03-22 02:16:15] [INFO ] Flatten gal took : 21 ms
[2023-03-22 02:16:15] [INFO ] Flatten gal took : 8 ms
[2023-03-22 02:16:15] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 67 out of 86 places (down from 68) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 56) seen :20
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) 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 36) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) 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 36) 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 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) 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 35) seen :0
Running SMT prover for 35 properties.
// Phase 1: matrix 45 rows 86 cols
[2023-03-22 02:16:15] [INFO ] Computed 42 place invariants in 8 ms
[2023-03-22 02:16:16] [INFO ] [Real]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 02:16:16] [INFO ] [Real]Absence check using 15 positive and 27 generalized place invariants in 4 ms returned sat
[2023-03-22 02:16:16] [INFO ] After 158ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:32
[2023-03-22 02:16:16] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-22 02:16:16] [INFO ] [Nat]Absence check using 15 positive and 27 generalized place invariants in 4 ms returned sat
[2023-03-22 02:16:16] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :22 sat :13
[2023-03-22 02:16:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 02:16:16] [INFO ] After 46ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :22 sat :13
[2023-03-22 02:16:16] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :22 sat :13
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-22 02:16:16] [INFO ] After 403ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :13
Fused 35 Parikh solutions to 13 different solutions.
Finished Parikh walk after 271 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=271 )
Parikh walk visited 13 properties in 153 ms.
Successfully simplified 22 atomic propositions for a total of 16 simplifications.
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 6 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 34 out of 86 places (down from 42) after GAL structural reductions.
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 3 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 2 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 2 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 66 transition count 45
Applied a total of 20 rules in 2 ms. Remains 66 /86 variables (removed 20) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 66 transition count 45
Applied a total of 20 rules in 2 ms. Remains 66 /86 variables (removed 20) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 66/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 2 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 2 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 3 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 65 transition count 38
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 19 rules applied. Total rules applied 32 place count 54 transition count 30
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 40 place count 46 transition count 30
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 40 place count 46 transition count 20
Deduced a syphon composed of 10 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 64 place count 32 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 32 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 31 transition count 19
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 83 place count 21 transition count 12
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 85 place count 20 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 19 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 86 place count 19 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 18 transition count 10
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 91 place count 16 transition count 9
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 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 94 place count 14 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 95 place count 14 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 97 place count 12 transition count 7
Applied a total of 97 rules in 13 ms. Remains 12 /86 variables (removed 74) and now considering 7/45 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 12/86 places, 7/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 0 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 2 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 13 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 67 transition count 45
Applied a total of 19 rules in 3 ms. Remains 67 /86 variables (removed 19) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 67/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 65 transition count 45
Applied a total of 21 rules in 2 ms. Remains 65 /86 variables (removed 21) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 65/86 places, 45/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 66 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 26 place count 57 transition count 33
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 33 place count 51 transition count 32
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 36 place count 49 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 37 place count 48 transition count 31
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 37 place count 48 transition count 23
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 57 place count 36 transition count 23
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 57 place count 36 transition count 21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 61 place count 34 transition count 21
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 76 place count 25 transition count 15
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 79 place count 23 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 80 place count 22 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 80 place count 22 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 83 place count 20 transition count 13
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 84 place count 20 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 87 place count 18 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 88 place count 17 transition count 11
Applied a total of 88 rules in 7 ms. Remains 17 /86 variables (removed 69) and now considering 11/45 (removed 34) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 17/86 places, 11/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 11 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 86/86 places, 45/45 transitions.
Ensure Unique test removed 15 places
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 65 transition count 39
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 15 rules applied. Total rules applied 27 place count 56 transition count 33
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 34 place count 50 transition count 32
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 37 place count 48 transition count 31
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 38 place count 47 transition count 31
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 38 place count 47 transition count 22
Deduced a syphon composed of 9 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 23 rules applied. Total rules applied 61 place count 33 transition count 22
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 61 place count 33 transition count 20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 65 place count 31 transition count 20
Discarding 1 places :
Implicit places reduction removed 1 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 5 with 2 rules applied. Total rules applied 67 place count 30 transition count 19
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 70 place count 28 transition count 18
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 71 place count 27 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 17 rules applied. Total rules applied 88 place count 17 transition count 11
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 90 place count 16 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 91 place count 15 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 91 place count 15 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 3 rules applied. Total rules applied 94 place count 13 transition count 9
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 10 with 1 rules applied. Total rules applied 95 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 11 with 3 rules applied. Total rules applied 98 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 99 place count 10 transition count 7
Applied a total of 99 rules in 7 ms. Remains 10 /86 variables (removed 76) and now considering 7/45 (removed 38) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 10/86 places, 7/45 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 1 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:16:16] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:16:16] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-22 02:16:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 45 transitions and 174 arcs took 1 ms.
Total runtime 2431 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 86 NrTr: 45 NrArc: 174)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.688sec
RS generation: 0m34.564sec
-> reachability set: #nodes 263029 (2.6e+05) #states 92,677,131,972,792 (13)
starting MCC model checker
--------------------------
checking: EG [AG [EF [AX [1<=0]]]]
normalized: EG [~ [E [true U ~ [E [true U ~ [EX [~ [1<=0]]]]]]]]
abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 5.550sec
checking: EG [AX [EX [0<=0]]]
normalized: EG [~ [EX [~ [EX [0<=0]]]]]
abstracting: (0<=0)
states: 92,677,131,972,792 (13)
..
EG iterations: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [0<=0]
normalized: EX [0<=0]
abstracting: (0<=0)
states: 92,677,131,972,792 (13)
.-> the formula is TRUE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]
abstracting: (0<=0)
states: 92,677,131,972,792 (13)
.-> the formula is TRUE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [AX [AF [~ [p42<=6]]]]
normalized: EG [~ [EX [EG [p42<=6]]]]
abstracting: (p42<=6)
states: 92,674,466,164,624 (13)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.825sec
checking: AG [E [AF [p21<=2] U EG [1<=p12]]]
normalized: ~ [E [true U ~ [E [~ [EG [~ [p21<=2]]] U EG [1<=p12]]]]]
abstracting: (1<=p12)
states: 90,025,036,496,120 (13)
.
EG iterations: 1
abstracting: (p21<=2)
states: 89,943,862,935,144 (13)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.921sec
checking: AF [~ [p82<=p19]]
normalized: ~ [EG [p82<=p19]]
abstracting: (p82<=p19)
states: 75,553,296,600,928 (13)
.....................................................................................................
before gc: list nodes free: 670507
after gc: idd nodes used:3454329, unused:60545671; list nodes free:332067155
.......................................
before gc: list nodes free: 7630587
after gc: idd nodes used:4356531, unused:59643469; list nodes free:327834520
..............................................................................................................................................................
EG iterations: 298
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 3m14.507sec
checking: AG [EX [[6<=p25 | AX [AG [p74<=p18]]]]]
normalized: ~ [E [true U ~ [EX [[6<=p25 | ~ [EX [E [true U ~ [p74<=p18]]]]]]]]]
abstracting: (p74<=p18)
states: 8,698,729,096,926 (12)
.abstracting: (6<=p25)
states: 2,211,765,696 (9)
.-> the formula is FALSE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.067sec
checking: AX [[~ [8<=p36] & AF [AG [[~ [p73<=9] & ~ [17<=p40]]]]]]
normalized: ~ [EX [~ [[~ [EG [E [true U ~ [[~ [17<=p40] & ~ [p73<=9]]]]]] & ~ [8<=p36]]]]]
abstracting: (8<=p36)
states: 16,232,888 (7)
abstracting: (p73<=9)
states: 92,677,131,964,956 (13)
abstracting: (17<=p40)
states: 0
EG iterations: 0
.-> the formula is FALSE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.309sec
checking: AF [[AG [[[~ [E [p67<=8 U p28<=1]] | [~ [p81<=5] & ~ [1<=p52]]] & EX [0<=0]]] & EX [EX [EX [0<=0]]]]]
normalized: ~ [EG [~ [[EX [EX [EX [0<=0]]] & ~ [E [true U ~ [[EX [0<=0] & [[~ [1<=p52] & ~ [p81<=5]] | ~ [E [p67<=8 U p28<=1]]]]]]]]]]]
abstracting: (p28<=1)
states: 88,454,530,903,792 (13)
abstracting: (p67<=8)
states: 92,677,113,293,838 (13)
abstracting: (p81<=5)
states: 92,659,368,456,312 (13)
abstracting: (1<=p52)
states: 75,553,296,600,928 (13)
abstracting: (0<=0)
states: 92,677,131,972,792 (13)
.abstracting: (0<=0)
states: 92,677,131,972,792 (13)
...
EG iterations: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.175sec
checking: A [p18<=p50 U EX [p56<=p29]]
normalized: [~ [EG [~ [EX [p56<=p29]]]] & ~ [E [~ [EX [p56<=p29]] U [~ [p18<=p50] & ~ [EX [p56<=p29]]]]]]
abstracting: (p56<=p29)
states: 37,836,444,971,580 (13)
.abstracting: (p18<=p50)
states: 81,274,632,316,112 (13)
abstracting: (p56<=p29)
states: 37,836,444,971,580 (13)
.abstracting: (p56<=p29)
states: 37,836,444,971,580 (13)
..........................
before gc: list nodes free: 13523668
after gc: idd nodes used:3257461, unused:60742539; list nodes free:333764466
................................
before gc: list nodes free: 31859723
after gc: idd nodes used:8406573, unused:55593427; list nodes free:308562986
.......
before gc: list nodes free: 33429843
after gc: idd nodes used:9569668, unused:54430332; list nodes free:302919767
...
before gc: list nodes free: 33635445
after gc: idd nodes used:10770699, unused:53229301; list nodes free:296368671
..
before gc: list nodes free: 34217147
after gc: idd nodes used:10388966, unused:53611034; list nodes free:298971583
.
before gc: list nodes free: 34201432
after gc: idd nodes used:10536203, unused:53463797; list nodes free:298305187
.
before gc: list nodes free: 34208942
after gc: idd nodes used:10688973, unused:53311027; list nodes free:297583787
.MC time: 14m 0.276sec
checking: EF [[EG [~ [p54<=p29]] & [EG [~ [p40<=p33]] & AX [~ [10<=p22]]]]]
normalized: E [true U [[~ [EX [10<=p22]] & EG [~ [p40<=p33]]] & EG [~ [p54<=p29]]]]
abstracting: (p54<=p29)
states: 33,114,613,168,304 (13)
before gc: list nodes free: 33630192
after gc: idd nodes used:2066195, unused:61933805; list nodes free:339380403
.............................................................
before gc: list nodes free: 22273853
after gc: idd nodes used:7153528, unused:56846472; list nodes free:314061615
.........
before gc: list nodes free: 26004594
after gc: idd nodes used:8319836, unused:55680164; list nodes free:308246677
....
before gc: list nodes free: 27225665
after gc: idd nodes used:8833617, unused:55166383; list nodes free:305765426
..
before gc: list nodes free: 27830647
after gc: idd nodes used:8768590, unused:55231410; list nodes free:306127648
.
before gc: list nodes free: 27880481
after gc: idd nodes used:8961804, unused:55038196; list nodes free:304757062
MC time: 10m27.328sec
checking: EF [[EF [[[p17<=p23 & p6<=5] | 16<=p5]] & p76<=p54]]
normalized: E [true U [p76<=p54 & E [true U [16<=p5 | [p17<=p23 & p6<=5]]]]]
abstracting: (p6<=5)
states: 32,496,296,519,568 (13)
abstracting: (p17<=p23)
states: 77,091,902,318,568 (13)
abstracting: (16<=p5)
states: 0
abstracting: (p76<=p54)
states: 60,922,638,547,104 (13)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 2m43.978sec
checking: AG [[A [~ [2<=p63] U [AG [p15<=p76] & [[5<=p72 | p85<=9] & 10<=p31]]] & AF [[AX [[p81<=10 & p60<=11]] | [AG [9<=p82] & p58<=p10]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[p58<=p10 & ~ [E [true U ~ [9<=p82]]]] | ~ [EX [~ [[p81<=10 & p60<=11]]]]]]]] & [~ [EG [~ [[[10<=p31 & [5<=p72 | p85<=9]] & ~ [E [true U ~ [p15<=p76]]]]]]] & ~ [E [~ [[[10<=p31 & [5<=p72 | p85<=9]] & ~ [E [true U ~ [p15<=p76]]]]] U [2<=p63 & ~ [[[10<=p31 & [5<=p72 | p85<=9]] & ~ [E [true U ~ [p15<=p76]]]]]]]]]]]]]
abstracting: (p15<=p76)
states: 83,928,734,305,848 (13)
abstracting: (p85<=9)
states: 54,160,475,172,024 (13)
abstracting: (5<=p72)
states: 12,388,147,004 (10)
abstracting: (10<=p31)
states: 31,034,888,446,424 (13)
abstracting: (2<=p63)
states: 4,222,601,069,000 (12)
abstracting: (p15<=p76)
states: 83,928,734,305,848 (13)
abstracting: (p85<=9)
states: 54,160,475,172,024 (13)
abstracting: (5<=p72)
states: 12,388,147,004 (10)
abstracting: (10<=p31)
states: 31,034,888,446,424 (13)
abstracting: (p15<=p76)
states: 83,928,734,305,848 (13)
abstracting: (p85<=9)
states: 54,160,475,172,024 (13)
abstracting: (5<=p72)
states: 12,388,147,004 (10)
abstracting: (10<=p31)
states: 31,034,888,446,424 (13)
EG iterations: 0
abstracting: (p60<=11)
states: 92,677,131,972,792 (13)
abstracting: (p81<=10)
states: 92,677,131,846,568 (13)
.abstracting: (9<=p82)
states: 819,000 (5)
abstracting: (p58<=p10)
states: 76,014,898,295,488 (13)
.
EG iterations: 1
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m15.420sec
checking: A [p18<=p50 U EX [p56<=p29]]
normalized: [~ [EG [~ [EX [p56<=p29]]]] & ~ [E [~ [EX [p56<=p29]] U [~ [p18<=p50] & ~ [EX [p56<=p29]]]]]]
abstracting: (p56<=p29)
states: 37,836,444,971,580 (13)
.abstracting: (p18<=p50)
states: 81,274,632,316,112 (13)
abstracting: (p56<=p29)
states: 37,836,444,971,580 (13)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5161208 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099980 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -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:5784 (128), effective:1208 (26)
initing FirstDep: 0m 0.000sec
iterations count:45 (1), effective:0 (0)
iterations count:208 (4), effective:31 (0)
iterations count:271 (6), effective:56 (1)
iterations count:60 (1), effective:5 (0)
iterations count:47 (1), effective:1 (0)
iterations count:186 (4), effective:17 (0)
iterations count:51 (1), effective:6 (0)
iterations count:183 (4), effective:27 (0)
net_ddint.h:600: Timeout: after 837 sec
net_ddint.h:600: Timeout: after 626 sec
iterations count:2441 (54), effective:499 (11)
iterations count:115 (2), effective:29 (0)
iterations count:191 (4), effective:43 (0)
iterations count:191 (4), effective:43 (0)
iterations count:445 (9), effective:86 (1)
iterations count:191 (4), effective:43 (0)
iterations count:49 (1), effective:2 (0)
iterations count:45 (1), effective:0 (0)
iterations count:183 (4), effective:27 (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="IOTPpurchase-PT-C12M10P15D17"
export BK_EXAMINATION="CTLCardinality"
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 IOTPpurchase-PT-C12M10P15D17, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419900129"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/IOTPpurchase-PT-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;