Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r166-smll-158987787700415.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is AutoFlight-PT-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-158987787700415
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 3.0K Mar 25 23:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 25 23:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 25 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Apr 8 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 14:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 25 14:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 25 10:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 10:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 25 17:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 25 17:54 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 70K 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 AutoFlight-PT-03b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-03b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591465561566

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-06 17:46:04] [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-06 17:46:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-06 17:46:04] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2020-06-06 17:46:04] [INFO ] Transformed 298 places.
[2020-06-06 17:46:04] [INFO ] Transformed 296 transitions.
[2020-06-06 17:46:04] [INFO ] Found NUPN structural information;
[2020-06-06 17:46:04] [INFO ] Parsed PT model containing 298 places and 296 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 62 resets, run finished after 120 ms. (steps per millisecond=83 ) properties seen :[0, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0]
FORMULA AutoFlight-PT-03b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 1, 0, 0, 0, 0, 0, 0]
FORMULA AutoFlight-PT-03b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 25 ms. (steps per millisecond=400 ) properties seen :[0, 0, 1, 0, 0, 0, 0]
FORMULA AutoFlight-PT-03b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 1, 0]
FORMULA AutoFlight-PT-03b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 296 rows 298 cols
[2020-06-06 17:46:05] [INFO ] Computed 22 place invariants in 17 ms
[2020-06-06 17:46:05] [INFO ] [Real]Absence check using 21 positive place invariants in 35 ms returned sat
[2020-06-06 17:46:05] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 17:46:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:05] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2020-06-06 17:46:06] [INFO ] Deduced a trap composed of 62 places in 293 ms
[2020-06-06 17:46:06] [INFO ] Deduced a trap composed of 68 places in 206 ms
[2020-06-06 17:46:06] [INFO ] Deduced a trap composed of 55 places in 172 ms
[2020-06-06 17:46:06] [INFO ] Deduced a trap composed of 59 places in 181 ms
[2020-06-06 17:46:07] [INFO ] Deduced a trap composed of 56 places in 195 ms
[2020-06-06 17:46:07] [INFO ] Deduced a trap composed of 56 places in 186 ms
[2020-06-06 17:46:07] [INFO ] Deduced a trap composed of 53 places in 154 ms
[2020-06-06 17:46:07] [INFO ] Deduced a trap composed of 54 places in 155 ms
[2020-06-06 17:46:07] [INFO ] Deduced a trap composed of 52 places in 167 ms
[2020-06-06 17:46:08] [INFO ] Deduced a trap composed of 58 places in 174 ms
[2020-06-06 17:46:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2176 ms
[2020-06-06 17:46:08] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:46:08] [INFO ] [Nat]Absence check using 21 positive place invariants in 147 ms returned sat
[2020-06-06 17:46:08] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2020-06-06 17:46:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:08] [INFO ] [Nat]Absence check using state equation in 445 ms returned sat
[2020-06-06 17:46:09] [INFO ] Deduced a trap composed of 62 places in 213 ms
[2020-06-06 17:46:09] [INFO ] Deduced a trap composed of 68 places in 163 ms
[2020-06-06 17:46:09] [INFO ] Deduced a trap composed of 55 places in 174 ms
[2020-06-06 17:46:09] [INFO ] Deduced a trap composed of 50 places in 209 ms
[2020-06-06 17:46:09] [INFO ] Deduced a trap composed of 56 places in 187 ms
[2020-06-06 17:46:10] [INFO ] Deduced a trap composed of 41 places in 208 ms
[2020-06-06 17:46:10] [INFO ] Deduced a trap composed of 54 places in 187 ms
[2020-06-06 17:46:10] [INFO ] Deduced a trap composed of 51 places in 163 ms
[2020-06-06 17:46:10] [INFO ] Deduced a trap composed of 50 places in 185 ms
[2020-06-06 17:46:11] [INFO ] Deduced a trap composed of 54 places in 188 ms
[2020-06-06 17:46:11] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2144 ms
[2020-06-06 17:46:11] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints in 34 ms.
[2020-06-06 17:46:12] [INFO ] Added : 261 causal constraints over 53 iterations in 1942 ms. Result :sat
[2020-06-06 17:46:13] [INFO ] Deduced a trap composed of 40 places in 83 ms
[2020-06-06 17:46:13] [INFO ] Deduced a trap composed of 33 places in 71 ms
[2020-06-06 17:46:13] [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 s1 s2 s3 s4 s5 s6 s7 s8 s9 s117 s118 s120 s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s228 s229 s230 s231 s232 s233 s234) 0)") while checking expression at index 0
[2020-06-06 17:46:13] [INFO ] [Real]Absence check using 21 positive place invariants in 37 ms returned sat
[2020-06-06 17:46:13] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 17:46:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:13] [INFO ] [Real]Absence check using state equation in 383 ms returned sat
[2020-06-06 17:46:13] [INFO ] Deduced a trap composed of 41 places in 152 ms
[2020-06-06 17:46:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 166 ms
[2020-06-06 17:46:14] [INFO ] [Real]Absence check using 21 positive place invariants in 32 ms returned sat
[2020-06-06 17:46:14] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 17:46:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:14] [INFO ] [Real]Absence check using state equation in 379 ms returned sat
[2020-06-06 17:46:14] [INFO ] Deduced a trap composed of 45 places in 104 ms
[2020-06-06 17:46:14] [INFO ] Deduced a trap composed of 46 places in 121 ms
[2020-06-06 17:46:14] [INFO ] Deduced a trap composed of 40 places in 109 ms
[2020-06-06 17:46:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 408 ms
[2020-06-06 17:46:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:46:15] [INFO ] [Nat]Absence check using 21 positive place invariants in 303 ms returned sat
[2020-06-06 17:46:15] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 17:46:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:15] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2020-06-06 17:46:15] [INFO ] Deduced a trap composed of 45 places in 91 ms
[2020-06-06 17:46:15] [INFO ] Deduced a trap composed of 46 places in 149 ms
[2020-06-06 17:46:15] [INFO ] Deduced a trap composed of 40 places in 129 ms
[2020-06-06 17:46:15] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 438 ms
[2020-06-06 17:46:15] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints in 20 ms.
[2020-06-06 17:46:17] [INFO ] Added : 294 causal constraints over 60 iterations in 1458 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2020-06-06 17:46:17] [INFO ] [Real]Absence check using 21 positive place invariants in 23 ms returned sat
[2020-06-06 17:46:17] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2020-06-06 17:46:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:17] [INFO ] [Real]Absence check using state equation in 357 ms returned sat
[2020-06-06 17:46:18] [INFO ] Deduced a trap composed of 45 places in 153 ms
[2020-06-06 17:46:18] [INFO ] Deduced a trap composed of 38 places in 170 ms
[2020-06-06 17:46:18] [INFO ] Deduced a trap composed of 64 places in 139 ms
[2020-06-06 17:46:18] [INFO ] Deduced a trap composed of 33 places in 145 ms
[2020-06-06 17:46:18] [INFO ] Deduced a trap composed of 46 places in 143 ms
[2020-06-06 17:46:18] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-06-06 17:46:19] [INFO ] Deduced a trap composed of 44 places in 147 ms
[2020-06-06 17:46:19] [INFO ] Deduced a trap composed of 37 places in 129 ms
[2020-06-06 17:46:19] [INFO ] Deduced a trap composed of 31 places in 110 ms
[2020-06-06 17:46:19] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2020-06-06 17:46:19] [INFO ] Deduced a trap composed of 46 places in 107 ms
[2020-06-06 17:46:19] [INFO ] Deduced a trap composed of 24 places in 95 ms
[2020-06-06 17:46:19] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1793 ms
[2020-06-06 17:46:19] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:46:20] [INFO ] [Nat]Absence check using 21 positive place invariants in 203 ms returned sat
[2020-06-06 17:46:20] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2020-06-06 17:46:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:20] [INFO ] [Nat]Absence check using state equation in 447 ms returned sat
[2020-06-06 17:46:20] [INFO ] Deduced a trap composed of 45 places in 175 ms
[2020-06-06 17:46:20] [INFO ] Deduced a trap composed of 38 places in 163 ms
[2020-06-06 17:46:21] [INFO ] Deduced a trap composed of 64 places in 160 ms
[2020-06-06 17:46:21] [INFO ] Deduced a trap composed of 33 places in 154 ms
[2020-06-06 17:46:21] [INFO ] Deduced a trap composed of 46 places in 144 ms
[2020-06-06 17:46:21] [INFO ] Deduced a trap composed of 25 places in 135 ms
[2020-06-06 17:46:21] [INFO ] Deduced a trap composed of 44 places in 133 ms
[2020-06-06 17:46:21] [INFO ] Deduced a trap composed of 37 places in 126 ms
[2020-06-06 17:46:21] [INFO ] Deduced a trap composed of 31 places in 126 ms
[2020-06-06 17:46:22] [INFO ] Deduced a trap composed of 32 places in 115 ms
[2020-06-06 17:46:22] [INFO ] Deduced a trap composed of 46 places in 113 ms
[2020-06-06 17:46:22] [INFO ] Deduced a trap composed of 24 places in 111 ms
[2020-06-06 17:46:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1915 ms
[2020-06-06 17:46:22] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints in 35 ms.
[2020-06-06 17:46:24] [INFO ] Added : 279 causal constraints over 56 iterations in 2100 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2020-06-06 17:46:24] [INFO ] [Real]Absence check using 21 positive place invariants in 36 ms returned sat
[2020-06-06 17:46:24] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 17:46:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:25] [INFO ] [Real]Absence check using state equation in 515 ms returned sat
[2020-06-06 17:46:25] [INFO ] Deduced a trap composed of 41 places in 166 ms
[2020-06-06 17:46:25] [INFO ] Deduced a trap composed of 25 places in 165 ms
[2020-06-06 17:46:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 395 ms
[2020-06-06 17:46:25] [INFO ] Solution in real domain found non-integer solution.
[2020-06-06 17:46:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 101 ms returned sat
[2020-06-06 17:46:25] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 4 ms returned sat
[2020-06-06 17:46:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-06 17:46:26] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2020-06-06 17:46:26] [INFO ] Deduced a trap composed of 41 places in 167 ms
[2020-06-06 17:46:26] [INFO ] Deduced a trap composed of 25 places in 169 ms
[2020-06-06 17:46:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 408 ms
[2020-06-06 17:46:26] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints in 35 ms.
[2020-06-06 17:46:29] [INFO ] Added : 295 causal constraints over 60 iterations in 2360 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
FORMULA AutoFlight-PT-03b-ReachabilityFireability-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 34500 steps, including 184 resets, run finished after 242 ms. (steps per millisecond=142 ) properties seen :[0, 0, 1, 0] could not realise parikh vector
FORMULA AutoFlight-PT-03b-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 35300 steps, including 224 resets, run finished after 129 ms. (steps per millisecond=273 ) properties seen :[0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 40500 steps, including 212 resets, run finished after 106 ms. (steps per millisecond=382 ) properties seen :[0, 0, 0] could not realise parikh vector
Support contains 16 out of 298 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 298/298 places, 296/296 transitions.
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 298 transition count 193
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 116 rules applied. Total rules applied 219 place count 195 transition count 180
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 221 place count 193 transition count 180
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 221 place count 193 transition count 140
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 301 place count 153 transition count 140
Symmetric choice reduction at 3 with 28 rule applications. Total rules 329 place count 153 transition count 140
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 385 place count 125 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 386 place count 125 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 386 place count 125 transition count 105
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 398 place count 119 transition count 105
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 452 place count 92 transition count 78
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 454 place count 91 transition count 78
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 462 place count 91 transition count 70
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 470 place count 83 transition count 70
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 472 place count 83 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 473 place count 83 transition count 69
Symmetric choice reduction at 6 with 1 rule applications. Total rules 474 place count 83 transition count 69
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 476 place count 82 transition count 68
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 477 place count 81 transition count 67
Reduce places removed 8 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 6 with 12 rules applied. Total rules applied 489 place count 73 transition count 63
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 493 place count 69 transition count 63
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 8 Pre rules applied. Total rules applied 493 place count 69 transition count 55
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 8 with 16 rules applied. Total rules applied 509 place count 61 transition count 55
Applied a total of 509 rules in 119 ms. Remains 61 /298 variables (removed 237) and now considering 55/296 (removed 241) transitions.
Finished structural reductions, in 1 iterations. Remains : 61/298 places, 55/296 transitions.
Incomplete random walk after 1000000 steps, including 38383 resets, run finished after 2132 ms. (steps per millisecond=469 ) properties seen :[1, 0, 1]
FORMULA AutoFlight-PT-03b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Finished Best-First random walk after 24949 steps, including 154 resets, run visited all 1 properties in 21 ms. (steps per millisecond=1188 )
FORMULA AutoFlight-PT-03b-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="AutoFlight-PT-03b"
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 AutoFlight-PT-03b, 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 r166-smll-158987787700415"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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