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

--------------------
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-CTLFireability-00
FORMULA_NAME Parking-PT-416-CTLFireability-01
FORMULA_NAME Parking-PT-416-CTLFireability-02
FORMULA_NAME Parking-PT-416-CTLFireability-03
FORMULA_NAME Parking-PT-416-CTLFireability-04
FORMULA_NAME Parking-PT-416-CTLFireability-05
FORMULA_NAME Parking-PT-416-CTLFireability-06
FORMULA_NAME Parking-PT-416-CTLFireability-07
FORMULA_NAME Parking-PT-416-CTLFireability-08
FORMULA_NAME Parking-PT-416-CTLFireability-09
FORMULA_NAME Parking-PT-416-CTLFireability-10
FORMULA_NAME Parking-PT-416-CTLFireability-11
FORMULA_NAME Parking-PT-416-CTLFireability-12
FORMULA_NAME Parking-PT-416-CTLFireability-13
FORMULA_NAME Parking-PT-416-CTLFireability-14
FORMULA_NAME Parking-PT-416-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679042716004

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-416
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:45:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 08:45:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:45:19] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2023-03-17 08:45:19] [INFO ] Transformed 305 places.
[2023-03-17 08:45:19] [INFO ] Transformed 433 transitions.
[2023-03-17 08:45:19] [INFO ] Found NUPN structural information;
[2023-03-17 08:45:19] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 257 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Support contains 109 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 303 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 303 transition count 255
Applied a total of 4 rules in 116 ms. Remains 303 /305 variables (removed 2) and now considering 255/257 (removed 2) transitions.
// Phase 1: matrix 255 rows 303 cols
[2023-03-17 08:45:20] [INFO ] Computed 76 place invariants in 35 ms
[2023-03-17 08:45:20] [INFO ] Implicit Places using invariants in 739 ms returned [48, 64, 72, 88, 118, 142, 158, 187, 195, 203, 227, 229, 257, 273, 281, 297, 299]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 826 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 286/305 places, 255/257 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 277 transition count 246
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 277 transition count 246
Applied a total of 18 rules in 18 ms. Remains 277 /286 variables (removed 9) and now considering 246/255 (removed 9) transitions.
// Phase 1: matrix 246 rows 277 cols
[2023-03-17 08:45:20] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-17 08:45:21] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-17 08:45:21] [INFO ] Invariant cache hit.
[2023-03-17 08:45:21] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-17 08:45:21] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 277/305 places, 246/257 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1974 ms. Remains : 277/305 places, 246/257 transitions.
Support contains 109 out of 277 places after structural reductions.
[2023-03-17 08:45:22] [INFO ] Flatten gal took : 108 ms
[2023-03-17 08:45:22] [INFO ] Flatten gal took : 49 ms
[2023-03-17 08:45:22] [INFO ] Input system was already deterministic with 246 transitions.
Support contains 105 out of 277 places (down from 109) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 128 resets, run finished after 1127 ms. (steps per millisecond=8 ) properties (out of 60) seen :45
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-17 08:45:23] [INFO ] Invariant cache hit.
[2023-03-17 08:45:24] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-17 08:45:24] [INFO ] [Nat]Absence check using 59 positive place invariants in 19 ms returned sat
[2023-03-17 08:45:25] [INFO ] After 482ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :14
[2023-03-17 08:45:25] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-17 08:45:25] [INFO ] After 305ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :14
[2023-03-17 08:45:25] [INFO ] Deduced a trap composed of 36 places in 87 ms of which 9 ms to minimize.
[2023-03-17 08:45:26] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 26 ms to minimize.
[2023-03-17 08:45:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2023-03-17 08:45:26] [INFO ] After 1262ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :14
Attempting to minimize the solution found.
Minimization took 392 ms.
[2023-03-17 08:45:26] [INFO ] After 2920ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :14
Fused 15 Parikh solutions to 14 different solutions.
Parikh walk visited 5 properties in 262 ms.
Support contains 19 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 246/246 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 277 transition count 240
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 271 transition count 239
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 270 transition count 239
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 14 place count 270 transition count 232
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 28 place count 263 transition count 232
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 30 place count 261 transition count 230
Iterating global reduction 3 with 2 rules applied. Total rules applied 32 place count 261 transition count 230
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
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 60 place count 247 transition count 216
Free-agglomeration rule applied 50 times.
Iterating global reduction 3 with 50 rules applied. Total rules applied 110 place count 247 transition count 166
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 3 with 50 rules applied. Total rules applied 160 place count 197 transition count 166
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 197 transition count 164
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 164 place count 195 transition count 164
Applied a total of 164 rules in 115 ms. Remains 195 /277 variables (removed 82) and now considering 164/246 (removed 82) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 195/277 places, 164/246 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 164 rows 195 cols
[2023-03-17 08:45:28] [INFO ] Computed 59 place invariants in 5 ms
[2023-03-17 08:45:28] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 08:45:28] [INFO ] [Nat]Absence check using 59 positive place invariants in 23 ms returned sat
[2023-03-17 08:45:28] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 08:45:28] [INFO ] State equation strengthened by 118 read => feed constraints.
[2023-03-17 08:45:28] [INFO ] After 116ms SMT Verify possible using 118 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 08:45:28] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-17 08:45:28] [INFO ] After 615ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 41 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=13 )
Parikh walk visited 3 properties in 2 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2023-03-17 08:45:28] [INFO ] Flatten gal took : 33 ms
[2023-03-17 08:45:28] [INFO ] Flatten gal took : 50 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 246 transitions.
Support contains 99 out of 277 places (down from 103) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 11 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 18 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 21 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 274 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 274 transition count 243
Applied a total of 6 rules in 12 ms. Remains 274 /277 variables (removed 3) and now considering 243/246 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 274/277 places, 243/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 19 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 18 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 10 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 17 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 10 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 15 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 12 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 16 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 11 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 11 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 8 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 7 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 17 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 274 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 274 transition count 243
Applied a total of 6 rules in 8 ms. Remains 274 /277 variables (removed 3) and now considering 243/246 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 274/277 places, 243/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 11 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 12 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 246/246 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 277 transition count 239
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 270 transition count 239
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 270 transition count 232
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 263 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 259 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 259 transition count 228
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 52 place count 251 transition count 220
Applied a total of 52 rules in 40 ms. Remains 251 /277 variables (removed 26) and now considering 220/246 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 251/277 places, 220/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 10 ms
[2023-03-17 08:45:29] [INFO ] Input system was already deterministic with 220 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 7 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:29] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:30] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 274 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 274 transition count 243
Applied a total of 6 rules in 7 ms. Remains 274 /277 variables (removed 3) and now considering 243/246 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 274/277 places, 243/246 transitions.
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 13 ms
[2023-03-17 08:45:30] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 275 transition count 244
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 275 transition count 244
Applied a total of 4 rules in 8 ms. Remains 275 /277 variables (removed 2) and now considering 244/246 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 275/277 places, 244/246 transitions.
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:30] [INFO ] Input system was already deterministic with 244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 246/246 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 273 transition count 242
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 273 transition count 242
Applied a total of 8 rules in 7 ms. Remains 273 /277 variables (removed 4) and now considering 242/246 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 273/277 places, 242/246 transitions.
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:30] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 246/246 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 277 transition count 239
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 270 transition count 239
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 270 transition count 232
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 263 transition count 232
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 32 place count 259 transition count 228
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 259 transition count 228
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 50 place count 252 transition count 221
Applied a total of 50 rules in 34 ms. Remains 252 /277 variables (removed 25) and now considering 221/246 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 252/277 places, 221/246 transitions.
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:45:30] [INFO ] Input system was already deterministic with 221 transitions.
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:30] [INFO ] Flatten gal took : 9 ms
[2023-03-17 08:45:30] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-17 08:45:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 246 transitions and 831 arcs took 2 ms.
Total runtime 10793 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: 277 NrTr: 246 NrArc: 831)

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

