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-167863540900434.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-432, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900434
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.1K Feb 26 15:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Feb 26 15:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 15:04 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.3K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 15:34 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 192K 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-432-CTLFireability-00
FORMULA_NAME Parking-PT-432-CTLFireability-01
FORMULA_NAME Parking-PT-432-CTLFireability-02
FORMULA_NAME Parking-PT-432-CTLFireability-03
FORMULA_NAME Parking-PT-432-CTLFireability-04
FORMULA_NAME Parking-PT-432-CTLFireability-05
FORMULA_NAME Parking-PT-432-CTLFireability-06
FORMULA_NAME Parking-PT-432-CTLFireability-07
FORMULA_NAME Parking-PT-432-CTLFireability-08
FORMULA_NAME Parking-PT-432-CTLFireability-09
FORMULA_NAME Parking-PT-432-CTLFireability-10
FORMULA_NAME Parking-PT-432-CTLFireability-11
FORMULA_NAME Parking-PT-432-CTLFireability-12
FORMULA_NAME Parking-PT-432-CTLFireability-13
FORMULA_NAME Parking-PT-432-CTLFireability-14
FORMULA_NAME Parking-PT-432-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679050096767

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-432
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 10:48:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 10:48:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 10:48:19] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-17 10:48:19] [INFO ] Transformed 529 places.
[2023-03-17 10:48:19] [INFO ] Transformed 785 transitions.
[2023-03-17 10:48:19] [INFO ] Found NUPN structural information;
[2023-03-17 10:48:19] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 245 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Support contains 94 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 526 transition count 454
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 526 transition count 454
Applied a total of 6 rules in 112 ms. Remains 526 /529 variables (removed 3) and now considering 454/457 (removed 3) transitions.
// Phase 1: matrix 454 rows 526 cols
[2023-03-17 10:48:20] [INFO ] Computed 124 place invariants in 35 ms
[2023-03-17 10:48:20] [INFO ] Implicit Places using invariants in 776 ms returned [64, 72, 80, 88, 96, 104, 144, 189, 197, 205, 213, 221, 229, 237, 245, 269, 314, 322, 330, 338, 346, 354, 362, 370, 394, 439, 447, 455, 463, 471, 479, 487, 495]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 835 ms to find 33 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 493/529 places, 454/457 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 471 transition count 432
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 471 transition count 432
Applied a total of 44 rules in 42 ms. Remains 471 /493 variables (removed 22) and now considering 432/454 (removed 22) transitions.
// Phase 1: matrix 432 rows 471 cols
[2023-03-17 10:48:21] [INFO ] Computed 91 place invariants in 10 ms
[2023-03-17 10:48:21] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-17 10:48:21] [INFO ] Invariant cache hit.
[2023-03-17 10:48:21] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-17 10:48:22] [INFO ] Implicit Places using invariants and state equation in 725 ms returned []
Implicit Place search using SMT with State Equation took 1044 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 471/529 places, 432/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2035 ms. Remains : 471/529 places, 432/457 transitions.
Support contains 94 out of 471 places after structural reductions.
[2023-03-17 10:48:22] [INFO ] Flatten gal took : 100 ms
[2023-03-17 10:48:22] [INFO ] Flatten gal took : 57 ms
[2023-03-17 10:48:22] [INFO ] Input system was already deterministic with 432 transitions.
Support contains 93 out of 471 places (down from 94) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 92 resets, run finished after 1066 ms. (steps per millisecond=9 ) properties (out of 60) seen :37
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) 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 23) seen :0
Running SMT prover for 23 properties.
[2023-03-17 10:48:23] [INFO ] Invariant cache hit.
[2023-03-17 10:48:24] [INFO ] [Real]Absence check using 91 positive place invariants in 42 ms returned sat
[2023-03-17 10:48:24] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2023-03-17 10:48:25] [INFO ] [Nat]Absence check using 91 positive place invariants in 46 ms returned sat
[2023-03-17 10:48:26] [INFO ] After 1298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2023-03-17 10:48:26] [INFO ] State equation strengthened by 108 read => feed constraints.
[2023-03-17 10:48:28] [INFO ] After 1240ms SMT Verify possible using 108 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2023-03-17 10:48:28] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 9 ms to minimize.
[2023-03-17 10:48:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2023-03-17 10:48:28] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 1 ms to minimize.
[2023-03-17 10:48:28] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2023-03-17 10:48:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-03-17 10:48:30] [INFO ] After 3182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 873 ms.
[2023-03-17 10:48:30] [INFO ] After 6305ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Parikh walk visited 8 properties in 890 ms.
Support contains 36 out of 471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 471 transition count 420
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 459 transition count 420
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 24 place count 459 transition count 408
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 48 place count 447 transition count 408
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 51 place count 444 transition count 405
Iterating global reduction 2 with 3 rules applied. Total rules applied 54 place count 444 transition count 405
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 84 place count 429 transition count 390
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 428 transition count 397
Free-agglomeration rule applied 71 times.
Iterating global reduction 2 with 71 rules applied. Total rules applied 157 place count 428 transition count 326
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 2 with 71 rules applied. Total rules applied 228 place count 357 transition count 326
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 357 transition count 324
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 232 place count 357 transition count 324
Applied a total of 232 rules in 270 ms. Remains 357 /471 variables (removed 114) and now considering 324/432 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 270 ms. Remains : 357/471 places, 324/432 transitions.
Incomplete random walk after 10000 steps, including 80 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :2
Running SMT prover for 4 properties.
// Phase 1: matrix 324 rows 357 cols
[2023-03-17 10:48:32] [INFO ] Computed 91 place invariants in 3 ms
[2023-03-17 10:48:33] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-17 10:48:33] [INFO ] [Nat]Absence check using 91 positive place invariants in 40 ms returned sat
[2023-03-17 10:48:33] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-17 10:48:33] [INFO ] State equation strengthened by 238 read => feed constraints.
[2023-03-17 10:48:33] [INFO ] After 263ms SMT Verify possible using 238 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-17 10:48:34] [INFO ] After 506ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 178 ms.
[2023-03-17 10:48:34] [INFO ] After 1351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 22 ms.
Support contains 6 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 324/324 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 357 transition count 323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 356 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 356 transition count 320
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 353 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 13 place count 348 transition count 315
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 348 transition count 315
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 20 place count 347 transition count 314
Free-agglomeration rule applied 11 times.
Iterating global reduction 2 with 11 rules applied. Total rules applied 31 place count 347 transition count 303
Reduce places removed 11 places and 0 transitions.
Graph (complete) has 663 edges and 336 vertex of which 257 are kept as prefixes of interest. Removing 79 places using SCC suffix rule.2 ms
Discarding 79 places :
Also discarding 65 output transitions
Drop transitions removed 65 transitions
Iterating post reduction 2 with 12 rules applied. Total rules applied 43 place count 257 transition count 238
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 49 place count 257 transition count 232
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 50 place count 257 transition count 231
Applied a total of 50 rules in 96 ms. Remains 257 /357 variables (removed 100) and now considering 231/324 (removed 93) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 257/357 places, 231/324 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :1
Finished Best-First random walk after 248 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=124 )
[2023-03-17 10:48:34] [INFO ] Flatten gal took : 35 ms
[2023-03-17 10:48:34] [INFO ] Flatten gal took : 38 ms
[2023-03-17 10:48:34] [INFO ] Input system was already deterministic with 432 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 470 transition count 415
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 454 transition count 415
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 454 transition count 399
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 438 transition count 399
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 431 transition count 392
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 431 transition count 392
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 86 place count 427 transition count 388
Applied a total of 86 rules in 79 ms. Remains 427 /471 variables (removed 44) and now considering 388/432 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 427/471 places, 388/432 transitions.
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 23 ms
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 29 ms
[2023-03-17 10:48:35] [INFO ] Input system was already deterministic with 388 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 471 transition count 416
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 455 transition count 416
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 455 transition count 400
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 64 place count 439 transition count 400
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 431 transition count 392
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 431 transition count 392
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 427 transition count 388
Applied a total of 88 rules in 72 ms. Remains 427 /471 variables (removed 44) and now considering 388/432 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 427/471 places, 388/432 transitions.
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 25 ms
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 29 ms
[2023-03-17 10:48:35] [INFO ] Input system was already deterministic with 388 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 463 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 463 transition count 424
Applied a total of 16 rules in 31 ms. Remains 463 /471 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 463/471 places, 424/432 transitions.
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 25 ms
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 30 ms
[2023-03-17 10:48:35] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 471 transition count 416
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 455 transition count 416
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 455 transition count 400
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 439 transition count 400
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 431 transition count 392
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 431 transition count 392
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 88 place count 427 transition count 388
Applied a total of 88 rules in 68 ms. Remains 427 /471 variables (removed 44) and now considering 388/432 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 68 ms. Remains : 427/471 places, 388/432 transitions.
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 22 ms
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 22 ms
[2023-03-17 10:48:35] [INFO ] Input system was already deterministic with 388 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 471 transition count 416
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 455 transition count 416
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 455 transition count 400
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 439 transition count 400
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 431 transition count 392
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 431 transition count 392
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 429 transition count 390
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 429 transition count 390
Applied a total of 85 rules in 77 ms. Remains 429 /471 variables (removed 42) and now considering 390/432 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 429/471 places, 390/432 transitions.
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 19 ms
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 21 ms
[2023-03-17 10:48:35] [INFO ] Input system was already deterministic with 390 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 471 transition count 416
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 455 transition count 416
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 455 transition count 400
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 439 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 432 transition count 393
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 432 transition count 393
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 429 transition count 390
Applied a total of 84 rules in 61 ms. Remains 429 /471 variables (removed 42) and now considering 390/432 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 429/471 places, 390/432 transitions.
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 18 ms
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 20 ms
[2023-03-17 10:48:35] [INFO ] Input system was already deterministic with 390 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 463 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 463 transition count 424
Applied a total of 16 rules in 22 ms. Remains 463 /471 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 463/471 places, 424/432 transitions.
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 24 ms
[2023-03-17 10:48:35] [INFO ] Flatten gal took : 21 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 471 transition count 419
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 27 place count 458 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 457 transition count 418
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 28 place count 457 transition count 404
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 56 place count 443 transition count 404
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 64 place count 435 transition count 396
Iterating global reduction 3 with 8 rules applied. Total rules applied 72 place count 435 transition count 396
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 78 place count 432 transition count 393
Applied a total of 78 rules in 53 ms. Remains 432 /471 variables (removed 39) and now considering 393/432 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 432/471 places, 393/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 20 ms
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 22 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 464 transition count 425
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 464 transition count 425
Applied a total of 14 rules in 17 ms. Remains 464 /471 variables (removed 7) and now considering 425/432 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 464/471 places, 425/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 20 ms
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 22 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 470 transition count 416
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 455 transition count 416
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 455 transition count 401
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 440 transition count 401
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 432 transition count 393
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 432 transition count 393
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 428 transition count 389
Applied a total of 84 rules in 42 ms. Remains 428 /471 variables (removed 43) and now considering 389/432 (removed 43) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 428/471 places, 389/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 16 ms
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 18 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 389 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 471 transition count 417
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 456 transition count 417
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 456 transition count 402
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 441 transition count 402
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 66 place count 435 transition count 396
Iterating global reduction 2 with 6 rules applied. Total rules applied 72 place count 435 transition count 396
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 432 transition count 393
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 79 place count 432 transition count 393
Applied a total of 79 rules in 60 ms. Remains 432 /471 variables (removed 39) and now considering 393/432 (removed 39) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 432/471 places, 393/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 18 ms
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 19 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 471 transition count 417
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 456 transition count 417
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 456 transition count 402
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 441 transition count 402
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 68 place count 433 transition count 394
Iterating global reduction 2 with 8 rules applied. Total rules applied 76 place count 433 transition count 394
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 84 place count 429 transition count 390
Applied a total of 84 rules in 43 ms. Remains 429 /471 variables (removed 42) and now considering 390/432 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 429/471 places, 390/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 25 ms
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 19 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 390 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 463 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 463 transition count 424
Applied a total of 16 rules in 17 ms. Remains 463 /471 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 463/471 places, 424/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 20 ms
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 20 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 465 transition count 426
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 465 transition count 426
Applied a total of 12 rules in 20 ms. Remains 465 /471 variables (removed 6) and now considering 426/432 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 465/471 places, 426/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 21 ms
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 23 ms
[2023-03-17 10:48:36] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 471 transition count 418
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 457 transition count 418
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 457 transition count 404
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 443 transition count 404
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 64 place count 435 transition count 396
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 435 transition count 396
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 431 transition count 392
Applied a total of 80 rules in 40 ms. Remains 431 /471 variables (removed 40) and now considering 392/432 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 431/471 places, 392/432 transitions.
[2023-03-17 10:48:36] [INFO ] Flatten gal took : 17 ms
[2023-03-17 10:48:37] [INFO ] Flatten gal took : 19 ms
[2023-03-17 10:48:37] [INFO ] Input system was already deterministic with 392 transitions.
Starting structural reductions in LTL mode, iteration 0 : 471/471 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 463 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 463 transition count 424
Applied a total of 16 rules in 16 ms. Remains 463 /471 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 463/471 places, 424/432 transitions.
[2023-03-17 10:48:37] [INFO ] Flatten gal took : 17 ms
[2023-03-17 10:48:37] [INFO ] Flatten gal took : 19 ms
[2023-03-17 10:48:37] [INFO ] Input system was already deterministic with 424 transitions.
[2023-03-17 10:48:37] [INFO ] Flatten gal took : 20 ms
[2023-03-17 10:48:37] [INFO ] Flatten gal took : 19 ms
[2023-03-17 10:48:37] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-17 10:48:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 471 places, 432 transitions and 1470 arcs took 4 ms.
Total runtime 17579 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 471 NrTr: 432 NrArc: 1470)

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

