fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r285-smll-171654421800044
Last Updated
July 7, 2024

About the Execution of 2023-gold for Parking-PT-208

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
314.235 14795.00 28768.00 488.60 TTTFTTTTTFFTTTTT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654421800044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Parking-PT-208, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421800044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 49K May 18 16:43 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-208-ReachabilityCardinality-2024-00
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-01
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-02
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-03
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-04
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-05
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-06
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-07
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-08
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-09
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-10
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-11
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-12
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-13
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-14
FORMULA_NAME Parking-PT-208-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716841441715

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-208
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-27 20:24:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:24:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:24:04] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2024-05-27 20:24:04] [INFO ] Transformed 137 places.
[2024-05-27 20:24:04] [INFO ] Transformed 201 transitions.
[2024-05-27 20:24:04] [INFO ] Found NUPN structural information;
[2024-05-27 20:24:04] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 192 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
FORMULA Parking-PT-208-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 289 resets, run finished after 650 ms. (steps per millisecond=15 ) properties (out of 14) seen :5
FORMULA Parking-PT-208-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-208-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :1
FORMULA Parking-PT-208-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 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 25 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 28 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 117 rows 137 cols
[2024-05-27 20:24:05] [INFO ] Computed 34 invariants in 18 ms
[2024-05-27 20:24:06] [INFO ] After 383ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2024-05-27 20:24:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 13 ms returned sat
[2024-05-27 20:24:06] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 20:24:06] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2024-05-27 20:24:06] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-27 20:24:06] [INFO ] After 83ms SMT Verify possible using 26 Read/Feed constraints in natural domain returned unsat :5 sat :3
[2024-05-27 20:24:06] [INFO ] After 180ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 76 ms.
[2024-05-27 20:24:06] [INFO ] After 579ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
FORMULA Parking-PT-208-ReachabilityCardinality-2024-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-2024-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-2024-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-2024-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-208-ReachabilityCardinality-2024-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 18 ms.
Support contains 42 out of 137 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 137/137 places, 117/117 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 137 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 136 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 135 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 4 place count 135 transition count 113
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 8 place count 133 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 10 place count 131 transition count 111
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 131 transition count 111
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 128 transition count 108
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 26 place count 128 transition count 100
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 34 place count 120 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 35 place count 120 transition count 100
Applied a total of 35 rules in 85 ms. Remains 120 /137 variables (removed 17) and now considering 100/117 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 120/137 places, 100/117 transitions.
Incomplete random walk after 10000 steps, including 381 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1000482 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :{}
Probabilistic random walk after 1000482 steps, saw 136124 distinct states, run finished after 3003 ms. (steps per millisecond=333 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 100 rows 120 cols
[2024-05-27 20:24:10] [INFO ] Computed 34 invariants in 6 ms
[2024-05-27 20:24:10] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2024-05-27 20:24:10] [INFO ] [Real]Absence check using 32 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:24:10] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:24:10] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2024-05-27 20:24:10] [INFO ] [Nat]Absence check using 32 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-27 20:24:10] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:24:10] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-27 20:24:10] [INFO ] After 57ms SMT Verify possible using 39 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:24:10] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-27 20:24:10] [INFO ] After 374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 4 ms.
Support contains 42 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 100/100 transitions.
Applied a total of 0 rules in 7 ms. Remains 120 /120 variables (removed 0) and now considering 100/100 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 120/120 places, 100/100 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 120 /120 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-27 20:24:10] [INFO ] Invariant cache hit.
[2024-05-27 20:24:10] [INFO ] Implicit Places using invariants in 123 ms returned [3, 6, 7, 8, 9, 29, 36, 58, 62, 69, 70, 82, 90, 97, 103, 117]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 126 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/120 places, 100/100 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 104 transition count 98
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 5 rules applied. Total rules applied 7 place count 102 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 99 transition count 95
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 10 place count 99 transition count 93
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 14 place count 97 transition count 93
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 17 place count 94 transition count 90
Iterating global reduction 3 with 3 rules applied. Total rules applied 20 place count 94 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 92 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 25 place count 92 transition count 87
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 92 transition count 86
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 27 place count 92 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 28 place count 91 transition count 85
Applied a total of 28 rules in 28 ms. Remains 91 /104 variables (removed 13) and now considering 85/100 (removed 15) transitions.
// Phase 1: matrix 85 rows 91 cols
[2024-05-27 20:24:10] [INFO ] Computed 18 invariants in 3 ms
[2024-05-27 20:24:10] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-27 20:24:10] [INFO ] Invariant cache hit.
[2024-05-27 20:24:10] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 20:24:10] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/120 places, 85/100 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 337 ms. Remains : 91/120 places, 85/100 transitions.
Incomplete random walk after 10000 steps, including 396 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1269306 steps, run timeout after 3001 ms. (steps per millisecond=422 ) properties seen :{}
Probabilistic random walk after 1269306 steps, saw 189475 distinct states, run finished after 3001 ms. (steps per millisecond=422 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-27 20:24:14] [INFO ] Invariant cache hit.
[2024-05-27 20:24:14] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-27 20:24:14] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:24:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-27 20:24:14] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:24:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 20:24:14] [INFO ] After 40ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:24:14] [INFO ] After 96ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 36 ms.
[2024-05-27 20:24:14] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 42 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 91/91 places, 85/85 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 85/85 transitions.
Applied a total of 0 rules in 4 ms. Remains 91 /91 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2024-05-27 20:24:14] [INFO ] Invariant cache hit.
[2024-05-27 20:24:14] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-27 20:24:14] [INFO ] Invariant cache hit.
[2024-05-27 20:24:14] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-05-27 20:24:14] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-27 20:24:14] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:24:14] [INFO ] Invariant cache hit.
[2024-05-27 20:24:14] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 259 ms. Remains : 91/91 places, 85/85 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 84
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 5 place count 90 transition count 81
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 10 place count 87 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 86 transition count 79
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 11 place count 86 transition count 74
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 21 place count 81 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 23 place count 80 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 24 place count 80 transition count 72
Applied a total of 24 rules in 12 ms. Remains 80 /91 variables (removed 11) and now considering 72/85 (removed 13) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 72 rows 80 cols
[2024-05-27 20:24:14] [INFO ] Computed 18 invariants in 1 ms
[2024-05-27 20:24:14] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2024-05-27 20:24:14] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-27 20:24:14] [INFO ] [Nat]Absence check using 18 positive place invariants in 6 ms returned sat
[2024-05-27 20:24:14] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-27 20:24:14] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 41 ms.
[2024-05-27 20:24:15] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-27 20:24:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-27 20:24:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 91 places, 85 transitions and 273 arcs took 1 ms.
[2024-05-27 20:24:15] [INFO ] Flatten gal took : 42 ms
Total runtime 11109 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Parking-PT-208
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA Parking-PT-208-ReachabilityCardinality-2024-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Parking-PT-208-ReachabilityCardinality-2024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Parking-PT-208-ReachabilityCardinality-2024-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716841456510

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 18 (type EXCL) for 0 Parking-PT-208-ReachabilityCardinality-2024-05
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 Parking-PT-208-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 Parking-PT-208-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 24 (type SRCH) for 3 Parking-PT-208-ReachabilityCardinality-2024-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 12 (type FNDP) for Parking-PT-208-ReachabilityCardinality-2024-10
lola: result : true
lola: fired transitions : 240
lola: tried executions : 17
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 13 (type EQUN) for Parking-PT-208-ReachabilityCardinality-2024-10 (obsolete)
lola: CANCELED task # 24 (type SRCH) for Parking-PT-208-ReachabilityCardinality-2024-10 (obsolete)
lola: LAUNCH task # 14 (type FNDP) for 6 Parking-PT-208-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type EQUN) for 6 Parking-PT-208-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 6 Parking-PT-208-ReachabilityCardinality-2024-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 24 (type SRCH) for Parking-PT-208-ReachabilityCardinality-2024-10
lola: result : true
lola: markings : 147
lola: fired transitions : 220
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 18 (type EXCL) for Parking-PT-208-ReachabilityCardinality-2024-05
lola: result : true
lola: markings : 2222
lola: fired transitions : 3189
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 22 (type EXCL) for 6 Parking-PT-208-ReachabilityCardinality-2024-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 14 (type FNDP) for Parking-PT-208-ReachabilityCardinality-2024-12
lola: result : true
lola: fired transitions : 8
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 21 (type SRCH) for Parking-PT-208-ReachabilityCardinality-2024-12
lola: result : true
lola: markings : 10
lola: fired transitions : 9
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 15 (type EQUN) for Parking-PT-208-ReachabilityCardinality-2024-12 (obsolete)
lola: CANCELED task # 22 (type EXCL) for Parking-PT-208-ReachabilityCardinality-2024-12 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Parking-PT-208-ReachabilityCardinality-2024-05: EF true tandem / relaxed
Parking-PT-208-ReachabilityCardinality-2024-10: AG false findpath
Parking-PT-208-ReachabilityCardinality-2024-12: EF true findpath


Time elapsed: 0 secs. Pages in use: 2

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-208"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Parking-PT-208, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r285-smll-171654421800044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-208.tgz
mv Parking-PT-208 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;