Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700319.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 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 itstools
Input is Parking-PT-416, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 5.8K Apr 30 06:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 30 06:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 05:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 05:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 06:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 30 06:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 30 06:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 30 06:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 107K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-416-ReachabilityFireability-00
FORMULA_NAME Parking-PT-416-ReachabilityFireability-01
FORMULA_NAME Parking-PT-416-ReachabilityFireability-02
FORMULA_NAME Parking-PT-416-ReachabilityFireability-03
FORMULA_NAME Parking-PT-416-ReachabilityFireability-04
FORMULA_NAME Parking-PT-416-ReachabilityFireability-05
FORMULA_NAME Parking-PT-416-ReachabilityFireability-06
FORMULA_NAME Parking-PT-416-ReachabilityFireability-07
FORMULA_NAME Parking-PT-416-ReachabilityFireability-08
FORMULA_NAME Parking-PT-416-ReachabilityFireability-09
FORMULA_NAME Parking-PT-416-ReachabilityFireability-10
FORMULA_NAME Parking-PT-416-ReachabilityFireability-11
FORMULA_NAME Parking-PT-416-ReachabilityFireability-12
FORMULA_NAME Parking-PT-416-ReachabilityFireability-13
FORMULA_NAME Parking-PT-416-ReachabilityFireability-14
FORMULA_NAME Parking-PT-416-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654249809979

