fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r266-smll-167863540900431
Last Updated
May 14, 2023

About the Execution of Marcie+red for Parking-PT-416

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
10152.451 3600000.00 3630616.00 8398.30 TTTFFTFTTTFTTTTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r266-smll-167863540900431.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900431
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1679046448563

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=ReachabilityFireability
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 09:47:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-17 09:47:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 09:47:32] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2023-03-17 09:47:32] [INFO ] Transformed 305 places.
[2023-03-17 09:47:32] [INFO ] Transformed 433 transitions.
[2023-03-17 09:47:32] [INFO ] Found NUPN structural information;
[2023-03-17 09:47:32] [INFO ] Parsed PT model containing 305 places and 433 transitions and 1289 arcs in 312 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 1014 ms. (steps per millisecond=9 ) properties (out of 16) seen :8
FORMULA Parking-PT-416-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :1
FORMULA Parking-PT-416-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :1
FORMULA Parking-PT-416-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 257 rows 305 cols
[2023-03-17 09:47:34] [INFO ] Computed 76 place invariants in 37 ms
[2023-03-17 09:47:34] [INFO ] [Real]Absence check using 72 positive place invariants in 47 ms returned sat
[2023-03-17 09:47:34] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 09:47:34] [INFO ] After 553ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-17 09:47:35] [INFO ] [Nat]Absence check using 72 positive place invariants in 31 ms returned sat
[2023-03-17 09:47:35] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 09:47:35] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-17 09:47:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2023-03-17 09:47:35] [INFO ] After 434ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-17 09:47:36] [INFO ] Deduced a trap composed of 36 places in 159 ms of which 13 ms to minimize.
[2023-03-17 09:47:36] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
[2023-03-17 09:47:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2023-03-17 09:47:36] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 4 ms to minimize.
[2023-03-17 09:47:36] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2023-03-17 09:47:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2023-03-17 09:47:37] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 1 ms to minimize.
[2023-03-17 09:47:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-17 09:47:37] [INFO ] After 1534ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 551 ms.
[2023-03-17 09:47:37] [INFO ] After 2856ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA Parking-PT-416-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
FORMULA Parking-PT-416-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 110 ms.
Support contains 73 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 304 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 304 transition count 256
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 300 transition count 252
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 35 place count 300 transition count 227
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 60 place count 275 transition count 227
Applied a total of 60 rules in 186 ms. Remains 275 /305 variables (removed 30) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 275/305 places, 227/257 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 4) seen :1
FORMULA Parking-PT-416-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 227 rows 275 cols
[2023-03-17 09:47:38] [INFO ] Computed 76 place invariants in 22 ms
[2023-03-17 09:47:38] [INFO ] [Real]Absence check using 72 positive place invariants in 27 ms returned sat
[2023-03-17 09:47:38] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 09:47:38] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-17 09:47:38] [INFO ] [Nat]Absence check using 72 positive place invariants in 33 ms returned sat
[2023-03-17 09:47:38] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-17 09:47:39] [INFO ] After 393ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-17 09:47:39] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-17 09:47:39] [INFO ] After 255ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-17 09:47:39] [INFO ] Deduced a trap composed of 34 places in 92 ms of which 2 ms to minimize.
[2023-03-17 09:47:40] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2023-03-17 09:47:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-17 09:47:40] [INFO ] After 733ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 320 ms.
[2023-03-17 09:47:40] [INFO ] After 1688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA Parking-PT-416-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 27 ms.
Support contains 70 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 227/227 transitions.
Applied a total of 0 rules in 23 ms. Remains 275 /275 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 275/275 places, 227/227 transitions.
Incomplete random walk after 10000 steps, including 188 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 425250 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :{}
Probabilistic random walk after 425250 steps, saw 68200 distinct states, run finished after 3002 ms. (steps per millisecond=141 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-17 09:47:43] [INFO ] Invariant cache hit.
[2023-03-17 09:47:44] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-17 09:47:44] [INFO ] [Nat]Absence check using 72 positive place invariants in 15 ms returned sat
[2023-03-17 09:47:44] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-17 09:47:44] [INFO ] After 261ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-17 09:47:44] [INFO ] State equation strengthened by 87 read => feed constraints.
[2023-03-17 09:47:44] [INFO ] After 155ms SMT Verify possible using 87 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-17 09:47:44] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2023-03-17 09:47:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2023-03-17 09:47:44] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 220 ms.
[2023-03-17 09:47:45] [INFO ] After 1006ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA Parking-PT-416-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 8 ms.
Support contains 33 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 227/227 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 223
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 271 transition count 222
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 270 transition count 222
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 10 place count 270 transition count 218
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 18 place count 266 transition count 218
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 265 transition count 217
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 265 transition count 217
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 30 place count 260 transition count 212
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 44 place count 260 transition count 198
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 58 place count 246 transition count 198
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 59 place count 246 transition count 197
Applied a total of 59 rules in 109 ms. Remains 246 /275 variables (removed 29) and now considering 197/227 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 110 ms. Remains : 246/275 places, 197/227 transitions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Finished Best-First random walk after 409 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=102 )
FORMULA Parking-PT-416-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.
Total runtime 13131 ms.
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=ReachabilityFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Parking_PT_416
(NrP: 305 NrTr: 433 NrArc: 1289)

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