net check time: 0m 0.000sec

init dd package: 0m 3.595sec


RS generation: 0m 0.972sec


-> reachability set: #nodes 6471 (6.5e+03) #states 4,811,521,816,971,024,793,601 (21)



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

checking: AF [AG [EX [[p44<=1 & 1<=p44]]]]
normalized: ~ [EG [E [true U ~ [EX [[p44<=1 & 1<=p44]]]]]]

abstracting: (1<=p44)
states: 99,548,727,247,676,375,040 (19)
abstracting: (p44<=1)
states: 4,811,521,816,971,024,793,601 (21)
.
EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 1.308sec

checking: [AF [AX [[[p164<=1 & 1<=p164] & [p188<=1 & 1<=p188]]]] & EG [EX [[p131<=0 & 0<=p131]]]]
normalized: [EG [EX [[p131<=0 & 0<=p131]]] & ~ [EG [EX [~ [[[p188<=1 & 1<=p188] & [p164<=1 & 1<=p164]]]]]]]

abstracting: (1<=p164)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p164<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p188)
states: 138,461,059,481,180,569,600 (20)
abstracting: (p188<=1)
states: 4,811,521,816,971,024,793,601 (21)
..............
before gc: list nodes free: 188191

after gc: idd nodes used:1256854, unused:62743146; list nodes free:291930588
.
before gc: list nodes free: 1443720

after gc: idd nodes used:1460049, unused:62539951; list nodes free:293074854
.
before gc: list nodes free: 976704

after gc: idd nodes used:1683412, unused:62316588; list nodes free:292019934
MC time: 4m 0.153sec