net check time: 0m 0.000sec

init dd package: 0m 3.418sec


RS generation: 0m 7.239sec


-> reachability set: #nodes 31158 (3.1e+04) #states 167,533,015,640,059,036,945,105,289,216,001 (32)



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

checking: EF [AG [[p249<=1 & 1<=p249]]]
normalized: E [true U ~ [E [true U ~ [[p249<=1 & 1<=p249]]]]]

abstracting: (1<=p249)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p249<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
-> the formula is FALSE

FORMULA Parking-PT-432-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.069sec

checking: AG [AF [EG [[~ [[p318<=1 & 1<=p318]] | ~ [[p354<=1 & 1<=p354]]]]]]
normalized: ~ [E [true U EG [~ [EG [[~ [[p354<=1 & 1<=p354]] | ~ [[p318<=1 & 1<=p318]]]]]]]]

abstracting: (1<=p318)
states: 2,439,801,198,641,636,460,365,611,008,000 (30)
abstracting: (p318<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p354)
states: 165,093,214,441,417,400,484,739,678,208,000 (32)
abstracting: (p354<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
.
EG iterations: 1
.........
before gc: list nodes free: 297266

after gc: idd nodes used:1522234, unused:62477766; list nodes free:284514886
.
before gc: list nodes free: 535001

after gc: idd nodes used:3609998, unused:60390002; list nodes free:279323830
MC time: 4m 0.987sec

checking: ~ [E [~ [[p437<=1 & 1<=p437]] U ~ [EF [~ [[p90<=1 & 1<=p90]]]]]]
normalized: ~ [E [~ [[p437<=1 & 1<=p437]] U ~ [E [true U ~ [[p90<=1 & 1<=p90]]]]]]

abstracting: (1<=p90)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p90<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p437)
states: 1,340,264,125,120,472,295,560,842,313,728 (30)
abstracting: (p437<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
-> the formula is TRUE

FORMULA Parking-PT-432-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.003sec

checking: AG [[AF [EG [[p217<=1 & 1<=p217]]] | AG [[p257<=0 & 0<=p257]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[p257<=0 & 0<=p257]]]] | ~ [EG [~ [EG [[p217<=1 & 1<=p217]]]]]]]]]