net check time: 0m 0.000sec

init dd package: 0m 3.386sec


RS generation: 0m19.264sec


-> reachability set: #nodes 110854 (1.1e+05) #states 8,440,470,781,232,316,153,857 (21)



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

checking: EF [IS_FIREABLE [t401]]
normalized: E [true U IS_FIREABLE [t401]]

MC time: 3m44.105sec

checking: EF [IS_FIREABLE [t322]]
normalized: E [true U IS_FIREABLE [t322]]


before gc: list nodes free: 1711980

after gc: idd nodes used:877240, unused:63122760; list nodes free:291678909
MC time: 3m30.000sec

checking: AG [~ [IS_FIREABLE [t131]]]
normalized: ~ [E [true U IS_FIREABLE [t131]]]

MC time: 3m17.004sec

checking: EF [IS_FIREABLE [t329]]
normalized: E [true U IS_FIREABLE [t329]]

MC time: 3m 5.066sec

checking: EF [IS_FIREABLE [t291]]
normalized: E [true U IS_FIREABLE [t291]]


before gc: list nodes free: 2477140

after gc: idd nodes used:192302, unused:63807698; list nodes free:294823552
MC time: 2m53.060sec

checking: EF [IS_FIREABLE [t355]]
normalized: E [true U IS_FIREABLE [t355]]

MC time: 2m42.092sec

checking: EF [IS_FIREABLE [t22]]
normalized: E [true U IS_FIREABLE [t22]]

MC time: 2m32.003sec

checking: AG [~ [IS_FIREABLE [t191]]]
normalized: ~ [E [true U IS_FIREABLE [t191]]]


before gc: list nodes free: 2081002

after gc: idd nodes used:165818, unused:63834182; list nodes free:294950726
MC time: 2m23.023sec

checking: EF [[IS_FIREABLE [t418] | IS_FIREABLE [t202]]]
normalized: E [true U [IS_FIREABLE [t418] | IS_FIREABLE [t202]]]

MC time: 2m14.025sec

checking: EF [[IS_FIREABLE [t391] & IS_FIREABLE [t266]]]
normalized: E [true U [IS_FIREABLE [t391] & IS_FIREABLE [t266]]]

MC time: 2m 5.026sec

checking: EF [[IS_FIREABLE [t72] & ~ [[~ [[~ [IS_FIREABLE [t0]] | ~ [IS_FIREABLE [t162]]]] | IS_FIREABLE [t83]]]]]
normalized: E [true U [IS_FIREABLE [t72] & ~ [[IS_FIREABLE [t83] | ~ [[~ [IS_FIREABLE [t162]] | ~ [IS_FIREABLE [t0]]]]]]]]


before gc: list nodes free: 5482000

after gc: idd nodes used:213647, unused:63786353; list nodes free:294736426
MC time: 1m58.004sec

checking: EF [~ [[IS_FIREABLE [t324] | ~ [[[[IS_FIREABLE [t5] | IS_FIREABLE [t76]] & ~ [[IS_FIREABLE [t388] | IS_FIREABLE [t284]]]] & IS_FIREABLE [t35]]]]]]
normalized: E [true U ~ [[IS_FIREABLE [t324] | ~ [[IS_FIREABLE [t35] & [~ [[IS_FIREABLE [t388] | IS_FIREABLE [t284]]] & [IS_FIREABLE [t5] | IS_FIREABLE [t76]]]]]]]]

MC time: 1m50.039sec