checking: EX [EF [[AX [[[p18<=0 & 0<=p18] | [p199<=0 & 0<=p199]]] & EF [[p44<=1 & 1<=p44]]]]]
normalized: EX [E [true U [E [true U [p44<=1 & 1<=p44]] & ~ [EX [~ [[[p199<=0 & 0<=p199] | [p18<=0 & 0<=p18]]]]]]]]

abstracting: (0<=p18)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p18<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p199)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p199<=0)
states: 4,673,060,757,489,844,224,001 (21)
.abstracting: (1<=p44)
states: 99,548,727,247,676,375,040 (19)
abstracting: (p44<=1)
states: 4,811,521,816,971,024,793,601 (21)
.-> the formula is TRUE

FORMULA Parking-PT-416-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.778sec

checking: AX [E [EF [AX [[p249<=1 & 1<=p249]]] U EX [~ [[[p212<=1 & 1<=p212] | [[p109<=1 & 1<=p109] | ~ [[p192<=1 & 1<=p192]]]]]]]]
normalized: ~ [EX [~ [E [E [true U ~ [EX [~ [[p249<=1 & 1<=p249]]]]] U EX [~ [[[~ [[p192<=1 & 1<=p192]] | [p109<=1 & 1<=p109]] | [p212<=1 & 1<=p212]]]]]]]]

abstracting: (1<=p212)
states: 1,038,457,946,108,854,272,000 (21)
abstracting: (p212<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p109)
states: 122,326,825,855,195,545,600 (20)
abstracting: (p109<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p192)
states: 69,230,529,740,590,284,800 (19)
abstracting: (p192<=1)
states: 4,811,521,816,971,024,793,601 (21)
.abstracting: (1<=p249)
states: 83,678,640,295,148,257,280 (19)
abstracting: (p249<=1)
states: 4,811,521,816,971,024,793,601 (21)
.
before gc: list nodes free: 3003660

after gc: idd nodes used:669452, unused:63330548; list nodes free:296772988
.-> the formula is TRUE

FORMULA Parking-PT-416-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m17.990sec

checking: EF [[EX [AX [[[[p21<=1 & 1<=p21] & [p144<=1 & 1<=p144]] | E [[p66<=1 & 1<=p66] U [p219<=1 & 1<=p219]]]]] & [p44<=1 & 1<=p44]]]
normalized: E [true U [[p44<=1 & 1<=p44] & EX [~ [EX [~ [[E [[p66<=1 & 1<=p66] U [p219<=1 & 1<=p219]] | [[p144<=1 & 1<=p144] & [p21<=1 & 1<=p21]]]]]]]]]

abstracting: (1<=p21)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p21<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p144)
states: 122,326,825,855,195,545,600 (20)
abstracting: (p144<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p219)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p219<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p66)
states: 66,365,818,165,117,583,360 (19)
abstracting: (p66<=1)
states: 4,811,521,816,971,024,793,601 (21)
..abstracting: (1<=p44)
states: 99,548,727,247,676,375,040 (19)
abstracting: (p44<=1)
states: 4,811,521,816,971,024,793,601 (21)
MC time: 4m 5.051sec

checking: EX [EX [[[[p45<=1 & 1<=p45] & [p89<=1 & 1<=p89]] | [EG [[p65<=0 & 0<=p65]] & [[p9<=0 & 0<=p9] | [p205<=0 & 0<=p205]]]]]]
normalized: EX [EX [[[[[p9<=0 & 0<=p9] | [p205<=0 & 0<=p205]] & EG [[p65<=0 & 0<=p65]]] | [[p89<=1 & 1<=p89] & [p45<=1 & 1<=p45]]]]]

abstracting: (1<=p45)
states: 66,365,818,165,117,583,360 (19)
abstracting: (p45<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p89)
states: 1,426,865,090,550,028,042,240 (21)
abstracting: (p89<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (0<=p65)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p65<=0)
states: 4,745,155,998,805,907,210,241 (21)
........
before gc: list nodes free: 4103654

after gc: idd nodes used:150392, unused:63849608; list nodes free:299204676
...................
before gc: list nodes free: 770398

after gc: idd nodes used:812313, unused:63187687; list nodes free:296154963
.......
before gc: list nodes free: 1791201

after gc: idd nodes used:1038589, unused:62961411; list nodes free:295134676
MC time: 3m46.255sec

checking: ~ [A [[[p101<=1 & 1<=p101] | EF [[[p66<=1 & 1<=p66] & [[p162<=1 & 1<=p162] & [p209<=1 & 1<=p209]]]]] U [p65<=1 & 1<=p65]]]
normalized: ~ [[~ [EG [~ [[p65<=1 & 1<=p65]]]] & ~ [E [~ [[p65<=1 & 1<=p65]] U [~ [[E [true U [[[p209<=1 & 1<=p209] & [p162<=1 & 1<=p162]] & [p66<=1 & 1<=p66]]] | [p101<=1 & 1<=p101]]] & ~ [[p65<=1 & 1<=p65]]]]]]]