abstracting: (1<=p217)
states: 1,626,534,132,427,757,640,243,740,672,000 (30)
abstracting: (p217<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
.........
before gc: list nodes free: 3714946

after gc: idd nodes used:1375646, unused:62624354; list nodes free:289427667
.
before gc: list nodes free: 837927

after gc: idd nodes used:2782951, unused:61217049; list nodes free:282996693
MC time: 3m59.491sec

checking: AG [AF [[[p251<=0 & 0<=p251] | AG [[[p29<=1 & 1<=p29] & [p126<=1 & 1<=p126]]]]]]
normalized: ~ [E [true U EG [~ [[~ [E [true U ~ [[[p126<=1 & 1<=p126] & [p29<=1 & 1<=p29]]]]] | [p251<=0 & 0<=p251]]]]]]

abstracting: (0<=p251)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p251<=0)
states: 83,766,507,820,029,518,472,552,644,608,001 (31)
abstracting: (1<=p29)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p29<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p126)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p126<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
.....
before gc: list nodes free: 2296253

after gc: idd nodes used:728916, unused:63271084; list nodes free:292354306
..
before gc: list nodes free: 1923185

after gc: idd nodes used:1456155, unused:62543845; list nodes free:291108172
MC time: 3m42.237sec

checking: AG [[AF [AG [[[p201<=0 & 0<=p201] | [p244<=0 & 0<=p244]]]] & EG [AF [~ [E [[[p394<=1 & 1<=p394] & [p470<=1 & 1<=p470]] U [p400<=1 & 1<=p400]]]]]]]
normalized: ~ [E [true U ~ [[EG [~ [EG [E [[[p470<=1 & 1<=p470] & [p394<=1 & 1<=p394]] U [p400<=1 & 1<=p400]]]]] & ~ [EG [E [true U ~ [[[p244<=0 & 0<=p244] | [p201<=0 & 0<=p201]]]]]]]]]]

