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.r266-smll-167863540900425.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 Parking-PT-416, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 26 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 14:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 26 14:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 26 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 107K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-416-CTLCardinality-00
FORMULA_NAME Parking-PT-416-CTLCardinality-01
FORMULA_NAME Parking-PT-416-CTLCardinality-02
FORMULA_NAME Parking-PT-416-CTLCardinality-03
FORMULA_NAME Parking-PT-416-CTLCardinality-04
FORMULA_NAME Parking-PT-416-CTLCardinality-05
FORMULA_NAME Parking-PT-416-CTLCardinality-06
FORMULA_NAME Parking-PT-416-CTLCardinality-07
FORMULA_NAME Parking-PT-416-CTLCardinality-08
FORMULA_NAME Parking-PT-416-CTLCardinality-09
FORMULA_NAME Parking-PT-416-CTLCardinality-10
FORMULA_NAME Parking-PT-416-CTLCardinality-11
FORMULA_NAME Parking-PT-416-CTLCardinality-12
FORMULA_NAME Parking-PT-416-CTLCardinality-13
FORMULA_NAME Parking-PT-416-CTLCardinality-14
FORMULA_NAME Parking-PT-416-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679042710856

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=Parking-PT-416
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:45:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 08:45:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:45:14] [INFO ] Load time of PNML (sax parser for PT used): 147 ms
[2023-03-17 08:45:14] [INFO ] Transformed 305 places.
[2023-03-17 08:45:14] [INFO ] Transformed 433 transitions.
[2023-03-17 08:45:14] [INFO ] Found NUPN structural information;
[2023-03-17 08:45:14] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 24 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
FORMULA Parking-PT-416-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-416-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 302 transition count 254
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 302 transition count 254
Applied a total of 6 rules in 100 ms. Remains 302 /305 variables (removed 3) and now considering 254/257 (removed 3) transitions.
// Phase 1: matrix 254 rows 302 cols
[2023-03-17 08:45:14] [INFO ] Computed 76 place invariants in 24 ms
[2023-03-17 08:45:15] [INFO ] Implicit Places using invariants in 797 ms returned [48, 64, 72, 88, 90, 118, 126, 134, 158, 187, 195, 203, 211, 227, 229, 256, 264, 272, 296, 298]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 861 ms to find 20 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 282/305 places, 254/257 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 272 transition count 244
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 272 transition count 244
Applied a total of 20 rules in 25 ms. Remains 272 /282 variables (removed 10) and now considering 244/254 (removed 10) transitions.
// Phase 1: matrix 244 rows 272 cols
[2023-03-17 08:45:15] [INFO ] Computed 56 place invariants in 6 ms
[2023-03-17 08:45:16] [INFO ] Implicit Places using invariants in 316 ms returned []
[2023-03-17 08:45:16] [INFO ] Invariant cache hit.
[2023-03-17 08:45:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-17 08:45:16] [INFO ] Implicit Places using invariants and state equation in 599 ms returned []
Implicit Place search using SMT with State Equation took 919 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 272/305 places, 244/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1906 ms. Remains : 272/305 places, 244/257 transitions.
Support contains 75 out of 272 places after structural reductions.
[2023-03-17 08:45:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 08:45:17] [INFO ] Flatten gal took : 109 ms
FORMULA Parking-PT-416-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 08:45:17] [INFO ] Flatten gal took : 49 ms
[2023-03-17 08:45:17] [INFO ] Input system was already deterministic with 244 transitions.
Support contains 59 out of 272 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 1012 ms. (steps per millisecond=9 ) properties (out of 35) seen :29
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 08:45:18] [INFO ] Invariant cache hit.
[2023-03-17 08:45:18] [INFO ] [Real]Absence check using 56 positive place invariants in 26 ms returned sat
[2023-03-17 08:45:18] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-17 08:45:19] [INFO ] [Nat]Absence check using 56 positive place invariants in 34 ms returned sat
[2023-03-17 08:45:19] [INFO ] After 322ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-17 08:45:19] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-17 08:45:19] [INFO ] After 135ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-17 08:45:19] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-17 08:45:20] [INFO ] After 1142ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 59 ms.
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 244/244 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 0 with 8 rules applied. Total rules applied 8 place count 272 transition count 236
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 264 transition count 236
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 264 transition count 228
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 256 transition count 228
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 252 transition count 224
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 252 transition count 224
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 72 place count 236 transition count 208
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 235 transition count 227
Free-agglomeration rule applied 55 times.
Iterating global reduction 2 with 55 rules applied. Total rules applied 129 place count 235 transition count 172
Reduce places removed 55 places and 0 transitions.
Graph (complete) has 395 edges and 180 vertex of which 134 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.2 ms
Discarding 46 places :
Also discarding 35 output transitions
Drop transitions removed 35 transitions
Iterating post reduction 2 with 56 rules applied. Total rules applied 185 place count 134 transition count 137
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 191 place count 134 transition count 131
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 134 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 195 place count 132 transition count 129
Applied a total of 195 rules in 152 ms. Remains 132 /272 variables (removed 140) and now considering 129/244 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 132/272 places, 129/244 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :1
Finished Best-First random walk after 532 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=266 )
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 32 ms
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 34 ms
[2023-03-17 08:45:20] [INFO ] Input system was already deterministic with 244 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 23 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 31 ms
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 35 ms
[2023-03-17 08:45:20] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 26 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 31 ms
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 38 ms
[2023-03-17 08:45:20] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 269 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 269 transition count 241
Applied a total of 6 rules in 22 ms. Remains 269 /272 variables (removed 3) and now considering 241/244 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 269/272 places, 241/244 transitions.
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 26 ms
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 29 ms
[2023-03-17 08:45:20] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 15 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 17 ms
[2023-03-17 08:45:20] [INFO ] Flatten gal took : 18 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 14 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 15 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 23 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 11 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 17 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 10 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 10 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 269 transition count 241
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 269 transition count 241
Applied a total of 6 rules in 21 ms. Remains 269 /272 variables (removed 3) and now considering 241/244 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 269/272 places, 241/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Reduce places removed 1 places and 1 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 0 with 8 rules applied. Total rules applied 8 place count 271 transition count 235
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 263 transition count 235
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 16 place count 263 transition count 227
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 32 place count 255 transition count 227
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 251 transition count 223
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 251 transition count 223
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 242 transition count 214
Applied a total of 58 rules in 43 ms. Remains 242 /272 variables (removed 30) and now considering 214/244 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 242/272 places, 214/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Reduce places removed 1 places and 1 transitions.
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 7 rules applied. Total rules applied 7 place count 271 transition count 236
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 264 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 263 transition count 235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 16 place count 263 transition count 228
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 30 place count 256 transition count 228
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 32 place count 254 transition count 226
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 254 transition count 226
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 52 place count 245 transition count 217
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 245 transition count 217
Applied a total of 53 rules in 59 ms. Remains 245 /272 variables (removed 27) and now considering 217/244 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 245/272 places, 217/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 217 transitions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 244/244 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 268 transition count 240
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 268 transition count 240
Applied a total of 8 rules in 14 ms. Remains 268 /272 variables (removed 4) and now considering 240/244 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 268/272 places, 240/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 20 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 272/272 places, 244/244 transitions.
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 7 rules applied. Total rules applied 7 place count 272 transition count 237
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 265 transition count 237
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 265 transition count 230
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 258 transition count 230
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 31 place count 255 transition count 227
Iterating global reduction 2 with 3 rules applied. Total rules applied 34 place count 255 transition count 227
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 50 place count 247 transition count 219
Applied a total of 50 rules in 38 ms. Remains 247 /272 variables (removed 25) and now considering 219/244 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 247/272 places, 219/244 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:21] [INFO ] Input system was already deterministic with 219 transitions.
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:45:21] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:45:21] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-17 08:45:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 272 places, 244 transitions and 812 arcs took 2 ms.
Total runtime 7447 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: 272 NrTr: 244 NrArc: 812)

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