abstracting: (1<=p65)
states: 66,365,818,165,117,583,360 (19)
abstracting: (p65<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p101)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p101<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p66)
states: 66,365,818,165,117,583,360 (19)
abstracting: (p66<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p162)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p162<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p209)
states: 138,461,059,481,180,569,600 (20)
abstracting: (p209<=1)
states: 4,811,521,816,971,024,793,601 (21)

before gc: list nodes free: 4923173

after gc: idd nodes used:445745, unused:63554255; list nodes free:297891340
MC time: 3m28.050sec

checking: EG [A [[[p121<=1 & 1<=p121] & [p150<=1 & 1<=p150]] U EG [A [[[p51<=1 & 1<=p51] & [[p180<=1 & 1<=p180] & [p215<=1 & 1<=p215]]] U ~ [[p249<=1 & 1<=p249]]]]]]
normalized: EG [[~ [EG [~ [EG [[~ [EG [[p249<=1 & 1<=p249]]] & ~ [E [[p249<=1 & 1<=p249] U [~ [[[[p215<=1 & 1<=p215] & [p180<=1 & 1<=p180]] & [p51<=1 & 1<=p51]]] & [p249<=1 & 1<=p249]]]]]]]]] & ~ [E [~ [EG [[~ [EG [[p249<=1 & 1<=p249]]] & ~ [E [[p249<=1 & 1<=p249] U [~ [[[[p215<=1 & 1<=p215] & [p180<=1 & 1<=p180]] & [p51<=1 & 1<=p51]]] & [p249<=1 & 1<=p249]]]]]]] U [~ [[[p150<=1 & 1<=p150] & [p121<=1 & 1<=p121]]] & ~ [EG [[~ [EG [[p249<=1 & 1<=p249]]] & ~ [E [[p249<=1 & 1<=p249] U [~ [[[[p215<=1 & 1<=p215] & [p180<=1 & 1<=p180]] & [p51<=1 & 1<=p51]]] & [p249<=1 & 1<=p249]]]]]]]]]]]]

abstracting: (1<=p249)
states: 83,678,640,295,148,257,280 (19)
abstracting: (p249<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p51)
states: 99,548,727,247,676,375,040 (19)
abstracting: (p51<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p180)
states: 69,230,529,740,590,284,800 (19)
abstracting: (p180<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p215)
states: 1,419,225,859,682,100,838,400 (21)
abstracting: (p215<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p249)
states: 83,678,640,295,148,257,280 (19)
abstracting: (p249<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p249)
states: 83,678,640,295,148,257,280 (19)
abstracting: (p249<=1)
states: 4,811,521,816,971,024,793,601 (21)
.................................
before gc: list nodes free: 5500779

after gc: idd nodes used:1173727, unused:62826273; list nodes free:294379113
......
before gc: list nodes free: 2402489

after gc: idd nodes used:1560504, unused:62439496; list nodes free:292522128
MC time: 3m12.174sec

checking: EG [EF [[[AX [AF [[p249<=0 & 0<=p249]]] | [[p250<=0 & 0<=p250] & [[p229<=0 & 0<=p229] & [[p109<=0 & 0<=p109] | [[p40<=0 & 0<=p40] | [p76<=0 & 0<=p76]]]]]] | AX [[[p41<=0 & 0<=p41] | [p85<=0 & 0<=p85]]]]]]
normalized: EG [E [true U [~ [EX [~ [[[p85<=0 & 0<=p85] | [p41<=0 & 0<=p41]]]]] | [[[[[[p76<=0 & 0<=p76] | [p40<=0 & 0<=p40]] | [p109<=0 & 0<=p109]] & [p229<=0 & 0<=p229]] & [p250<=0 & 0<=p250]] | ~ [EX [EG [~ [[p249<=0 & 0<=p249]]]]]]]]]

abstracting: (0<=p249)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p249<=0)
states: 4,727,843,176,675,876,536,321 (21)
...................................
before gc: list nodes free: 4779622

after gc: idd nodes used:1297799, unused:62702201; list nodes free:293785716
.MC time: 2m57.070sec

checking: [AX [EG [[[[[p38<=0 & 0<=p38] | [p225<=0 & 0<=p225]] & [p59<=0 & 0<=p59]] | [p65<=0 & 0<=p65]]]] | EG [AG [[[[p12<=0 & 0<=p12] | [[p8<=0 & 0<=p8] & [p59<=0 & 0<=p59]]] & [p157<=0 & 0<=p157]]]]]
normalized: [EG [~ [E [true U ~ [[[[[p59<=0 & 0<=p59] & [p8<=0 & 0<=p8]] | [p12<=0 & 0<=p12]] & [p157<=0 & 0<=p157]]]]]] | ~ [EX [~ [EG [[[p65<=0 & 0<=p65] | [[p59<=0 & 0<=p59] & [[p225<=0 & 0<=p225] | [p38<=0 & 0<=p38]]]]]]]]]