abstracting: (0<=p201)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p201<=0)
states: 165,093,214,441,417,400,484,739,678,208,001 (32)
abstracting: (0<=p244)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p244<=0)
states: 2,439,801,198,641,636,460,365,611,008,001 (30)
MC time: 3m26.085sec

checking: EG [AX [EF [[EF [[[p214<=0 & 0<=p214] | [p244<=0 & 0<=p244]]] & [[p78<=0 & 0<=p78] | [[p157<=0 & 0<=p157] | [p228<=0 & 0<=p228]]]]]]]
normalized: EG [~ [EX [~ [E [true U [[[[p228<=0 & 0<=p228] | [p157<=0 & 0<=p157]] | [p78<=0 & 0<=p78]] & E [true U [[p244<=0 & 0<=p244] | [p214<=0 & 0<=p214]]]]]]]]]

abstracting: (0<=p214)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p214<=0)
states: 165,093,214,441,417,400,484,739,678,208,001 (32)
abstracting: (0<=p244)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p244<=0)
states: 2,439,801,198,641,636,460,365,611,008,001 (30)
abstracting: (0<=p78)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p78<=0)
states: 165,929,828,887,522,586,830,798,061,568,001 (32)
abstracting: (0<=p157)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p157<=0)
states: 83,766,507,820,029,518,472,552,644,608,001 (31)
abstracting: (0<=p228)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p228<=0)
states: 165,093,214,441,417,400,484,739,678,208,001 (32)
.
EG iterations: 0
-> the formula is TRUE