checking: AG [~ [[IS_FIREABLE [t5] | [~ [[~ [[IS_FIREABLE [t376] & ~ [IS_FIREABLE [t239]]]] | IS_FIREABLE [t145]]] & [[IS_FIREABLE [t242] | ~ [[IS_FIREABLE [t11] & IS_FIREABLE [t10]]]] & ~ [[~ [[IS_FIREABLE [t149] & IS_FIREABLE [t236]]] & [[IS_FIREABLE [t264] & IS_FIREABLE [t158]] | ~ [IS_FIREABLE [t175]]]]]]]]]]
normalized: ~ [E [true U [IS_FIREABLE [t5] | [[~ [[[~ [IS_FIREABLE [t175]] | [IS_FIREABLE [t264] & IS_FIREABLE [t158]]] & ~ [[IS_FIREABLE [t149] & IS_FIREABLE [t236]]]]] & [IS_FIREABLE [t242] | ~ [[IS_FIREABLE [t11] & IS_FIREABLE [t10]]]]] & ~ [[IS_FIREABLE [t145] | ~ [[IS_FIREABLE [t376] & ~ [IS_FIREABLE [t239]]]]]]]]]]

MC time: 1m43.004sec

checking: EF [[IS_FIREABLE [t315] & [IS_FIREABLE [t75] & [IS_FIREABLE [t365] & [[~ [IS_FIREABLE [t121]] | [[~ [[IS_FIREABLE [t240] & IS_FIREABLE [t416]]] & [~ [IS_FIREABLE [t29]] | [IS_FIREABLE [t116] & IS_FIREABLE [t341]]]] | ~ [[IS_FIREABLE [t208] & [IS_FIREABLE [t119] & IS_FIREABLE [t281]]]]]] & IS_FIREABLE [t410]]]]]]
normalized: E [true U [IS_FIREABLE [t315] & [IS_FIREABLE [t75] & [IS_FIREABLE [t365] & [IS_FIREABLE [t410] & [[~ [[IS_FIREABLE [t208] & [IS_FIREABLE [t119] & IS_FIREABLE [t281]]]] | [[[IS_FIREABLE [t116] & IS_FIREABLE [t341]] | ~ [IS_FIREABLE [t29]]] & ~ [[IS_FIREABLE [t240] & IS_FIREABLE [t416]]]]] | ~ [IS_FIREABLE [t121]]]]]]]]

-> the formula is FALSE

FORMULA Parking-PT-416-ReachabilityFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.844sec

checking: AG [[~ [[[~ [[[[IS_FIREABLE [t16] & ~ [IS_FIREABLE [t136]]] & IS_FIREABLE [t405]] & [IS_FIREABLE [t26] & IS_FIREABLE [t56]]]] | ~ [IS_FIREABLE [t173]]] & [IS_FIREABLE [t390] & ~ [[~ [[[IS_FIREABLE [t49] & IS_FIREABLE [t87]] | ~ [IS_FIREABLE [t236]]]] & [[[IS_FIREABLE [t157] & IS_FIREABLE [t431]] | [IS_FIREABLE [t428] & IS_FIREABLE [t90]]] | IS_FIREABLE [t432]]]]]]] | [IS_FIREABLE [t399] | ~ [[[[~ [IS_FIREABLE [t251]] | ~ [IS_FIREABLE [t180]]] | IS_FIREABLE [t371]] & ~ [[[IS_FIREABLE [t426] | [[IS_FIREABLE [t361] & IS_FIREABLE [t39]] & IS_FIREABLE [t106]]] | ~ [[[IS_FIREABLE [t168] & IS_FIREABLE [t353]] & ~ [IS_FIREABLE [t5]]]]]]]]]]]
normalized: ~ [E [true U ~ [[[IS_FIREABLE [t399] | ~ [[~ [[~ [[~ [IS_FIREABLE [t5]] & [IS_FIREABLE [t168] & IS_FIREABLE [t353]]]] | [IS_FIREABLE [t426] | [IS_FIREABLE [t106] & [IS_FIREABLE [t361] & IS_FIREABLE [t39]]]]]] & [IS_FIREABLE [t371] | [~ [IS_FIREABLE [t180]] | ~ [IS_FIREABLE [t251]]]]]]] | ~ [[[IS_FIREABLE [t390] & ~ [[[IS_FIREABLE [t432] | [[IS_FIREABLE [t428] & IS_FIREABLE [t90]] | [IS_FIREABLE [t157] & IS_FIREABLE [t431]]]] & ~ [[~ [IS_FIREABLE [t236]] | [IS_FIREABLE [t49] & IS_FIREABLE [t87]]]]]]] & [~ [IS_FIREABLE [t173]] | ~ [[[IS_FIREABLE [t26] & IS_FIREABLE [t56]] & [IS_FIREABLE [t405] & [IS_FIREABLE [t16] & ~ [IS_FIREABLE [t136]]]]]]]]]]]]]


before gc: list nodes free: 4783514

after gc: idd nodes used:467447, unused:63532553; list nodes free:293581066
MC time: 1m46.112sec