net check time: 0m 0.000sec

init dd package: 0m 3.793sec


RS generation: 0m 0.507sec


-> reachability set: #nodes 4008 (4.0e+03) #states 3,895,742,030,264,859,099,137 (21)



starting MCC model checker
--------------------------

checking: AF [EG [AX [1<=0]]]
normalized: ~ [EG [~ [EG [~ [EX [~ [1<=0]]]]]]]

abstracting: (1<=0)
states: 0
..
EG iterations: 1
............
before gc: list nodes free: 507521

after gc: idd nodes used:2046350, unused:61953650; list nodes free:290151568
.
before gc: list nodes free: 31645

after gc: idd nodes used:2939093, unused:61060907; list nodes free:285512760
.
before gc: list nodes free: 1060824

after gc: idd nodes used:4071258, unused:59928742; list nodes free:282841849
MC time: 4m38.115sec

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA Parking-PT-416-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.213sec

checking: AG [AF [EX [0<=0]]]
normalized: ~ [E [true U EG [~ [EX [0<=0]]]]]

abstracting: (0<=0)
states: 3,895,742,030,264,859,099,137 (21)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Parking-PT-416-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.333sec

checking: EG [EX [[[p24<=0 & 0<=p24] | [p158<=1 & 1<=p158]]]]
normalized: EG [EX [[[p24<=0 & 0<=p24] | [p158<=1 & 1<=p158]]]]