FORMULA Parking-PT-432-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.783sec

checking: AG [A [[p179<=1 & 1<=p179] U EF [[[[p321<=1 & 1<=p321] | EG [[p253<=1 & 1<=p253]]] | [[p191<=1 & 1<=p191] | [p169<=1 & 1<=p169]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [E [true U [[[p169<=1 & 1<=p169] | [p191<=1 & 1<=p191]] | [EG [[p253<=1 & 1<=p253]] | [p321<=1 & 1<=p321]]]]]]] & ~ [E [~ [E [true U [[[p169<=1 & 1<=p169] | [p191<=1 & 1<=p191]] | [EG [[p253<=1 & 1<=p253]] | [p321<=1 & 1<=p321]]]]] U [~ [[p179<=1 & 1<=p179]] & ~ [E [true U [[[p169<=1 & 1<=p169] | [p191<=1 & 1<=p191]] | [EG [[p253<=1 & 1<=p253]] | [p321<=1 & 1<=p321]]]]]]]]]]]]

abstracting: (1<=p321)
states: 1,626,534,132,427,757,640,243,740,672,000 (30)
abstracting: (p321<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p253)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p253<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
......
before gc: list nodes free: 1597701

after gc: idd nodes used:1084557, unused:62915443; list nodes free:292813432
.MC time: 3m26.641sec

checking: A [[~ [EX [AX [E [[p153<=1 & 1<=p153] U [p371<=1 & 1<=p371]]]]] | [[p54<=1 & 1<=p54] & [p103<=1 & 1<=p103]]] U [[p62<=1 & 1<=p62] & [p136<=1 & 1<=p136]]]
normalized: [~ [EG [~ [[[p136<=1 & 1<=p136] & [p62<=1 & 1<=p62]]]]] & ~ [E [~ [[[p136<=1 & 1<=p136] & [p62<=1 & 1<=p62]]] U [~ [[[[p103<=1 & 1<=p103] & [p54<=1 & 1<=p54]] | ~ [EX [~ [EX [~ [E [[p153<=1 & 1<=p153] U [p371<=1 & 1<=p371]]]]]]]]] & ~ [[[p136<=1 & 1<=p136] & [p62<=1 & 1<=p62]]]]]]]

abstracting: (1<=p62)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p62<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p136)
states: 60,119,503,220,116,879,286,521,036,800,000 (31)
abstracting: (p136<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p371)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p371<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p153)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p153<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)

before gc: list nodes free: 1537083

after gc: idd nodes used:630781, unused:63369219; list nodes free:294909384
MC time: 3m10.069sec

checking: EF [[AF [EG [[p106<=0 & 0<=p106]]] | [EG [[[p9<=0 & 0<=p9] | [p343<=0 & 0<=p343]]] & ~ [A [[EG [[[p216<=1 & 1<=p216] & [p247<=1 & 1<=p247]]] & AF [[p8<=1 & 1<=p8]]] U [p295<=1 & 1<=p295]]]]]]
normalized: E [true U [[~ [[~ [EG [~ [[p295<=1 & 1<=p295]]]] & ~ [E [~ [[p295<=1 & 1<=p295]] U [~ [[~ [EG [~ [[p8<=1 & 1<=p8]]]] & EG [[[p247<=1 & 1<=p247] & [p216<=1 & 1<=p216]]]]] & ~ [[p295<=1 & 1<=p295]]]]]]] & EG [[[p343<=0 & 0<=p343] | [p9<=0 & 0<=p9]]]] | ~ [EG [~ [EG [[p106<=0 & 0<=p106]]]]]]]

abstracting: (0<=p106)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p106<=0)
states: 165,929,828,887,522,586,830,798,061,568,001 (32)
.
EG iterations: 1
..........
before gc: list nodes free: 1410809

after gc: idd nodes used:2549187, unused:61450813; list nodes free:286064298
MC time: 2m55.058sec

checking: AG [AX [[[[p150<=0 & 0<=p150] | [p238<=0 & 0<=p238]] | [[p149<=1 & 1<=p149] | [[[p97<=1 & 1<=p97] & [p109<=1 & 1<=p109]] & [[p133<=1 & 1<=p133] & [[p42<=1 & 1<=p42] & [p82<=1 & 1<=p82]]]]]]]]
normalized: ~ [E [true U EX [~ [[[[p149<=1 & 1<=p149] | [[[[p82<=1 & 1<=p82] & [p42<=1 & 1<=p42]] & [p133<=1 & 1<=p133]] & [[p109<=1 & 1<=p109] & [p97<=1 & 1<=p97]]]] | [[p238<=0 & 0<=p238] | [p150<=0 & 0<=p150]]]]]]]