checking: EF [[[[[[[[[[IS_FIREABLE [t136] & IS_FIREABLE [t4]] | ~ [IS_FIREABLE [t221]]] | IS_FIREABLE [t375]] & ~ [[IS_FIREABLE [t17] | IS_FIREABLE [t294]]]] | IS_FIREABLE [t64]] & [IS_FIREABLE [t165] | ~ [[[~ [IS_FIREABLE [t202]] & [IS_FIREABLE [t39] & IS_FIREABLE [t140]]] | ~ [IS_FIREABLE [t325]]]]]] & [~ [[~ [[IS_FIREABLE [t275] | [IS_FIREABLE [t137] & IS_FIREABLE [t50]]]] & [~ [[IS_FIREABLE [t86] | IS_FIREABLE [t240]]] & ~ [IS_FIREABLE [t95]]]]] | IS_FIREABLE [t35]]] | IS_FIREABLE [t343]] & [[IS_FIREABLE [t131] | [[[~ [[IS_FIREABLE [t141] & IS_FIREABLE [t230]]] & [IS_FIREABLE [t211] & IS_FIREABLE [t283]]] | [IS_FIREABLE [t179] & ~ [[[IS_FIREABLE [t81] | IS_FIREABLE [t310]] | [IS_FIREABLE [t28] | IS_FIREABLE [t372]]]]]] | [[[~ [IS_FIREABLE [t67]] & IS_FIREABLE [t30]] & [[IS_FIREABLE [t409] & ~ [IS_FIREABLE [t32]]] | [IS_FIREABLE [t312] & [IS_FIREABLE [t261] | IS_FIREABLE [t231]]]]] & IS_FIREABLE [t182]]]] & IS_FIREABLE [t184]]]]
normalized: E [true U [[IS_FIREABLE [t184] & [IS_FIREABLE [t131] | [[IS_FIREABLE [t182] & [[[IS_FIREABLE [t312] & [IS_FIREABLE [t261] | IS_FIREABLE [t231]]] | [IS_FIREABLE [t409] & ~ [IS_FIREABLE [t32]]]] & [IS_FIREABLE [t30] & ~ [IS_FIREABLE [t67]]]]] | [[IS_FIREABLE [t179] & ~ [[[IS_FIREABLE [t28] | IS_FIREABLE [t372]] | [IS_FIREABLE [t81] | IS_FIREABLE [t310]]]]] | [[IS_FIREABLE [t211] & IS_FIREABLE [t283]] & ~ [[IS_FIREABLE [t141] & IS_FIREABLE [t230]]]]]]]] & [IS_FIREABLE [t343] | [[IS_FIREABLE [t35] | ~ [[[~ [IS_FIREABLE [t95]] & ~ [[IS_FIREABLE [t86] | IS_FIREABLE [t240]]]] & ~ [[IS_FIREABLE [t275] | [IS_FIREABLE [t137] & IS_FIREABLE [t50]]]]]]] & [[IS_FIREABLE [t165] | ~ [[~ [IS_FIREABLE [t325]] | [[IS_FIREABLE [t39] & IS_FIREABLE [t140]] & ~ [IS_FIREABLE [t202]]]]]] & [IS_FIREABLE [t64] | [~ [[IS_FIREABLE [t17] | IS_FIREABLE [t294]]] & [IS_FIREABLE [t375] | [~ [IS_FIREABLE [t221]] | [IS_FIREABLE [t136] & IS_FIREABLE [t4]]]]]]]]]]]

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5994812 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098288 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 ReachabilityFireability -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.003sec


iterations count:13242 (30), effective:631 (1)

initing FirstDep: 0m 0.001sec


sat_reach.icc:155: Timeout: after 223 sec


sat_reach.icc:155: Timeout: after 209 sec


sat_reach.icc:155: Timeout: after 196 sec


sat_reach.icc:155: Timeout: after 184 sec


sat_reach.icc:155: Timeout: after 172 sec


sat_reach.icc:155: Timeout: after 161 sec


sat_reach.icc:155: Timeout: after 151 sec


sat_reach.icc:155: Timeout: after 142 sec


sat_reach.icc:155: Timeout: after 133 sec


sat_reach.icc:155: Timeout: after 124 sec


sat_reach.icc:155: Timeout: after 117 sec


sat_reach.icc:155: Timeout: after 109 sec


sat_reach.icc:155: Timeout: after 102 sec


sat_reach.icc:155: Timeout: after 102 sec


sat_reach.icc:155: Timeout: after 95 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="ReachabilityFireability"
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 ReachabilityFireability"
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-167863540900431"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;