abstracting: (1<=p158)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p158<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p24)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p24<=0)
states: 1,947,871,015,132,429,549,569 (21)
.............
before gc: list nodes free: 3010480

after gc: idd nodes used:2242264, unused:61757736; list nodes free:291521334
.
before gc: list nodes free: 1851763

after gc: idd nodes used:3077787, unused:60922213; list nodes free:287569674

before gc: list nodes free: 1447643

after gc: idd nodes used:2880549, unused:61119451; list nodes free:288141125
.MC time: 5m 3.163sec

checking: EX [EX [EG [[[p158<=0 & 0<=p158] | [p246<=0 & 0<=p246]]]]]
normalized: EX [EX [EG [[[p246<=0 & 0<=p246] | [p158<=0 & 0<=p158]]]]]

abstracting: (0<=p158)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p158<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (0<=p246)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p246<=0)
states: 3,796,697,741,359,820,308,481 (21)
.
EG iterations: 1
..-> the formula is TRUE

FORMULA Parking-PT-416-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.456sec

checking: EG [[[p68<=0 & 0<=p68] | [p208<=1 & 1<=p208]]]
normalized: EG [[[p208<=1 & 1<=p208] | [p68<=0 & 0<=p68]]]

abstracting: (0<=p68)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p68<=0)
states: 3,786,002,818,144,722,223,105 (21)
abstracting: (1<=p208)
states: 1,391,336,439,380,306,821,120 (21)
abstracting: (p208<=1)
states: 3,895,742,030,264,859,099,137 (21)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-416-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.198sec

checking: AG [EF [[[[[1<=p253 & p253<=1] & [p5<=0 & 0<=p5]] & [p124<=0 & 0<=p124]] & [AX [[p212<=0 & 0<=p212]] & AX [EF [[p129<=0 & 0<=p129]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[~ [EX [~ [E [true U [p129<=0 & 0<=p129]]]]] & ~ [EX [~ [[p212<=0 & 0<=p212]]]]] & [[p124<=0 & 0<=p124] & [[p5<=0 & 0<=p5] & [1<=p253 & p253<=1]]]]]]]]

abstracting: (p253<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (1<=p253)
states: 3,301,476,296,834,626,355,200 (21)
abstracting: (0<=p5)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p5<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (0<=p124)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p124<=0)
states: 3,796,697,741,359,820,308,481 (21)
abstracting: (0<=p212)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p212<=0)
states: 1,947,871,015,132,429,549,569 (21)
.abstracting: (0<=p129)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p129<=0)
states: 3,796,697,741,359,820,308,481 (21)
.-> the formula is FALSE