Running Version 202205111006
[2022-06-03 09:50:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-03 09:50:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-03 09:50:13] [INFO ] Load time of PNML (sax parser for PT used): 285 ms
[2022-06-03 09:50:13] [INFO ] Transformed 305 places.
[2022-06-03 09:50:13] [INFO ] Transformed 433 transitions.
[2022-06-03 09:50:13] [INFO ] Found NUPN structural information;
[2022-06-03 09:50:13] [INFO ] Parsed PT model containing 305 places and 433 transitions in 541 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 176 transitions
Reduce redundant transitions removed 176 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 1195 ms. (steps per millisecond=8 ) properties (out of 16) seen :7
FORMULA Parking-PT-416-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Parking-PT-416-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 9) seen :1
FORMULA Parking-PT-416-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 257 rows 305 cols
[2022-06-03 09:50:15] [INFO ] Computed 76 place invariants in 25 ms
[2022-06-03 09:50:16] [INFO ] [Real]Absence check using 72 positive place invariants in 54 ms returned sat
[2022-06-03 09:50:16] [INFO ] [Real]Absence check using 72 positive and 4 generalized place invariants in 5 ms returned sat
[2022-06-03 09:50:16] [INFO ] After 700ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:7
[2022-06-03 09:50:16] [INFO ] [Nat]Absence check using 72 positive place invariants in 42 ms returned sat
[2022-06-03 09:50:16] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-03 09:50:16] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2022-06-03 09:50:16] [INFO ] State equation strengthened by 60 read => feed constraints.
[2022-06-03 09:50:17] [INFO ] After 317ms SMT Verify possible using 60 Read/Feed constraints in natural domain returned unsat :3 sat :5
[2022-06-03 09:50:17] [INFO ] After 805ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :5
Attempting to minimize the solution found.
Minimization took 505 ms.
[2022-06-03 09:50:18] [INFO ] After 2277ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :5
FORMULA Parking-PT-416-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-416-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Parking-PT-416-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 5 different solutions.
FORMULA Parking-PT-416-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Parking-PT-416-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 2 properties in 1827 ms.
Support contains 64 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 303 transition count 255
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 303 transition count 255
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 14 place count 298 transition count 250
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 37 place count 298 transition count 227
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 60 place count 275 transition count 227
Applied a total of 60 rules in 107 ms. Remains 275 /305 variables (removed 30) and now considering 227/257 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 275/305 places, 227/257 transitions.
Incomplete random walk after 1000000 steps, including 17399 resets, run finished after 17862 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1196 resets, run finished after 3911 ms. (steps per millisecond=255 ) properties (out of 3) seen :1
FORMULA Parking-PT-416-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 1170 resets, run finished after 3502 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1182 resets, run finished after 3786 ms. (steps per millisecond=264 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 227 rows 275 cols
[2022-06-03 09:50:49] [INFO ] Computed 76 place invariants in 7 ms
[2022-06-03 09:50:49] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 09:50:49] [INFO ] [Nat]Absence check using 72 positive place invariants in 33 ms returned sat
[2022-06-03 09:50:49] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 3 ms returned sat
[2022-06-03 09:50:49] [INFO ] After 294ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 09:50:49] [INFO ] State equation strengthened by 83 read => feed constraints.
[2022-06-03 09:50:50] [INFO ] After 147ms SMT Verify possible using 83 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 09:50:50] [INFO ] After 323ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 147 ms.
[2022-06-03 09:50:50] [INFO ] After 958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 333 ms.
Support contains 45 out of 275 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 275/275 places, 227/227 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 275 transition count 225
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 273 transition count 225
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 273 transition count 222
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 270 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 269 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 269 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 265 transition count 217
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 265 transition count 211
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 32 place count 259 transition count 211
Applied a total of 32 rules in 101 ms. Remains 259 /275 variables (removed 16) and now considering 211/227 (removed 16) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/275 places, 211/227 transitions.
Incomplete random walk after 1000000 steps, including 13187 resets, run finished after 11338 ms. (steps per millisecond=88 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1269 resets, run finished after 3663 ms. (steps per millisecond=273 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1296 resets, run finished after 3328 ms. (steps per millisecond=300 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 9832505 steps, run timeout after 54001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 9832505 steps, saw 1215851 distinct states, run finished after 54004 ms. (steps per millisecond=182 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 211 rows 259 cols
[2022-06-03 09:52:03] [INFO ] Computed 76 place invariants in 4 ms
[2022-06-03 09:52:03] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 09:52:03] [INFO ] [Nat]Absence check using 72 positive place invariants in 22 ms returned sat
[2022-06-03 09:52:03] [INFO ] [Nat]Absence check using 72 positive and 4 generalized place invariants in 2 ms returned sat
[2022-06-03 09:52:03] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 09:52:03] [INFO ] State equation strengthened by 103 read => feed constraints.
[2022-06-03 09:52:03] [INFO ] After 136ms SMT Verify possible using 103 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 09:52:03] [INFO ] After 312ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 170 ms.
[2022-06-03 09:52:04] [INFO ] After 767ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 241 ms.
Support contains 45 out of 259 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 211/211 transitions.
Applied a total of 0 rules in 25 ms. Remains 259 /259 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 259/259 places, 211/211 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 259/259 places, 211/211 transitions.
Applied a total of 0 rules in 19 ms. Remains 259 /259 variables (removed 0) and now considering 211/211 (removed 0) transitions.
// Phase 1: matrix 211 rows 259 cols
[2022-06-03 09:52:04] [INFO ] Computed 76 place invariants in 5 ms
[2022-06-03 09:52:04] [INFO ] Implicit Places using invariants in 570 ms returned [1, 8, 11, 16, 21, 26, 27, 30, 31, 38, 45, 53, 61, 77, 79, 80, 81, 82, 83, 84, 87, 88, 97, 104, 112, 120, 136, 138, 142, 147, 148, 149, 150, 159, 172, 178, 194, 196, 197, 198, 199, 200, 201, 202, 205, 206, 213, 221, 229, 236, 252, 254]
Discarding 52 places :
Implicit Place search using SMT only with invariants took 575 ms to find 52 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 207/259 places, 211/211 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 207 transition count 167
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 50 rules applied. Total rules applied 94 place count 163 transition count 161
Reduce places removed 4 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 10 rules applied. Total rules applied 104 place count 159 transition count 155
Reduce places removed 6 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 3 with 8 rules applied. Total rules applied 112 place count 153 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 113 place count 152 transition count 153
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 13 Pre rules applied. Total rules applied 113 place count 152 transition count 140
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 139 place count 139 transition count 140
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 151 place count 127 transition count 128
Iterating global reduction 5 with 12 rules applied. Total rules applied 163 place count 127 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 164 place count 126 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 165 place count 126 transition count 127
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 166 place count 125 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 167 place count 125 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 168 place count 124 transition count 124
Iterating global reduction 5 with 1 rules applied. Total rules applied 169 place count 124 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 170 place count 124 transition count 123
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 184 place count 117 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 186 place count 117 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 188 place count 116 transition count 125
Free-agglomeration rule applied 9 times.
Iterating global reduction 7 with 9 rules applied. Total rules applied 197 place count 116 transition count 116
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 7 with 9 rules applied. Total rules applied 206 place count 107 transition count 116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 207 place count 107 transition count 115
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 208 place count 107 transition count 114
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 210 place count 106 transition count 113
Applied a total of 210 rules in 97 ms. Remains 106 /207 variables (removed 101) and now considering 113/211 (removed 98) transitions.
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:52:05] [INFO ] Computed 24 place invariants in 3 ms
[2022-06-03 09:52:05] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:52:05] [INFO ] Computed 24 place invariants in 2 ms
[2022-06-03 09:52:05] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 09:52:05] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 106/259 places, 113/211 transitions.
Finished structural reductions, in 2 iterations. Remains : 106/259 places, 113/211 transitions.
Incomplete random walk after 1000000 steps, including 17979 resets, run finished after 10865 ms. (steps per millisecond=92 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3790 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1664 resets, run finished after 2574 ms. (steps per millisecond=388 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 17874235 steps, run timeout after 51001 ms. (steps per millisecond=350 ) properties seen :{}
Probabilistic random walk after 17874235 steps, saw 2065773 distinct states, run finished after 51002 ms. (steps per millisecond=350 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:53:13] [INFO ] Computed 24 place invariants in 4 ms
[2022-06-03 09:53:13] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 09:53:13] [INFO ] [Nat]Absence check using 24 positive place invariants in 11 ms returned sat
[2022-06-03 09:53:13] [INFO ] After 129ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 09:53:13] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 09:53:13] [INFO ] After 79ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 09:53:13] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 62 ms.
[2022-06-03 09:53:13] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 181 ms.
Support contains 45 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 113/113 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 113/113 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:53:14] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-03 09:53:14] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:53:14] [INFO ] Computed 24 place invariants in 4 ms
[2022-06-03 09:53:14] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 09:53:14] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2022-06-03 09:53:14] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:53:14] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-03 09:53:14] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 113/113 transitions.
Incomplete random walk after 1000000 steps, including 17965 resets, run finished after 9846 ms. (steps per millisecond=101 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 4151 ms. (steps per millisecond=240 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1652 resets, run finished after 2723 ms. (steps per millisecond=367 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 19040085 steps, run timeout after 48001 ms. (steps per millisecond=396 ) properties seen :{}
Probabilistic random walk after 19040085 steps, saw 2184603 distinct states, run finished after 48001 ms. (steps per millisecond=396 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:54:19] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-03 09:54:19] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 09:54:19] [INFO ] [Nat]Absence check using 24 positive place invariants in 7 ms returned sat
[2022-06-03 09:54:19] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 09:54:19] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 09:54:19] [INFO ] After 49ms SMT Verify possible using 28 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-03 09:54:19] [INFO ] After 99ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-03 09:54:19] [INFO ] After 283ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 141 ms.
Support contains 45 out of 106 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 113/113 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 113/113 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 106/106 places, 113/113 transitions.
Applied a total of 0 rules in 8 ms. Remains 106 /106 variables (removed 0) and now considering 113/113 (removed 0) transitions.
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:54:19] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-03 09:54:19] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:54:19] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-03 09:54:20] [INFO ] State equation strengthened by 28 read => feed constraints.
[2022-06-03 09:54:20] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2022-06-03 09:54:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 113 rows 106 cols
[2022-06-03 09:54:20] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-03 09:54:20] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 106/106 places, 113/113 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 106 transition count 111
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 104 transition count 109
Reduce places removed 2 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 4 rules applied. Total rules applied 10 place count 102 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 101 transition count 107
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 11 place count 101 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 19 place count 97 transition count 103
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 21 place count 96 transition count 102
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 22 place count 96 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 95 transition count 101
Applied a total of 23 rules in 18 ms. Remains 95 /106 variables (removed 11) and now considering 101/113 (removed 12) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 101 rows 95 cols
[2022-06-03 09:54:20] [INFO ] Computed 24 place invariants in 1 ms
[2022-06-03 09:54:20] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-03 09:54:20] [INFO ] [Nat]Absence check using 24 positive place invariants in 6 ms returned sat
[2022-06-03 09:54:20] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-03 09:54:20] [INFO ] After 116ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2022-06-03 09:54:20] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2022-06-03 09:54:20] [INFO ] Flatten gal took : 56 ms
[2022-06-03 09:54:20] [INFO ] Flatten gal took : 23 ms
[2022-06-03 09:54:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6280736635751576172.gal : 10 ms
[2022-06-03 09:54:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14255596107061730862.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6280736635751576172.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14255596107061730862.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality14255596107061730862.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :5 after 21
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :21 after 269
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :269 after 2061
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :2061 after 12301
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :12301 after 106521
Reachability property Parking-PT-416-ReachabilityFireability-10 is true.
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :106521 after 1.2247e+06
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1.2247e+06 after 3.49307e+07
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.49307e+07 after 3.49307e+08
Detected timeout of ITS tools.
[2022-06-03 09:54:35] [INFO ] Flatten gal took : 16 ms
[2022-06-03 09:54:35] [INFO ] Applying decomposition
[2022-06-03 09:54:35] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17730447163774799463.txt' '-o' '/tmp/graph17730447163774799463.bin' '-w' '/tmp/graph17730447163774799463.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17730447163774799463.bin' '-l' '-1' '-v' '-w' '/tmp/graph17730447163774799463.weights' '-q' '0' '-e' '0.001'
[2022-06-03 09:54:36] [INFO ] Decomposing Gal with order
[2022-06-03 09:54:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 09:54:36] [INFO ] Removed a total of 97 redundant transitions.
[2022-06-03 09:54:36] [INFO ] Flatten gal took : 72 ms
[2022-06-03 09:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 10 ms.
[2022-06-03 09:54:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9209817539857955201.gal : 5 ms
[2022-06-03 09:54:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2491686281072888653.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9209817539857955201.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2491686281072888653.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityCardinality2491686281072888653.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
Invariant property Parking-PT-416-ReachabilityFireability-11 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 17 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.51437e+07,0.031447,4916,111,31,738,274,285,836,71,588,0
Total reachable state count : 35143681

Verifying 1 reachability properties.
Invariant property Parking-PT-416-ReachabilityFireability-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-416-ReachabilityFireability-11,55296,0.035021,4916,79,23,738,274,403,836,89,588,0
[2022-06-03 09:54:36] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9493772535507942893
[2022-06-03 09:54:36] [INFO ] Applying decomposition
[2022-06-03 09:54:36] [INFO ] Flatten gal took : 28 ms
[2022-06-03 09:54:36] [INFO ] Computing symmetric may disable matrix : 113 transitions.
[2022-06-03 09:54:36] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 09:54:36] [INFO ] Computing symmetric may enable matrix : 113 transitions.
[2022-06-03 09:54:36] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 09:54:36] [INFO ] Flatten gal took : 32 ms
[2022-06-03 09:54:36] [INFO ] Input system was already deterministic with 113 transitions.
[2022-06-03 09:54:36] [INFO ] Computing Do-Not-Accords matrix : 113 transitions.
[2022-06-03 09:54:36] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-06-03 09:54:36] [INFO ] Built C files in 68ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9493772535507942893
Running compilation step : cd /tmp/ltsmin9493772535507942893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15651151938574301521.txt' '-o' '/tmp/graph15651151938574301521.bin' '-w' '/tmp/graph15651151938574301521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15651151938574301521.bin' '-l' '-1' '-v' '-w' '/tmp/graph15651151938574301521.weights' '-q' '0' '-e' '0.001'
[2022-06-03 09:54:36] [INFO ] Decomposing Gal with order
[2022-06-03 09:54:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-03 09:54:36] [INFO ] Removed a total of 75 redundant transitions.
[2022-06-03 09:54:36] [INFO ] Flatten gal took : 27 ms
[2022-06-03 09:54:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2022-06-03 09:54:36] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability4330120391068717701.gal : 6 ms
[2022-06-03 09:54:36] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability2738402787874043293.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability4330120391068717701.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability2738402787874043293.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
[2022-06-03 09:54:36] [INFO ] Ran tautology test, simplified 0 / 2 in 197 ms.
Loading property file /tmp/ReachabilityFireability2738402787874043293.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 4481
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :4481 after 7169
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :7169 after 28673
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28673 after 41217
[2022-06-03 09:54:36] [INFO ] BMC solution for property Parking-PT-416-ReachabilityFireability-10(UNSAT) depth K=0 took 12 ms
[2022-06-03 09:54:36] [INFO ] BMC solution for property Parking-PT-416-ReachabilityFireability-11(UNSAT) depth K=0 took 7 ms
Reachability property Parking-PT-416-ReachabilityFireability-10 is true.
FORMULA Parking-PT-416-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :41217 after 1.45687e+08
[2022-06-03 09:54:36] [INFO ] BMC solution for property Parking-PT-416-ReachabilityFireability-11(UNSAT) depth K=1 took 7 ms
Invariant property Parking-PT-416-ReachabilityFireability-11 does not hold.
FORMULA Parking-PT-416-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 65 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,6.00637e+09,0.062516,5224,126,81,1292,1539,325,1274,120,2918,0
Total reachable state count : 6006374401

Verifying 2 reachability properties.
Reachability property Parking-PT-416-ReachabilityFireability-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-416-ReachabilityFireability-10,655360,0.067491,5224,67,38,1292,1539,428,1274,137,2918,0
Invariant property Parking-PT-416-ReachabilityFireability-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Parking-PT-416-ReachabilityFireability-11,3.072e+06,0.073281,5224,78,55,1292,1539,535,1274,144,2918,0
[2022-06-03 09:54:36] [WARNING] Interrupting SMT solver.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-06-03 09:54:36] [WARNING] Script execution failed on command (declare-fun s () (Array Int (Array Int Int))) with error
[2022-06-03 09:54:36] [WARNING] Script execution failed on command (define-fun _enabledsrc__0 ((src (Array Int Int))) Bool (>= (select src 105) 1)) with error (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Exception in thread "Thread-11" java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Stream closed")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:60)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd.runKInduction(Gal2SMTFrontEnd.java:283)
at fr.lip6.move.gal.gal2smt.Gal2SMTFrontEnd$2.run(Gal2SMTFrontEnd.java:171)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-03 09:54:36] [INFO ] SMT solved 0/ 2 properties. Interrupting SMT analysis.
Total runtime 264069 ms.

BK_STOP 1654250076678

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-416"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is Parking-PT-416, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r150-smll-165276998700319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-416.tgz
mv Parking-PT-416 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;