fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853400558
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.400 3600000.00 114970.00 93.80 FFFTFFFFTTFTFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853400558.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is Parking-PT-864, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853400558
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 3.1K Apr 12 00:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 00:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 10 23:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 10 23:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 08:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 08:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 9 12:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 9 12:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 10 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 427K Mar 24 05:37 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-864-ReachabilityCardinality-00
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-01
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-02
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-03
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-04
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-05
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-06
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-07
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-08
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-09
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-10
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-11
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-12
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-13
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-14
FORMULA_NAME Parking-PT-864-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591154826948

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:27:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:27:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:27:10] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2020-06-03 03:27:10] [INFO ] Transformed 1185 places.
[2020-06-03 03:27:10] [INFO ] Transformed 1697 transitions.
[2020-06-03 03:27:10] [INFO ] Found NUPN structural information;
[2020-06-03 03:27:10] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 317 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 60 ms.
Working with output stream class java.io.PrintStream
FORMULA Parking-PT-864-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-864-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 39 resets, run finished after 267 ms. (steps per millisecond=37 ) properties seen :[0, 0, 1, 0, 0, 0, 0, 0, 1, 0]
FORMULA Parking-PT-864-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 56 ms. (steps per millisecond=178 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 74 ms. (steps per millisecond=135 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 78 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 66 ms. (steps per millisecond=151 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1009 rows 1185 cols
[2020-06-03 03:27:11] [INFO ] Computed 280 place invariants in 58 ms
[2020-06-03 03:27:11] [INFO ] [Real]Absence check using 272 positive place invariants in 311 ms returned sat
[2020-06-03 03:27:11] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 9 ms returned sat
[2020-06-03 03:27:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:15] [INFO ] [Real]Absence check using state equation in 3245 ms returned sat
[2020-06-03 03:27:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:27:15] [INFO ] [Nat]Absence check using 272 positive place invariants in 262 ms returned sat
[2020-06-03 03:27:15] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:27:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:18] [INFO ] [Nat]Absence check using state equation in 3229 ms returned sat
[2020-06-03 03:27:19] [INFO ] State equation strengthened by 248 read => feed constraints.
[2020-06-03 03:27:19] [INFO ] [Nat]Added 248 Read/Feed constraints in 79 ms returned sat
[2020-06-03 03:27:19] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 157 ms.
[2020-06-03 03:27:20] [INFO ] Added : 35 causal constraints over 7 iterations in 1045 ms. Result :(error "Failed to check-sat")
[2020-06-03 03:27:20] [INFO ] [Real]Absence check using 272 positive place invariants in 221 ms returned sat
[2020-06-03 03:27:20] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 15 ms returned sat
[2020-06-03 03:27:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:23] [INFO ] [Real]Absence check using state equation in 2744 ms returned sat
[2020-06-03 03:27:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:27:23] [INFO ] [Nat]Absence check using 272 positive place invariants in 210 ms returned sat
[2020-06-03 03:27:23] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 15 ms returned sat
[2020-06-03 03:27:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:27] [INFO ] [Nat]Absence check using state equation in 3008 ms returned sat
[2020-06-03 03:27:27] [INFO ] [Nat]Added 248 Read/Feed constraints in 59 ms returned sat
[2020-06-03 03:27:27] [INFO ] Deduced a trap composed of 60 places in 123 ms
[2020-06-03 03:27:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 250 ms
[2020-06-03 03:27:27] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 118 ms.
[2020-06-03 03:27:28] [INFO ] Added : 55 causal constraints over 11 iterations in 1208 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 03:27:29] [INFO ] [Real]Absence check using 272 positive place invariants in 253 ms returned sat
[2020-06-03 03:27:29] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 16 ms returned sat
[2020-06-03 03:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:31] [INFO ] [Real]Absence check using state equation in 2797 ms returned sat
[2020-06-03 03:27:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:27:32] [INFO ] [Nat]Absence check using 272 positive place invariants in 218 ms returned sat
[2020-06-03 03:27:32] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:35] [INFO ] [Nat]Absence check using state equation in 2977 ms returned sat
[2020-06-03 03:27:35] [INFO ] [Nat]Added 248 Read/Feed constraints in 48 ms returned sat
[2020-06-03 03:27:35] [INFO ] Deduced a trap composed of 60 places in 90 ms
[2020-06-03 03:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 185 ms
[2020-06-03 03:27:35] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 141 ms.
[2020-06-03 03:27:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t73 0) (or (and (> t353 0) (< o353 o73)) (and (> t354 0) (< o354 o73)) (and (> t355 0) (< o355 o73)) (and (> t356 0) (< o356 o73))))") while checking expression at index 2
[2020-06-03 03:27:37] [INFO ] [Real]Absence check using 272 positive place invariants in 280 ms returned sat
[2020-06-03 03:27:37] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 11 ms returned sat
[2020-06-03 03:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:41] [INFO ] [Real]Absence check using state equation in 3637 ms returned sat
[2020-06-03 03:27:41] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:27:41] [INFO ] [Nat]Absence check using 272 positive place invariants in 204 ms returned sat
[2020-06-03 03:27:41] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 21 ms returned sat
[2020-06-03 03:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:44] [INFO ] [Nat]Absence check using state equation in 2801 ms returned sat
[2020-06-03 03:27:44] [INFO ] [Nat]Added 248 Read/Feed constraints in 56 ms returned sat
[2020-06-03 03:27:44] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 103 ms.
[2020-06-03 03:27:46] [INFO ] Added : 75 causal constraints over 15 iterations in 1717 ms. Result :(error "Failed to check-sat")
[2020-06-03 03:27:46] [INFO ] [Real]Absence check using 272 positive place invariants in 263 ms returned sat
[2020-06-03 03:27:46] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:50] [INFO ] [Real]Absence check using state equation in 3064 ms returned sat
[2020-06-03 03:27:50] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:27:50] [INFO ] [Nat]Absence check using 272 positive place invariants in 248 ms returned sat
[2020-06-03 03:27:50] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 61 ms returned sat
[2020-06-03 03:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 03:27:55] [INFO ] [Nat]Absence check using state equation in 4537 ms returned (error "Failed to check-sat")
[2020-06-03 03:27:55] [INFO ] [Real]Absence check using 272 positive place invariants in 214 ms returned sat
[2020-06-03 03:27:55] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 14 ms returned sat
[2020-06-03 03:27:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:27:58] [INFO ] [Real]Absence check using state equation in 2979 ms returned sat
[2020-06-03 03:27:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:27:59] [INFO ] [Nat]Absence check using 272 positive place invariants in 267 ms returned sat
[2020-06-03 03:27:59] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:01] [INFO ] [Nat]Absence check using state equation in 2819 ms returned sat
[2020-06-03 03:28:01] [INFO ] [Nat]Added 248 Read/Feed constraints in 51 ms returned sat
[2020-06-03 03:28:02] [INFO ] Deduced a trap composed of 68 places in 129 ms
[2020-06-03 03:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2020-06-03 03:28:02] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 63 ms.
[2020-06-03 03:28:03] [INFO ] Added : 80 causal constraints over 16 iterations in 1484 ms. Result :unknown
[2020-06-03 03:28:04] [INFO ] [Real]Absence check using 272 positive place invariants in 200 ms returned sat
[2020-06-03 03:28:04] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:06] [INFO ] [Real]Absence check using state equation in 2684 ms returned sat
[2020-06-03 03:28:06] [INFO ] [Real]Added 248 Read/Feed constraints in 43 ms returned sat
[2020-06-03 03:28:06] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 92 ms.
[2020-06-03 03:28:07] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:28:08] [INFO ] [Nat]Absence check using 272 positive place invariants in 684 ms returned sat
[2020-06-03 03:28:08] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 23 ms returned sat
[2020-06-03 03:28:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:11] [INFO ] [Nat]Absence check using state equation in 3175 ms returned sat
[2020-06-03 03:28:11] [INFO ] [Nat]Added 248 Read/Feed constraints in 56 ms returned sat
[2020-06-03 03:28:11] [INFO ] Deduced a trap composed of 60 places in 126 ms
[2020-06-03 03:28:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 226 ms
[2020-06-03 03:28:12] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 175 ms.
[2020-06-03 03:28:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t15 0) (and (> t350 0) (< o350 o15)))") while checking expression at index 6
[2020-06-03 03:28:13] [INFO ] [Real]Absence check using 272 positive place invariants in 501 ms returned sat
[2020-06-03 03:28:13] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:28:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:16] [INFO ] [Real]Absence check using state equation in 3274 ms returned sat
[2020-06-03 03:28:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:28:16] [INFO ] [Nat]Absence check using 272 positive place invariants in 195 ms returned sat
[2020-06-03 03:28:17] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 13 ms returned sat
[2020-06-03 03:28:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:19] [INFO ] [Nat]Absence check using state equation in 2879 ms returned sat
[2020-06-03 03:28:19] [INFO ] [Nat]Added 248 Read/Feed constraints in 59 ms returned sat
[2020-06-03 03:28:20] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 149 ms.
[2020-06-03 03:28:21] [INFO ] Added : 80 causal constraints over 16 iterations in 1606 ms. Result :unknown
Incomplete Parikh walk after 118400 steps, including 343 resets, run finished after 1579 ms. (steps per millisecond=74 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0] could not realise parikh vector
FORMULA Parking-PT-864-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 115000 steps, including 335 resets, run finished after 1515 ms. (steps per millisecond=75 ) properties seen :[0, 1, 1, 1, 0, 0, 0] could not realise parikh vector
FORMULA Parking-PT-864-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 10 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1185 transition count 977
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1153 transition count 977
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1153 transition count 945
Deduced a syphon composed of 32 places in 3 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 1121 transition count 945
Symmetric choice reduction at 2 with 7 rule applications. Total rules 135 place count 1121 transition count 945
Deduced a syphon composed of 7 places in 16 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 149 place count 1114 transition count 938
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 10 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 229 place count 1074 transition count 898
Free-agglomeration rule applied 189 times.
Iterating global reduction 2 with 189 rules applied. Total rules applied 418 place count 1074 transition count 709
Reduce places removed 189 places and 0 transitions.
Discarding 208 places :
Also discarding 152 output transitions
Drop transitions removed 152 transitions
Graph (complete) has 1855 edges and 885 vertex of which 677 are kept as prefixes of interest. Removing 208 places using SCC suffix rule.35 ms
Iterating post reduction 2 with 190 rules applied. Total rules applied 608 place count 677 transition count 557
Drop transitions removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 3 with 24 rules applied. Total rules applied 632 place count 677 transition count 533
Applied a total of 632 rules in 667 ms. Remains 677 /1185 variables (removed 508) and now considering 533/1009 (removed 476) transitions.
Finished structural reductions, in 1 iterations. Remains : 677/1185 places, 533/1009 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 4700 ms. (steps per millisecond=212 ) properties seen :[1, 1, 1, 0]
FORMULA Parking-PT-864-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 1197 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=239 )
FORMULA Parking-PT-864-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

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-864"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is Parking-PT-864, 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 r174-csrt-158987853400558"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-864.tgz
mv Parking-PT-864 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 ;