FORMULA Parking-PT-416-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.429sec

checking: A [EF [[[p30<=0 & 0<=p30] | [p185<=1 & 1<=p185]]] U [~ [[[p5<=0 & 0<=p5] | [p15<=1 & 1<=p15]]] & [~ [AX [AX [[p56<=1 & 1<=p56]]]] | EF [~ [[p217<=0 & 0<=p217]]]]]]
normalized: [~ [EG [~ [[[E [true U ~ [[p217<=0 & 0<=p217]]] | EX [EX [~ [[p56<=1 & 1<=p56]]]]] & ~ [[[p15<=1 & 1<=p15] | [p5<=0 & 0<=p5]]]]]]] & ~ [E [~ [[[E [true U ~ [[p217<=0 & 0<=p217]]] | EX [EX [~ [[p56<=1 & 1<=p56]]]]] & ~ [[[p15<=1 & 1<=p15] | [p5<=0 & 0<=p5]]]]] U [~ [E [true U [[p185<=1 & 1<=p185] | [p30<=0 & 0<=p30]]]] & ~ [[[E [true U ~ [[p217<=0 & 0<=p217]]] | EX [EX [~ [[p56<=1 & 1<=p56]]]]] & ~ [[[p15<=1 & 1<=p15] | [p5<=0 & 0<=p5]]]]]]]]]

abstracting: (0<=p5)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p5<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (1<=p15)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p15<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (1<=p56)
states: 82,304,409,090,102,657,024 (19)
abstracting: (p56<=1)
states: 3,895,742,030,264,859,099,137 (21)
..abstracting: (0<=p217)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p217<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (0<=p30)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p30<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (1<=p185)
states: 104,350,232,953,523,011,584 (20)
abstracting: (p185<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p5)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p5<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (1<=p15)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p15<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (1<=p56)
states: 82,304,409,090,102,657,024 (19)
abstracting: (p56<=1)
states: 3,895,742,030,264,859,099,137 (21)
..abstracting: (0<=p217)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p217<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (0<=p5)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p5<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (1<=p15)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p15<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (1<=p56)
states: 82,304,409,090,102,657,024 (19)
abstracting: (p56<=1)
states: 3,895,742,030,264,859,099,137 (21)
..abstracting: (0<=p217)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p217<=0)
states: 1,947,871,015,132,429,549,569 (21)
.............
before gc: list nodes free: 964986

after gc: idd nodes used:1440981, unused:62559019; list nodes free:297349952
..
before gc: list nodes free: 1322425

after gc: idd nodes used:1972447, unused:62027553; list nodes free:294731304
.
before gc: list nodes free: 921503

after gc: idd nodes used:2327172, unused:61672828; list nodes free:293166927
MC time: 6m17.400sec

checking: AX [[EF [AG [E [[[p71<=0 & 0<=p71] | [p258<=1 & 1<=p258]] U [p150<=1 & 1<=p150]]]] & EG [[[p171<=1 & 1<=p171] | [[p94<=1 & 1<=p94] | [p235<=0 & 0<=p235]]]]]]
normalized: ~ [EX [~ [[EG [[[[p94<=1 & 1<=p94] | [p235<=0 & 0<=p235]] | [p171<=1 & 1<=p171]]] & E [true U ~ [E [true U ~ [E [[[p258<=1 & 1<=p258] | [p71<=0 & 0<=p71]] U [p150<=1 & 1<=p150]]]]]]]]]]