abstracting: (0<=p38)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p38<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p225)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p225<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p59)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p59<=0)
states: 4,745,155,998,805,907,210,241 (21)
abstracting: (0<=p65)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p65<=0)
states: 4,745,155,998,805,907,210,241 (21)
.
EG iterations: 1
.abstracting: (0<=p157)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p157<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p12)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p12<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p8)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p8<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p59)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p59<=0)
states: 4,745,155,998,805,907,210,241 (21)

before gc: list nodes free: 2691485

after gc: idd nodes used:495757, unused:63504243; list nodes free:297590374
.
EG iterations: 1
-> the formula is TRUE

FORMULA Parking-PT-416-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m23.103sec

checking: AF [E [AF [[EX [[[p128<=1 & 1<=p128] & [p149<=1 & 1<=p149]]] & [[p227<=1 & 1<=p227] & EF [[p97<=1 & 1<=p97]]]]] U EG [[[EF [[[p31<=1 & 1<=p31] & [p54<=1 & 1<=p54]]] & ~ [[[p26<=1 & 1<=p26] | [p59<=1 & 1<=p59]]]] & [[p51<=1 & 1<=p51] & [p163<=1 & 1<=p163]]]]]]
normalized: ~ [EG [~ [E [~ [EG [~ [[[E [true U [p97<=1 & 1<=p97]] & [p227<=1 & 1<=p227]] & EX [[[p149<=1 & 1<=p149] & [p128<=1 & 1<=p128]]]]]]] U EG [[[[p163<=1 & 1<=p163] & [p51<=1 & 1<=p51]] & [~ [[[p59<=1 & 1<=p59] | [p26<=1 & 1<=p26]]] & E [true U [[p54<=1 & 1<=p54] & [p31<=1 & 1<=p31]]]]]]]]]]

abstracting: (1<=p31)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p31<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p54)
states: 132,731,636,330,235,166,720 (20)
abstracting: (p54<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p26)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p26<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p59)
states: 66,365,818,165,117,583,360 (19)
abstracting: (p59<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p51)
states: 99,548,727,247,676,375,040 (19)
abstracting: (p51<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p163)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p163<=1)
states: 4,811,521,816,971,024,793,601 (21)
...........................
before gc: list nodes free: 5337328

after gc: idd nodes used:764774, unused:63235226; list nodes free:296427468
MC time: 2m51.064sec

checking: AX [[EX [[[[p157<=0 & 0<=p157] | [p200<=0 & 0<=p200]] | [[p28<=0 & 0<=p28] | [p212<=0 & 0<=p212]]]] & [AX [[[[p117<=0 & 0<=p117] | [p153<=0 & 0<=p153]] & [[p196<=0 & 0<=p196] | [p211<=0 & 0<=p211]]]] | EG [[[p223<=0 & 0<=p223] | [p212<=0 & 0<=p212]]]]]]
normalized: ~ [EX [~ [[[EG [[[p212<=0 & 0<=p212] | [p223<=0 & 0<=p223]]] | ~ [EX [~ [[[[p211<=0 & 0<=p211] | [p196<=0 & 0<=p196]] & [[p153<=0 & 0<=p153] | [p117<=0 & 0<=p117]]]]]]] & EX [[[[p212<=0 & 0<=p212] | [p28<=0 & 0<=p28]] | [[p200<=0 & 0<=p200] | [p157<=0 & 0<=p157]]]]]]]]

abstracting: (0<=p157)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p157<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p200)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p200<=0)
states: 4,673,060,757,489,844,224,001 (21)
abstracting: (0<=p28)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p28<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p212)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p212<=0)
states: 3,773,063,870,862,170,521,601 (21)
.abstracting: (0<=p117)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p117<=0)
states: 4,729,970,599,734,227,763,201 (21)
abstracting: (0<=p153)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p153<=0)
states: 3,098,946,254,998,287,155,201 (21)
abstracting: (0<=p196)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p196<=0)
states: 692,305,297,405,902,848,001 (20)
abstracting: (0<=p211)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p211<=0)
states: 4,673,060,757,489,844,224,001 (21)
.abstracting: (0<=p223)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p223<=0)
states: 2,405,760,908,485,512,396,801 (21)
abstracting: (0<=p212)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p212<=0)
states: 3,773,063,870,862,170,521,601 (21)
.
EG iterations: 1
.-> the formula is TRUE

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

MC time: 0m 4.116sec