abstracting: (0<=p150)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p150<=0)
states: 83,766,507,820,029,518,472,552,644,608,001 (31)
abstracting: (0<=p238)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p238<=0)
states: 165,093,214,441,417,400,484,739,678,208,001 (32)
abstracting: (1<=p97)
states: 1,603,186,752,536,450,114,307,227,648,000 (30)
abstracting: (p97<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p109)
states: 153,104,334,867,230,985,916,340,240,384,000 (32)
abstracting: (p109<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p133)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p133<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p42)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p42<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p82)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p82<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p149)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p149<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
.MC time: 2m42.022sec

checking: AF [[[EG [[[p85<=0 & 0<=p85] | [p137<=0 & 0<=p137]]] | [AX [EG [[p105<=0 & 0<=p105]]] | ~ [E [EF [[p204<=1 & 1<=p204]] U EX [[[p379<=1 & 1<=p379] & [p423<=1 & 1<=p423]]]]]]] | [[p327<=1 & 1<=p327] | [[p210<=1 & 1<=p210] | EG [[[p198<=1 & 1<=p198] & [p247<=1 & 1<=p247]]]]]]]
normalized: ~ [EG [~ [[[[EG [[[p247<=1 & 1<=p247] & [p198<=1 & 1<=p198]]] | [p210<=1 & 1<=p210]] | [p327<=1 & 1<=p327]] | [[~ [E [E [true U [p204<=1 & 1<=p204]] U EX [[[p423<=1 & 1<=p423] & [p379<=1 & 1<=p379]]]]] | ~ [EX [~ [EG [[p105<=0 & 0<=p105]]]]]] | EG [[[p137<=0 & 0<=p137] | [p85<=0 & 0<=p85]]]]]]]]

abstracting: (0<=p85)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p85<=0)
states: 165,929,828,887,522,586,830,798,061,568,001 (32)
abstracting: (0<=p137)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p137<=0)
states: 107,413,512,419,942,157,658,584,252,416,001 (32)
.........
before gc: list nodes free: 2816993

after gc: idd nodes used:1261004, unused:62738996; list nodes free:291986742
MC time: 2m29.255sec

checking: EG [[AF [AG [[[p26<=1 & 1<=p26] & [p59<=1 & 1<=p59]]]] & [E [[[p273<=1 & 1<=p273] & [p319<=1 & 1<=p319]] U [~ [[[p394<=1 & 1<=p394] & [[p470<=1 & 1<=p470] & [p383<=1 & 1<=p383]]]] & AG [[[p205<=1 & 1<=p205] & [p247<=1 & 1<=p247]]]]] | AG [[[p34<=0 & 0<=p34] | [p70<=0 & 0<=p70]]]]]]
normalized: EG [[[~ [E [true U ~ [[[p70<=0 & 0<=p70] | [p34<=0 & 0<=p34]]]]] | E [[[p319<=1 & 1<=p319] & [p273<=1 & 1<=p273]] U [~ [E [true U ~ [[[p247<=1 & 1<=p247] & [p205<=1 & 1<=p205]]]]] & ~ [[[[p383<=1 & 1<=p383] & [p470<=1 & 1<=p470]] & [p394<=1 & 1<=p394]]]]]] & ~ [EG [E [true U ~ [[[p59<=1 & 1<=p59] & [p26<=1 & 1<=p26]]]]]]]]

abstracting: (1<=p26)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p26<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p59)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p59<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)

EG iterations: 0
abstracting: (1<=p394)
states: 1,340,264,125,120,472,295,560,842,313,728 (30)
abstracting: (p394<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p470)
states: 50,259,904,692,017,711,083,531,586,764,800 (31)
abstracting: (p470<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p383)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p383<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p205)
states: 1,626,534,132,427,757,640,243,740,672,000 (30)
abstracting: (p205<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p247)
states: 60,181,762,899,827,032,689,018,404,864,000 (31)
abstracting: (p247<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p273)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p273<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p319)
states: 2,439,801,198,641,636,460,365,611,008,000 (30)
abstracting: (p319<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (0<=p34)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p34<=0)
states: 83,766,507,820,029,518,472,552,644,608,001 (31)
abstracting: (0<=p70)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p70<=0)
states: 165,128,235,511,254,361,773,644,447,744,001 (32)
MC time: 2m18.103sec