abstracting: (1<=p150)
states: 1,386,620,044,670,543,069,184 (21)
abstracting: (p150<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p71)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p71<=0)
states: 3,786,002,818,144,722,223,105 (21)
abstracting: (1<=p258)
states: 99,044,288,905,038,790,656 (19)
abstracting: (p258<=1)
states: 3,895,742,030,264,859,099,137 (21)

before gc: list nodes free: 3369455

after gc: idd nodes used:1841316, unused:62158684; list nodes free:295399396
abstracting: (1<=p171)
states: 69,566,821,969,015,341,056 (19)
abstracting: (p171<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p235)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p235<=0)
states: 3,796,697,741,359,820,308,481 (21)
abstracting: (1<=p94)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p94<=1)
states: 3,895,742,030,264,859,099,137 (21)
..................MC time: 5m30.077sec

checking: AF [~ [A [[[[p87<=0 & 0<=p87] & [p62<=1 & 1<=p62]] | EF [[p173<=1 & 1<=p173]]] U A [[p188<=1 & 1<=p188] U [[p77<=0 & 0<=p77] | [p31<=1 & 1<=p31]]]]]]
normalized: ~ [EG [[~ [EG [~ [[~ [EG [~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]] U [~ [[p188<=1 & 1<=p188]] & ~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]] U [~ [[p188<=1 & 1<=p188]] & ~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]]]]]]] U [~ [[E [true U [p173<=1 & 1<=p173]] | [[p62<=1 & 1<=p62] & [p87<=0 & 0<=p87]]]] & ~ [[~ [EG [~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]]]] & ~ [E [~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]] U [~ [[p188<=1 & 1<=p188]] & ~ [[[p31<=1 & 1<=p31] | [p77<=0 & 0<=p77]]]]]]]]]]]]]]

abstracting: (0<=p77)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p77<=0)
states: 3,786,002,818,144,722,223,105 (21)
abstracting: (1<=p31)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p31<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (1<=p188)
states: 69,566,821,969,015,341,056 (19)
abstracting: (p188<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p77)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p77<=0)
states: 3,786,002,818,144,722,223,105 (21)
abstracting: (1<=p31)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p31<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p77)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p77<=0)
states: 3,786,002,818,144,722,223,105 (21)
abstracting: (1<=p31)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p31<=1)
states: 3,895,742,030,264,859,099,137 (21)
...............
before gc: list nodes free: 5253703

after gc: idd nodes used:1419979, unused:62580021; list nodes free:297485998
.....
before gc: list nodes free: 5776578

after gc: idd nodes used:2768144, unused:61231856; list nodes free:291431703
MC time: 4m58.090sec

checking: AX [A [[~ [[~ [[[p100<=0 & 0<=p100] | [p130<=1 & 1<=p130]]] | ~ [[[p233<=0 & 0<=p233] | [p235<=1 & 1<=p235]]]]] | [A [[p16<=1 & 1<=p16] U [[p190<=0 & 0<=p190] | [p253<=1 & 1<=p253]]] | AF [[p249<=1 & 1<=p249]]]] U [p13<=1 & 1<=p13]]]
normalized: ~ [EX [~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [~ [[[~ [EG [~ [[p249<=1 & 1<=p249]]]] | [~ [EG [~ [[[p253<=1 & 1<=p253] | [p190<=0 & 0<=p190]]]]] & ~ [E [~ [[[p253<=1 & 1<=p253] | [p190<=0 & 0<=p190]]] U [~ [[p16<=1 & 1<=p16]] & ~ [[[p253<=1 & 1<=p253] | [p190<=0 & 0<=p190]]]]]]]] | ~ [[~ [[[p235<=1 & 1<=p235] | [p233<=0 & 0<=p233]]] | ~ [[[p130<=1 & 1<=p130] | [p100<=0 & 0<=p100]]]]]]] & ~ [[p13<=1 & 1<=p13]]]]]]]]]