checking: EX [AG [[[~ [E [E [[p185<=1 & 1<=p185] U [p18<=1 & 1<=p18]] U [[p99<=1 & 1<=p99] & [[p21<=1 & 1<=p21] & [p144<=1 & 1<=p144]]]]] | [p255<=1 & 1<=p255]] | [[p257<=0 & 0<=p257] | [[p276<=0 & 0<=p276] | [[p61<=1 & 1<=p61] & [p89<=1 & 1<=p89]]]]]]]
normalized: EX [~ [E [true U ~ [[[[[[p89<=1 & 1<=p89] & [p61<=1 & 1<=p61]] | [p276<=0 & 0<=p276]] | [p257<=0 & 0<=p257]] | [[p255<=1 & 1<=p255] | ~ [E [E [[p185<=1 & 1<=p185] U [p18<=1 & 1<=p18]] U [[[p144<=1 & 1<=p144] & [p21<=1 & 1<=p21]] & [p99<=1 & 1<=p99]]]]]]]]]]

abstracting: (1<=p99)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p99<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p21)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p21<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p144)
states: 122,326,825,855,195,545,600 (20)
abstracting: (p144<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p18)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p18<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p185)
states: 69,230,529,740,590,284,800 (19)
abstracting: (p185<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p255)
states: 83,678,640,295,148,257,280 (19)
abstracting: (p255<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (0<=p257)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p257<=0)
states: 4,686,003,856,528,302,407,681 (21)
abstracting: (0<=p276)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (p276<=0)
states: 3,096,109,690,920,485,519,361 (21)
abstracting: (1<=p61)
states: 132,731,636,330,235,166,720 (20)
abstracting: (p61<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p89)
states: 1,426,865,090,550,028,042,240 (21)
abstracting: (p89<=1)
states: 4,811,521,816,971,024,793,601 (21)
MC time: 2m50.022sec

checking: E [E [EX [[EF [[[p243<=1 & 1<=p243] & [p276<=1 & 1<=p276]]] & ~ [AG [[p103<=1 & 1<=p103]]]]] U [~ [AF [[[[p14<=1 & 1<=p14] & [p197<=1 & 1<=p197]] | [[p191<=1 & 1<=p191] & [p215<=1 & 1<=p215]]]]] | [[p10<=1 & 1<=p10] & [[[p231<=1 & 1<=p231] | [[p40<=1 & 1<=p40] | [[p59<=1 & 1<=p59] & [[p229<=1 & 1<=p229] & [p253<=1 & 1<=p253]]]]] & [[p51<=1 & 1<=p51] | [[[p236<=1 & 1<=p236] & [p276<=1 & 1<=p276]] | [[p161<=1 & 1<=p161] & [p201<=1 & 1<=p201]]]]]]]] U [p34<=1 & 1<=p34]]
normalized: E [E [EX [[E [true U ~ [[p103<=1 & 1<=p103]]] & E [true U [[p276<=1 & 1<=p276] & [p243<=1 & 1<=p243]]]]] U [[[[[[[p201<=1 & 1<=p201] & [p161<=1 & 1<=p161]] | [[p276<=1 & 1<=p276] & [p236<=1 & 1<=p236]]] | [p51<=1 & 1<=p51]] & [[[[[p253<=1 & 1<=p253] & [p229<=1 & 1<=p229]] & [p59<=1 & 1<=p59]] | [p40<=1 & 1<=p40]] | [p231<=1 & 1<=p231]]] & [p10<=1 & 1<=p10]] | EG [~ [[[[p215<=1 & 1<=p215] & [p191<=1 & 1<=p191]] | [[p197<=1 & 1<=p197] & [p14<=1 & 1<=p14]]]]]]] U [p34<=1 & 1<=p34]]

abstracting: (1<=p34)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p34<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p14)
states: 2,405,760,908,485,512,396,800 (21)
abstracting: (p14<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p197)
states: 138,461,059,481,180,569,600 (20)
abstracting: (p197<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p191)
states: 69,230,529,740,590,284,800 (19)
abstracting: (p191<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p215)
states: 1,419,225,859,682,100,838,400 (21)
abstracting: (p215<=1)
states: 4,811,521,816,971,024,793,601 (21)
...............
before gc: list nodes free: 4271172

after gc: idd nodes used:576006, unused:63423994; list nodes free:297247083
..........MC time: 2m35.023sec