checking: EX [[AG [[AX [EG [[p314<=1 & 1<=p314]]] | EF [[p327<=1 & 1<=p327]]]] & [[~ [A [[AG [[p191<=1 & 1<=p191]] | [[p6<=1 & 1<=p6] & [p113<=1 & 1<=p113]]] U AF [[[p101<=1 & 1<=p101] & [p133<=1 & 1<=p133]]]]] | [p386<=0 & 0<=p386]] | [[p463<=0 & 0<=p463] | [EG [[[p160<=0 & 0<=p160] | [p207<=0 & 0<=p207]]] & [[p321<=0 & 0<=p321] | [[p97<=0 & 0<=p97] | [p265<=0 & 0<=p265]]]]]]]]
normalized: EX [[[[[[[[p97<=0 & 0<=p97] | [p265<=0 & 0<=p265]] | [p321<=0 & 0<=p321]] & EG [[[p207<=0 & 0<=p207] | [p160<=0 & 0<=p160]]]] | [p463<=0 & 0<=p463]] | [[p386<=0 & 0<=p386] | ~ [[~ [EG [EG [~ [[[p133<=1 & 1<=p133] & [p101<=1 & 1<=p101]]]]]] & ~ [E [EG [~ [[[p133<=1 & 1<=p133] & [p101<=1 & 1<=p101]]]] U [~ [[[[p113<=1 & 1<=p113] & [p6<=1 & 1<=p6]] | ~ [E [true U ~ [[p191<=1 & 1<=p191]]]]]] & EG [~ [[[p133<=1 & 1<=p133] & [p101<=1 & 1<=p101]]]]]]]]]]] & ~ [E [true U ~ [[E [true U [p327<=1 & 1<=p327]] | ~ [EX [~ [EG [[p314<=1 & 1<=p314]]]]]]]]]]]

abstracting: (1<=p314)
states: 2,439,801,198,641,636,460,365,611,008,000 (30)
abstracting: (p314<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
.........
before gc: list nodes free: 834706

after gc: idd nodes used:1817342, unused:62182658; list nodes free:289566419
MC time: 2m 7.731sec

checking: A [EF [[[[p62<=1 & 1<=p62] & [p136<=1 & 1<=p136]] & [[p139<=1 & 1<=p139] & [p171<=1 & 1<=p171]]]] U [EG [[[~ [A [[[p390<=1 & 1<=p390] & [p466<=1 & 1<=p466]] U [[p49<=1 & 1<=p49] & [p131<=1 & 1<=p131]]]] | [[p110<=1 & 1<=p110] & [[p134<=1 & 1<=p134] & [[[p464<=1 & 1<=p464] & [p465<=1 & 1<=p465]] | [p78<=1 & 1<=p78]]]]] & AG [EF [[p28<=1 & 1<=p28]]]]] & ~ [[[p426<=1 & 1<=p426] & [p470<=1 & 1<=p470]]]]]
normalized: [~ [EG [~ [[~ [[[p470<=1 & 1<=p470] & [p426<=1 & 1<=p426]]] & EG [[~ [E [true U ~ [E [true U [p28<=1 & 1<=p28]]]]] & [[[[[p78<=1 & 1<=p78] | [[p465<=1 & 1<=p465] & [p464<=1 & 1<=p464]]] & [p134<=1 & 1<=p134]] & [p110<=1 & 1<=p110]] | ~ [[~ [EG [~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]]]] & ~ [E [~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]] U [~ [[[p466<=1 & 1<=p466] & [p390<=1 & 1<=p390]]] & ~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]]]]]]]]]]]]]] & ~ [E [~ [[~ [[[p470<=1 & 1<=p470] & [p426<=1 & 1<=p426]]] & EG [[~ [E [true U ~ [E [true U [p28<=1 & 1<=p28]]]]] & [[[[[p78<=1 & 1<=p78] | [[p465<=1 & 1<=p465] & [p464<=1 & 1<=p464]]] & [p134<=1 & 1<=p134]] & [p110<=1 & 1<=p110]] | ~ [[~ [EG [~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]]]] & ~ [E [~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]] U [~ [[[p466<=1 & 1<=p466] & [p390<=1 & 1<=p390]]] & ~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]]]]]]]]]]]] U [~ [E [true U [[[p171<=1 & 1<=p171] & [p139<=1 & 1<=p139]] & [[p136<=1 & 1<=p136] & [p62<=1 & 1<=p62]]]]] & ~ [[~ [[[p470<=1 & 1<=p470] & [p426<=1 & 1<=p426]]] & EG [[~ [E [true U ~ [E [true U [p28<=1 & 1<=p28]]]]] & [[[[[p78<=1 & 1<=p78] | [[p465<=1 & 1<=p465] & [p464<=1 & 1<=p464]]] & [p134<=1 & 1<=p134]] & [p110<=1 & 1<=p110]] | ~ [[~ [EG [~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]]]] & ~ [E [~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]] U [~ [[[p466<=1 & 1<=p466] & [p390<=1 & 1<=p390]]] & ~ [[[p131<=1 & 1<=p131] & [p49<=1 & 1<=p49]]]]]]]]]]]]]]]]]