abstracting: (1<=p13)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p13<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p100)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p100<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (1<=p130)
states: 99,044,288,905,038,790,656 (19)
abstracting: (p130<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p233)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p233<=0)
states: 3,796,697,741,359,820,308,481 (21)
abstracting: (1<=p235)
states: 99,044,288,905,038,790,656 (19)
abstracting: (p235<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p190)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p190<=0)
states: 3,791,391,797,311,336,087,553 (21)
abstracting: (1<=p253)
states: 3,301,476,296,834,626,355,200 (21)
abstracting: (p253<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (1<=p16)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p16<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p190)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p190<=0)
states: 3,791,391,797,311,336,087,553 (21)
abstracting: (1<=p253)
states: 3,301,476,296,834,626,355,200 (21)
abstracting: (p253<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p190)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p190<=0)
states: 3,791,391,797,311,336,087,553 (21)
abstracting: (1<=p253)
states: 3,301,476,296,834,626,355,200 (21)
abstracting: (p253<=1)
states: 3,895,742,030,264,859,099,137 (21)
..........................................................................................
EG iterations: 90
abstracting: (1<=p249)
states: 66,029,525,936,692,527,104 (19)
abstracting: (p249<=1)
states: 3,895,742,030,264,859,099,137 (21)
.................
before gc: list nodes free: 5598888

after gc: idd nodes used:2684150, unused:61315850; list nodes free:291450301
.MC time: 4m12.161sec

checking: AG [EF [[EG [[p177<=0 & 0<=p177]] & [[[p183<=0 & 0<=p183] | [p147<=1 & 1<=p147]] & [[[p88<=0 & 0<=p88] & [p43<=1 & 1<=p43]] | [[[p62<=0 & 0<=p62] & [p84<=1 & 1<=p84]] & [[p163<=0 & 0<=p163] & [p239<=1 & 1<=p239]]]]]]]]
normalized: ~ [E [true U ~ [E [true U [EG [[p177<=0 & 0<=p177]] & [[[p183<=0 & 0<=p183] | [p147<=1 & 1<=p147]] & [[[p88<=0 & 0<=p88] & [p43<=1 & 1<=p43]] | [[[p239<=1 & 1<=p239] & [p163<=0 & 0<=p163]] & [[p84<=1 & 1<=p84] & [p62<=0 & 0<=p62]]]]]]]]]]

abstracting: (0<=p62)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p62<=0)
states: 3,813,437,621,174,756,442,113 (21)
abstracting: (1<=p84)
states: 850,478,893,931,060,789,248 (20)
abstracting: (p84<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p163)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p163<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (1<=p239)
states: 99,044,288,905,038,790,656 (19)
abstracting: (p239<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (1<=p43)
states: 82,304,409,090,102,657,024 (19)
abstracting: (p43<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p88)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p88<=0)
states: 1,947,871,015,132,429,549,569 (21)
abstracting: (1<=p147)
states: 3,796,697,741,359,820,308,480 (21)
abstracting: (p147<=1)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (0<=p183)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p183<=0)
states: 3,826,175,208,295,843,758,081 (21)
abstracting: (0<=p177)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p177<=0)
states: 3,826,175,208,295,843,758,081 (21)
..............
before gc: list nodes free: 3114065

after gc: idd nodes used:228420, unused:63771580; list nodes free:303023453
............................................
before gc: list nodes free: 2743353

after gc: idd nodes used:1215308, unused:62784692; list nodes free:298318309
.MC time: 3m40.510sec