checking: A [[E [EG [~ [[p249<=1 & 1<=p249]]] U ~ [[EG [[p26<=1 & 1<=p26]] | [[p131<=1 & 1<=p131] | ~ [[p109<=1 & 1<=p109]]]]]] & EX [AG [[AX [[p18<=1 & 1<=p18]] & [p227<=1 & 1<=p227]]]]] U [E [AG [[EF [[[p41<=1 & 1<=p41] & [p85<=1 & 1<=p85]]] | [[p64<=1 & 1<=p64] & [p89<=1 & 1<=p89]]]] U [[E [AX [[p242<=1 & 1<=p242]] U [[p246<=1 & 1<=p246] & [p273<=1 & 1<=p273]]] | ~ [[p65<=1 & 1<=p65]]] | [[[p237<=1 & 1<=p237] & [p275<=1 & 1<=p275]] | [[p235<=1 & 1<=p235] | [p250<=1 & 1<=p250]]]]] & E [[p131<=1 & 1<=p131] U AG [EF [[p87<=1 & 1<=p87]]]]]]
normalized: [~ [EG [~ [[E [[p131<=1 & 1<=p131] U ~ [E [true U ~ [E [true U [p87<=1 & 1<=p87]]]]]] & E [~ [E [true U ~ [[[[p89<=1 & 1<=p89] & [p64<=1 & 1<=p64]] | E [true U [[p85<=1 & 1<=p85] & [p41<=1 & 1<=p41]]]]]]] U [[[[p250<=1 & 1<=p250] | [p235<=1 & 1<=p235]] | [[p275<=1 & 1<=p275] & [p237<=1 & 1<=p237]]] | [~ [[p65<=1 & 1<=p65]] | E [~ [EX [~ [[p242<=1 & 1<=p242]]]] U [[p273<=1 & 1<=p273] & [p246<=1 & 1<=p246]]]]]]]]]] & ~ [E [~ [[E [[p131<=1 & 1<=p131] U ~ [E [true U ~ [E [true U [p87<=1 & 1<=p87]]]]]] & E [~ [E [true U ~ [[[[p89<=1 & 1<=p89] & [p64<=1 & 1<=p64]] | E [true U [[p85<=1 & 1<=p85] & [p41<=1 & 1<=p41]]]]]]] U [[[[p250<=1 & 1<=p250] | [p235<=1 & 1<=p235]] | [[p275<=1 & 1<=p275] & [p237<=1 & 1<=p237]]] | [~ [[p65<=1 & 1<=p65]] | E [~ [EX [~ [[p242<=1 & 1<=p242]]]] U [[p273<=1 & 1<=p273] & [p246<=1 & 1<=p246]]]]]]]] U [~ [[EX [~ [E [true U ~ [[[p227<=1 & 1<=p227] & ~ [EX [~ [[p18<=1 & 1<=p18]]]]]]]]] & E [EG [~ [[p249<=1 & 1<=p249]]] U ~ [[[~ [[p109<=1 & 1<=p109]] | [p131<=1 & 1<=p131]] | EG [[p26<=1 & 1<=p26]]]]]]] & ~ [[E [[p131<=1 & 1<=p131] U ~ [E [true U ~ [E [true U [p87<=1 & 1<=p87]]]]]] & E [~ [E [true U ~ [[[[p89<=1 & 1<=p89] & [p64<=1 & 1<=p64]] | E [true U [[p85<=1 & 1<=p85] & [p41<=1 & 1<=p41]]]]]]] U [[[[p250<=1 & 1<=p250] | [p235<=1 & 1<=p235]] | [[p275<=1 & 1<=p275] & [p237<=1 & 1<=p237]]] | [~ [[p65<=1 & 1<=p65]] | E [~ [EX [~ [[p242<=1 & 1<=p242]]]] U [[p273<=1 & 1<=p273] & [p246<=1 & 1<=p246]]]]]]]]]]]]

abstracting: (1<=p246)
states: 3,974,735,414,019,542,220,800 (21)
abstracting: (p246<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p273)
states: 125,517,960,442,722,385,920 (20)
abstracting: (p273<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p242)
states: 125,517,960,442,722,385,920 (20)
abstracting: (p242<=1)
states: 4,811,521,816,971,024,793,601 (21)
.abstracting: (1<=p65)
states: 66,365,818,165,117,583,360 (19)
abstracting: (p65<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p237)
states: 125,517,960,442,722,385,920 (20)
abstracting: (p237<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p275)
states: 1,715,412,126,050,539,274,240 (21)
abstracting: (p275<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p235)
states: 125,517,960,442,722,385,920 (20)
abstracting: (p235<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p250)
states: 83,678,640,295,148,257,280 (19)
abstracting: (p250<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p41)
states: 99,548,727,247,676,375,040 (19)
abstracting: (p41<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p85)
states: 4,678,790,180,640,789,626,880 (21)
abstracting: (p85<=1)
states: 4,811,521,816,971,024,793,601 (21)

before gc: list nodes free: 921534

after gc: idd nodes used:282358, unused:63717642; list nodes free:298609651
abstracting: (1<=p64)
states: 66,365,818,165,117,583,360 (19)
abstracting: (p64<=1)
states: 4,811,521,816,971,024,793,601 (21)
abstracting: (1<=p89)
states: 1,426,865,090,550,028,042,240 (21)
abstracting: (p89<=1)
states: 4,811,521,816,971,024,793,601 (21)
MC time: 2m21.004sec