abstracting: (1<=p49)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p49<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p131)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p131<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p390)
states: 2,010,396,187,680,708,443,341,263,470,592 (30)
abstracting: (p390<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p466)
states: 164,852,487,389,818,092,353,983,604,588,544 (32)
abstracting: (p466<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p49)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p49<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p131)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p131<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p49)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p49<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p131)
states: 2,404,780,128,804,675,171,460,841,472,000 (30)
abstracting: (p131<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
.........
before gc: list nodes free: 4276591

after gc: idd nodes used:1394143, unused:62605857; list nodes free:291413553
MC time: 1m58.243sec

checking: [AX [[EX [[[[p437<=0 & 0<=p437] & [p249<=1 & 1<=p249]] & [[p281<=1 & 1<=p281] & [p173<=1 & 1<=p173]]]] | [[p173<=1 & 1<=p173] | EG [~ [E [[p265<=1 & 1<=p265] U [[p359<=1 & 1<=p359] & [p392<=1 & 1<=p392]]]]]]]] | A [[[p210<=1 & 1<=p210] & AX [[p467<=1 & 1<=p467]]] U AG [[[EX [[[p397<=1 & 1<=p397] & [p466<=1 & 1<=p466]]] & E [[[p165<=1 & 1<=p165] & [p230<=1 & 1<=p230]] U [[p27<=1 & 1<=p27] & [p63<=1 & 1<=p63]]]] | AG [~ [[p295<=1 & 1<=p295]]]]]]]
normalized: [[~ [EG [E [true U ~ [[~ [E [true U [p295<=1 & 1<=p295]]] | [E [[[p230<=1 & 1<=p230] & [p165<=1 & 1<=p165]] U [[p63<=1 & 1<=p63] & [p27<=1 & 1<=p27]]] & EX [[[p466<=1 & 1<=p466] & [p397<=1 & 1<=p397]]]]]]]]] & ~ [E [E [true U ~ [[~ [E [true U [p295<=1 & 1<=p295]]] | [E [[[p230<=1 & 1<=p230] & [p165<=1 & 1<=p165]] U [[p63<=1 & 1<=p63] & [p27<=1 & 1<=p27]]] & EX [[[p466<=1 & 1<=p466] & [p397<=1 & 1<=p397]]]]]]] U [~ [[~ [EX [~ [[p467<=1 & 1<=p467]]]] & [p210<=1 & 1<=p210]]] & E [true U ~ [[~ [E [true U [p295<=1 & 1<=p295]]] | [E [[[p230<=1 & 1<=p230] & [p165<=1 & 1<=p165]] U [[p63<=1 & 1<=p63] & [p27<=1 & 1<=p27]]] & EX [[[p466<=1 & 1<=p466] & [p397<=1 & 1<=p397]]]]]]]]]]] | ~ [EX [~ [[[EG [~ [E [[p265<=1 & 1<=p265] U [[p392<=1 & 1<=p392] & [p359<=1 & 1<=p359]]]]] | [p173<=1 & 1<=p173]] | EX [[[[p173<=1 & 1<=p173] & [p281<=1 & 1<=p281]] & [[p249<=1 & 1<=p249] & [p437<=0 & 0<=p437]]]]]]]]]

abstracting: (0<=p437)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (p437<=0)
states: 166,192,751,514,938,564,649,544,446,902,273 (32)
abstracting: (1<=p249)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p249<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p281)
states: 2,439,801,198,641,636,460,365,611,008,000 (30)
abstracting: (p281<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p173)
states: 2,439,801,198,641,636,460,365,611,008,000 (30)
abstracting: (p173<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
.abstracting: (1<=p173)
states: 2,439,801,198,641,636,460,365,611,008,000 (30)
abstracting: (p173<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p359)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p359<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p392)
states: 2,010,396,187,680,708,443,341,263,470,592 (30)
abstracting: (p392<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
abstracting: (1<=p265)
states: 83,766,507,820,029,518,472,552,644,608,000 (31)
abstracting: (p265<=1)
states: 167,533,015,640,059,036,945,105,289,216,001 (32)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5922308 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101408 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.006sec


iterations count:20145 (46), effective:844 (1)

initing FirstDep: 0m 0.002sec


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

net_ddint.h:600: Timeout: after 239 sec


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

net_ddint.h:600: Timeout: after 238 sec


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

net_ddint.h:600: Timeout: after 221 sec


sat_reach.icc:155: Timeout: after 205 sec


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

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

net_ddint.h:600: Timeout: after 205 sec


sat_reach.icc:155: Timeout: after 189 sec


net_ddint.h:600: Timeout: after 174 sec


sat_reach.icc:155: Timeout: after 161 sec


net_ddint.h:600: Timeout: after 148 sec


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

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

sat_reach.icc:155: Timeout: after 137 sec


net_ddint.h:600: Timeout: after 126 sec


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

net_ddint.h:600: Timeout: after 117 sec


sat_reach.icc:155: Timeout: after 107 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-432"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is Parking-PT-432, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540900434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;