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-158987853400559.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853400559
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1591154923771

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 03:28:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 03:28:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 03:28:46] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2020-06-03 03:28:46] [INFO ] Transformed 1185 places.
[2020-06-03 03:28:46] [INFO ] Transformed 1697 transitions.
[2020-06-03 03:28:46] [INFO ] Found NUPN structural information;
[2020-06-03 03:28:46] [INFO ] Parsed PT model containing 1185 places and 1697 transitions in 211 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 39 resets, run finished after 184 ms. (steps per millisecond=54 ) properties seen :[1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1]
FORMULA Parking-PT-864-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-864-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 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 48 ms. (steps per millisecond=208 ) 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 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1009 rows 1185 cols
[2020-06-03 03:28:46] [INFO ] Computed 280 place invariants in 79 ms
[2020-06-03 03:28:47] [INFO ] [Real]Absence check using 272 positive place invariants in 287 ms returned sat
[2020-06-03 03:28:47] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:50] [INFO ] [Real]Absence check using state equation in 2959 ms returned sat
[2020-06-03 03:28:50] [INFO ] State equation strengthened by 248 read => feed constraints.
[2020-06-03 03:28:50] [INFO ] [Real]Added 248 Read/Feed constraints in 68 ms returned sat
[2020-06-03 03:28:51] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 75 ms.
[2020-06-03 03:28:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:28:51] [INFO ] [Nat]Absence check using 272 positive place invariants in 312 ms returned sat
[2020-06-03 03:28:51] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 9 ms returned sat
[2020-06-03 03:28:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:55] [INFO ] [Nat]Absence check using state equation in 3179 ms returned sat
[2020-06-03 03:28:55] [INFO ] [Nat]Added 248 Read/Feed constraints in 43 ms returned sat
[2020-06-03 03:28:55] [INFO ] Deduced a trap composed of 68 places in 125 ms
[2020-06-03 03:28:55] [INFO ] Deduced a trap composed of 60 places in 60 ms
[2020-06-03 03:28:55] [INFO ] Deduced a trap composed of 68 places in 63 ms
[2020-06-03 03:28:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 460 ms
[2020-06-03 03:28:55] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 64 ms.
[2020-06-03 03:28:56] [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: Stream closed (=> (> t40 0) (and (> t449 0) (< o449 o40)))") while checking expression at index 0
[2020-06-03 03:28:56] [INFO ] [Real]Absence check using 272 positive place invariants in 242 ms returned sat
[2020-06-03 03:28:56] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 9 ms returned sat
[2020-06-03 03:28:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:28:59] [INFO ] [Real]Absence check using state equation in 2913 ms returned sat
[2020-06-03 03:28:59] [INFO ] [Real]Added 248 Read/Feed constraints in 40 ms returned sat
[2020-06-03 03:29:00] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 132 ms.
[2020-06-03 03:29:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:29:00] [INFO ] [Nat]Absence check using 272 positive place invariants in 218 ms returned sat
[2020-06-03 03:29:00] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 10 ms returned sat
[2020-06-03 03:29:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:03] [INFO ] [Nat]Absence check using state equation in 3040 ms returned sat
[2020-06-03 03:29:03] [INFO ] [Nat]Added 248 Read/Feed constraints in 37 ms returned sat
[2020-06-03 03:29:03] [INFO ] Deduced a trap composed of 60 places in 160 ms
[2020-06-03 03:29:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 274 ms
[2020-06-03 03:29:04] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 83 ms.
[2020-06-03 03:29:05] [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 (=> (> t66 0) (or (and (> t0 0) (< o0 o66)) (and (> t661 0) (< o661 o66))))") while checking expression at index 1
[2020-06-03 03:29:05] [INFO ] [Real]Absence check using 272 positive place invariants in 228 ms returned sat
[2020-06-03 03:29:05] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 13 ms returned sat
[2020-06-03 03:29:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:08] [INFO ] [Real]Absence check using state equation in 2949 ms returned sat
[2020-06-03 03:29:08] [INFO ] [Real]Added 248 Read/Feed constraints in 61 ms returned sat
[2020-06-03 03:29:09] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 99 ms.
[2020-06-03 03:29:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:29:10] [INFO ] [Nat]Absence check using 272 positive place invariants in 669 ms returned sat
[2020-06-03 03:29:10] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:13] [INFO ] [Nat]Absence check using state equation in 2789 ms returned sat
[2020-06-03 03:29:13] [INFO ] [Nat]Added 248 Read/Feed constraints in 62 ms returned sat
[2020-06-03 03:29:14] [INFO ] Deduced a trap composed of 60 places in 1315 ms
[2020-06-03 03:29:14] [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: Stream closed (> (+ s0 s150 s151 s158 s159 s161 s162 s166 s167 s169 s170 s174 s175 s182 s183 s190 s191 s193 s194 s198 s199 s201 s202 s206 s207 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s241 s243 s245 s246) 0)") while checking expression at index 2
[2020-06-03 03:29:15] [INFO ] [Real]Absence check using 272 positive place invariants in 212 ms returned sat
[2020-06-03 03:29:15] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 6 ms returned sat
[2020-06-03 03:29:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:17] [INFO ] [Real]Absence check using state equation in 2646 ms returned sat
[2020-06-03 03:29:17] [INFO ] [Real]Added 248 Read/Feed constraints in 56 ms returned sat
[2020-06-03 03:29:17] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 105 ms.
[2020-06-03 03:29:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:29:18] [INFO ] [Nat]Absence check using 272 positive place invariants in 204 ms returned sat
[2020-06-03 03:29:18] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:29:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:21] [INFO ] [Nat]Absence check using state equation in 2873 ms returned sat
[2020-06-03 03:29:21] [INFO ] [Nat]Added 248 Read/Feed constraints in 73 ms returned sat
[2020-06-03 03:29:21] [INFO ] Deduced a trap composed of 60 places in 98 ms
[2020-06-03 03:29:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2020-06-03 03:29:21] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 54 ms.
[2020-06-03 03:29:23] [INFO ] Added : 105 causal constraints over 21 iterations in 1496 ms. Result :(error "Failed to check-sat")
[2020-06-03 03:29:23] [INFO ] [Real]Absence check using 272 positive place invariants in 221 ms returned sat
[2020-06-03 03:29:23] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 41 ms returned sat
[2020-06-03 03:29:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:26] [INFO ] [Real]Absence check using state equation in 2718 ms returned sat
[2020-06-03 03:29:26] [INFO ] [Real]Added 248 Read/Feed constraints in 51 ms returned sat
[2020-06-03 03:29:26] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 58 ms.
[2020-06-03 03:29:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:29:27] [INFO ] [Nat]Absence check using 272 positive place invariants in 199 ms returned sat
[2020-06-03 03:29:27] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 23 ms returned sat
[2020-06-03 03:29:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:31] [INFO ] [Nat]Absence check using state equation in 4609 ms returned (error "Failed to check-sat")
[2020-06-03 03:29:32] [INFO ] [Real]Absence check using 272 positive place invariants in 305 ms returned sat
[2020-06-03 03:29:32] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 11 ms returned sat
[2020-06-03 03:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:34] [INFO ] [Real]Absence check using state equation in 2735 ms returned sat
[2020-06-03 03:29:35] [INFO ] [Real]Added 248 Read/Feed constraints in 31 ms returned sat
[2020-06-03 03:29:35] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 53 ms.
[2020-06-03 03:29:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:29:35] [INFO ] [Nat]Absence check using 272 positive place invariants in 260 ms returned sat
[2020-06-03 03:29:35] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:38] [INFO ] [Nat]Absence check using state equation in 2962 ms returned sat
[2020-06-03 03:29:38] [INFO ] [Nat]Added 248 Read/Feed constraints in 60 ms returned sat
[2020-06-03 03:29:39] [INFO ] Deduced a trap composed of 60 places in 80 ms
[2020-06-03 03:29:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2020-06-03 03:29:39] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 92 ms.
[2020-06-03 03:29:40] [INFO ] Added : 65 causal constraints over 13 iterations in 1257 ms. Result :unknown
[2020-06-03 03:29:40] [INFO ] [Real]Absence check using 272 positive place invariants in 221 ms returned sat
[2020-06-03 03:29:40] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:29:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:43] [INFO ] [Real]Absence check using state equation in 2832 ms returned sat
[2020-06-03 03:29:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:29:44] [INFO ] [Nat]Absence check using 272 positive place invariants in 199 ms returned sat
[2020-06-03 03:29:44] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 7 ms returned sat
[2020-06-03 03:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:29:46] [INFO ] [Nat]Absence check using state equation in 2810 ms returned sat
[2020-06-03 03:29:47] [INFO ] [Nat]Added 248 Read/Feed constraints in 49 ms returned sat
[2020-06-03 03:29:47] [INFO ] Deduced a trap composed of 68 places in 126 ms
[2020-06-03 03:29:47] [INFO ] Deduced a trap composed of 75 places in 49 ms
[2020-06-03 03:29:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2020-06-03 03:29:47] [INFO ] Computed and/alt/rep : 1008/4080/1008 causal constraints in 52 ms.
[2020-06-03 03:29:48] [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 (=> (> t117 0) (and (> t118 0) (< o118 o117)))") while checking expression at index 6
[2020-06-03 03:29:49] [INFO ] [Real]Absence check using 272 positive place invariants in 191 ms returned sat
[2020-06-03 03:29:49] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 4 ms returned unsat
FORMULA Parking-PT-864-ReachabilityFireability-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 113900 steps, including 332 resets, run finished after 1520 ms. (steps per millisecond=74 ) properties seen :[0, 1, 1, 0, 0, 0, 0] could not realise parikh vector
FORMULA Parking-PT-864-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-864-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 32 out of 1185 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1185 transition count 982
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1158 transition count 982
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 54 place count 1158 transition count 956
Deduced a syphon composed of 26 places in 5 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 106 place count 1132 transition count 956
Symmetric choice reduction at 2 with 8 rule applications. Total rules 114 place count 1132 transition count 956
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 130 place count 1124 transition count 948
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 198 place count 1090 transition count 914
Free-agglomeration rule applied 179 times.
Iterating global reduction 2 with 179 rules applied. Total rules applied 377 place count 1090 transition count 735
Reduce places removed 179 places and 0 transitions.
Iterating post reduction 2 with 179 rules applied. Total rules applied 556 place count 911 transition count 735
Applied a total of 556 rules in 587 ms. Remains 911 /1185 variables (removed 274) and now considering 735/1009 (removed 274) transitions.
Finished structural reductions, in 1 iterations. Remains : 911/1185 places, 735/1009 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 5933 ms. (steps per millisecond=168 ) properties seen :[0, 0, 0, 1, 0]
FORMULA Parking-PT-864-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3822 ms. (steps per millisecond=261 ) properties seen :[1, 0, 0, 0]
FORMULA Parking-PT-864-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 3721 ms. (steps per millisecond=268 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3712 ms. (steps per millisecond=269 ) properties seen :[0, 1, 0]
FORMULA Parking-PT-864-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 3769 ms. (steps per millisecond=265 ) properties seen :[0, 0]
// Phase 1: matrix 735 rows 911 cols
[2020-06-03 03:30:12] [INFO ] Computed 280 place invariants in 10 ms
[2020-06-03 03:30:13] [INFO ] [Real]Absence check using 272 positive place invariants in 555 ms returned sat
[2020-06-03 03:30:13] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 30 ms returned sat
[2020-06-03 03:30:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:15] [INFO ] [Real]Absence check using state equation in 1834 ms returned sat
[2020-06-03 03:30:15] [INFO ] State equation strengthened by 483 read => feed constraints.
[2020-06-03 03:30:15] [INFO ] [Real]Added 483 Read/Feed constraints in 36 ms returned sat
[2020-06-03 03:30:15] [INFO ] Computed and/alt/rep : 734/3224/734 causal constraints in 74 ms.
[2020-06-03 03:30:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:30:15] [INFO ] [Nat]Absence check using 272 positive place invariants in 165 ms returned sat
[2020-06-03 03:30:15] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 10 ms returned sat
[2020-06-03 03:30:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:17] [INFO ] [Nat]Absence check using state equation in 1652 ms returned sat
[2020-06-03 03:30:17] [INFO ] [Nat]Added 483 Read/Feed constraints in 45 ms returned sat
[2020-06-03 03:30:17] [INFO ] Computed and/alt/rep : 734/3224/734 causal constraints in 43 ms.
[2020-06-03 03:30:26] [INFO ] Added : 734 causal constraints over 147 iterations in 9264 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 49 ms.
[2020-06-03 03:30:27] [INFO ] [Real]Absence check using 272 positive place invariants in 236 ms returned sat
[2020-06-03 03:30:27] [INFO ] [Real]Absence check using 272 positive and 8 generalized place invariants in 8 ms returned sat
[2020-06-03 03:30:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:28] [INFO ] [Real]Absence check using state equation in 1599 ms returned sat
[2020-06-03 03:30:29] [INFO ] [Real]Added 483 Read/Feed constraints in 83 ms returned sat
[2020-06-03 03:30:29] [INFO ] Computed and/alt/rep : 734/3224/734 causal constraints in 39 ms.
[2020-06-03 03:30:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:30:29] [INFO ] [Nat]Absence check using 272 positive place invariants in 167 ms returned sat
[2020-06-03 03:30:29] [INFO ] [Nat]Absence check using 272 positive and 8 generalized place invariants in 5 ms returned sat
[2020-06-03 03:30:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:31] [INFO ] [Nat]Absence check using state equation in 1634 ms returned sat
[2020-06-03 03:30:31] [INFO ] [Nat]Added 483 Read/Feed constraints in 55 ms returned sat
[2020-06-03 03:30:31] [INFO ] Computed and/alt/rep : 734/3224/734 causal constraints in 34 ms.
[2020-06-03 03:30:41] [INFO ] Added : 734 causal constraints over 147 iterations in 10198 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 42 ms.
Incomplete Parikh walk after 100100 steps, including 269 resets, run finished after 796 ms. (steps per millisecond=125 ) properties seen :[0, 0] could not realise parikh vector
Incomplete Parikh walk after 99800 steps, including 280 resets, run finished after 755 ms. (steps per millisecond=132 ) properties seen :[0, 0] could not realise parikh vector
Support contains 10 out of 911 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 911/911 places, 735/735 transitions.
Discarding 322 places :
Also discarding 241 output transitions
Drop transitions removed 241 transitions
Graph (complete) has 1945 edges and 911 vertex of which 589 are kept as prefixes of interest. Removing 322 places using SCC suffix rule.8 ms
Drop transitions removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 589 transition count 463
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 588 transition count 463
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 33 place count 588 transition count 462
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 587 transition count 462
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 585 transition count 460
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 47 place count 585 transition count 452
Reduce places removed 8 places and 0 transitions.
Discarding 109 places :
Also discarding 80 output transitions
Drop transitions removed 80 transitions
Graph (complete) has 1207 edges and 577 vertex of which 468 are kept as prefixes of interest. Removing 109 places using SCC suffix rule.1 ms
Iterating post reduction 2 with 9 rules applied. Total rules applied 56 place count 468 transition count 372
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 64 place count 468 transition count 364
Applied a total of 64 rules in 79 ms. Remains 468 /911 variables (removed 443) and now considering 364/735 (removed 371) transitions.
Finished structural reductions, in 1 iterations. Remains : 468/911 places, 364/735 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 2798 ms. (steps per millisecond=357 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2381 ms. (steps per millisecond=419 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 2443 ms. (steps per millisecond=409 ) properties seen :[0, 1]
FORMULA Parking-PT-864-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 364 rows 468 cols
[2020-06-03 03:30:50] [INFO ] Computed 156 place invariants in 4 ms
[2020-06-03 03:30:51] [INFO ] [Real]Absence check using 152 positive place invariants in 125 ms returned sat
[2020-06-03 03:30:51] [INFO ] [Real]Absence check using 152 positive and 4 generalized place invariants in 9 ms returned sat
[2020-06-03 03:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:52] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2020-06-03 03:30:52] [INFO ] State equation strengthened by 245 read => feed constraints.
[2020-06-03 03:30:52] [INFO ] [Real]Added 245 Read/Feed constraints in 18 ms returned sat
[2020-06-03 03:30:52] [INFO ] Computed and/alt/rep : 363/1575/363 causal constraints in 16 ms.
[2020-06-03 03:30:52] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:30:52] [INFO ] [Nat]Absence check using 152 positive place invariants in 66 ms returned sat
[2020-06-03 03:30:52] [INFO ] [Nat]Absence check using 152 positive and 4 generalized place invariants in 7 ms returned sat
[2020-06-03 03:30:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:30:52] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2020-06-03 03:30:52] [INFO ] [Nat]Added 245 Read/Feed constraints in 32 ms returned sat
[2020-06-03 03:30:52] [INFO ] Computed and/alt/rep : 363/1575/363 causal constraints in 16 ms.
[2020-06-03 03:30:54] [INFO ] Added : 363 causal constraints over 73 iterations in 1989 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
Incomplete Parikh walk after 51400 steps, including 288 resets, run finished after 211 ms. (steps per millisecond=243 ) properties seen :[0] could not realise parikh vector
Support contains 3 out of 468 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 468/468 places, 364/364 transitions.
Discarding 229 places :
Also discarding 173 output transitions
Drop transitions removed 173 transitions
Graph (complete) has 978 edges and 468 vertex of which 239 are kept as prefixes of interest. Removing 229 places using SCC suffix rule.1 ms
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 239 transition count 182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 238 transition count 182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 238 transition count 181
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 237 transition count 181
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 2 with 2 rules applied. Total rules applied 15 place count 236 transition count 180
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 236 transition count 179
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 235 transition count 179
Applied a total of 17 rules in 33 ms. Remains 235 /468 variables (removed 233) and now considering 179/364 (removed 185) transitions.
Finished structural reductions, in 1 iterations. Remains : 235/468 places, 179/364 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1666 ms. (steps per millisecond=600 ) properties seen :[0]
Finished Best-First random walk after 2460 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=615 )
FORMULA Parking-PT-864-ReachabilityFireability-06 TRUE 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="ReachabilityFireability"
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 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 r174-csrt-158987853400559"
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 [ "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 ;