checking: [~ [E [AG [[AG [[[p262<=0 & 0<=p262] | [p155<=1 & 1<=p155]]] & [E [[p150<=1 & 1<=p150] U [p30<=1 & 1<=p30]] & [EF [[[p114<=0 & 0<=p114] | [p67<=1 & 1<=p67]]] | [[p104<=0 & 0<=p104] | [p102<=1 & 1<=p102]]]]]] U [EG [[AX [[p215<=1 & 1<=p215]] | [p31<=0 & 0<=p31]]] | ~ [AF [[[p2<=0 & 0<=p2] | [p42<=1 & 1<=p42]]]]]]] & EG [A [AG [~ [E [[p240<=1 & 1<=p240] U [[p158<=0 & 0<=p158] | [p105<=1 & 1<=p105]]]]] U EG [[[[p187<=0 & 0<=p187] & [[p196<=0 & 0<=p196] | [p69<=1 & 1<=p69]]] | [[p38<=1 & 1<=p38] | [p44<=1 & 1<=p44]]]]]]]
normalized: [EG [[~ [EG [~ [EG [[[[p44<=1 & 1<=p44] | [p38<=1 & 1<=p38]] | [[[p69<=1 & 1<=p69] | [p196<=0 & 0<=p196]] & [p187<=0 & 0<=p187]]]]]]] & ~ [E [~ [EG [[[[p44<=1 & 1<=p44] | [p38<=1 & 1<=p38]] | [[[p69<=1 & 1<=p69] | [p196<=0 & 0<=p196]] & [p187<=0 & 0<=p187]]]]] U [E [true U E [[p240<=1 & 1<=p240] U [[p105<=1 & 1<=p105] | [p158<=0 & 0<=p158]]]] & ~ [EG [[[[p44<=1 & 1<=p44] | [p38<=1 & 1<=p38]] | [[[p69<=1 & 1<=p69] | [p196<=0 & 0<=p196]] & [p187<=0 & 0<=p187]]]]]]]]]] & ~ [E [~ [E [true U ~ [[[[[[p102<=1 & 1<=p102] | [p104<=0 & 0<=p104]] | E [true U [[p67<=1 & 1<=p67] | [p114<=0 & 0<=p114]]]] & E [[p150<=1 & 1<=p150] U [p30<=1 & 1<=p30]]] & ~ [E [true U ~ [[[p155<=1 & 1<=p155] | [p262<=0 & 0<=p262]]]]]]]]] U [EG [~ [[[p42<=1 & 1<=p42] | [p2<=0 & 0<=p2]]]] | EG [[[p31<=0 & 0<=p31] | ~ [EX [~ [[p215<=1 & 1<=p215]]]]]]]]]]

abstracting: (1<=p215)
states: 1,947,871,015,132,429,549,568 (21)
abstracting: (p215<=1)
states: 3,895,742,030,264,859,099,137 (21)
.abstracting: (0<=p31)
states: 3,895,742,030,264,859,099,137 (21)
abstracting: (p31<=0)
states: 1,947,871,015,132,429,549,569 (21)
............
before gc: list nodes free: 4027564

after gc: idd nodes used:809768, unused:63190232; list nodes free:300336331
....
before gc: list nodes free: 4439295

after gc: idd nodes used:1805238, unused:62194762; list nodes free:295703669
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 5933416 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16100348 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 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:6006 (24), effective:466 (1)

initing FirstDep: 0m 0.000sec


net_ddint.h:600: Timeout: after 276 sec


iterations count:2747 (11), effective:199 (0)

net_ddint.h:600: Timeout: after 301 sec


iterations count:288 (1), effective:2 (0)

iterations count:244 (1), effective:0 (0)

iterations count:7406 (30), effective:519 (2)

iterations count:249 (1), effective:2 (0)

iterations count:7406 (30), effective:519 (2)

iterations count:7406 (30), effective:519 (2)

net_ddint.h:600: Timeout: after 376 sec


iterations count:12803 (52), effective:927 (3)

iterations count:2820 (11), effective:265 (1)

net_ddint.h:600: Timeout: after 329 sec


iterations count:246 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 288 sec


iterations count:246 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 250 sec


net_ddint.h:600: Timeout: after 219 sec


net_ddint.h:600: Timeout: after 191 sec

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="Parking-PT-416"
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 Parking-PT-416, 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 r266-smll-167863540900425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-416.tgz
mv Parking-PT-416 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;