checking: [EF [EG [[p131<=1 & 1<=p131]]] & [EG [[AG [[[p242<=0 & 0<=p242] | [p60<=0 & 0<=p60]]] & [~ [A [[p131<=1 & 1<=p131] U [[p221<=1 & 1<=p221] & [p240<=1 & 1<=p240]]]] | [[p6<=0 & 0<=p6] | [[p44<=0 & 0<=p44] & [[p104<=0 & 0<=p104] | [p134<=0 & 0<=p134]]]]]]] & [EG [[[[[p37<=0 & 0<=p37] | [[p83<=0 & 0<=p83] | [p58<=0 & 0<=p58]]] | [[[p89<=0 & 0<=p89] | [p120<=0 & 0<=p120]] | [[p149<=0 & 0<=p149] | [p179<=0 & 0<=p179]]]] & [[p181<=1 & 1<=p181] & [p214<=1 & 1<=p214]]]] | A [~ [[[p101<=1 & 1<=p101] & [p140<=1 & 1<=p140]]] U [[[p20<=1 & 1<=p20] & [p259<=1 & 1<=p259]] | AX [[[[p55<=1 & 1<=p55] & [p84<=1 & 1<=p84]] | [p256<=1 & 1<=p256]]]]]]]]
normalized: [[[[~ [EG [~ [[~ [EX [~ [[[p256<=1 & 1<=p256] | [[p84<=1 & 1<=p84] & [p55<=1 & 1<=p55]]]]]] | [[p259<=1 & 1<=p259] & [p20<=1 & 1<=p20]]]]]] & ~ [E [~ [[~ [EX [~ [[[p256<=1 & 1<=p256] | [[p84<=1 & 1<=p84] & [p55<=1 & 1<=p55]]]]]] | [[p259<=1 & 1<=p259] & [p20<=1 & 1<=p20]]]] U [[[p140<=1 & 1<=p140] & [p101<=1 & 1<=p101]] & ~ [[~ [EX [~ [[[p256<=1 & 1<=p256] | [[p84<=1 & 1<=p84] & [p55<=1 & 1<=p55]]]]]] | [[p259<=1 & 1<=p259] & [p20<=1 & 1<=p20]]]]]]]] | EG [[[[p214<=1 & 1<=p214] & [p181<=1 & 1<=p181]] & [[[[p179<=0 & 0<=p179] | [p149<=0 & 0<=p149]] | [[p120<=0 & 0<=p120] | [p89<=0 & 0<=p89]]] | [[[p58<=0 & 0<=p58] | [p83<=0 & 0<=p83]] | [p37<=0 & 0<=p37]]]]]] & EG [[[[[[[p134<=0 & 0<=p134] | [p104<=0 & 0<=p104]] & [p44<=0 & 0<=p44]] | [p6<=0 & 0<=p6]] | ~ [[~ [EG [~ [[[p240<=1 & 1<=p240] & [p221<=1 & 1<=p221]]]]] & ~ [E [~ [[[p240<=1 & 1<=p240] & [p221<=1 & 1<=p221]]] U [~ [[p131<=1 & 1<=p131]] & ~ [[[p240<=1 & 1<=p240] & [p221<=1 & 1<=p221]]]]]]]]] & ~ [E [true U ~ [[[p60<=0 & 0<=p60] | [p242<=0 & 0<=p242]]]]]]]] & E [true U EG [[p131<=1 & 1<=p131]]]]

abstracting: (1<=p131)
states: 81,551,217,236,797,030,400 (19)
abstracting: (p131<=1)
states: 4,811,521,816,971,024,793,601 (21)
...............................
before gc: list nodes free: 5323706

after gc: idd nodes used:1154977, unused:62845023; list nodes free:294532613
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5992996 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16099272 kB

BK_TIME_CONFINEMENT_REACHED

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

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


initing FirstDep: 0m 0.000sec


iterations count:6254 (25), effective:481 (1)

initing FirstDep: 0m 0.000sec


iterations count:1238 (5), effective:107 (0)

net_ddint.h:600: Timeout: after 239 sec


iterations count:7962 (32), effective:504 (2)

iterations count:275 (1), effective:4 (0)

iterations count:2812 (11), effective:204 (0)

iterations count:11510 (46), effective:680 (2)

iterations count:3435 (13), effective:218 (0)

sat_reach.icc:155: Timeout: after 244 sec


net_ddint.h:600: Timeout: after 225 sec


sat_reach.icc:155: Timeout: after 207 sec


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

net_ddint.h:600: Timeout: after 191 sec


net_ddint.h:600: Timeout: after 176 sec


iterations count:10445 (42), effective:593 (2)

iterations count:8026 (32), effective:505 (2)

net_ddint.h:600: Timeout: after 170 sec


iterations count:4928 (20), effective:248 (1)

iterations count:14401 (58), effective:1236 (5)

sat_reach.icc:155: Timeout: after 169 sec


net_ddint.h:600: Timeout: after 154 sec


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

iterations count:18656 (75), effective:1393 (5)

sat_reach.icc:155: Timeout: after 140 sec


net_ddint.h:600: Timeout: after 127 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="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-416, 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-167863540900426"
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 [ "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 ;