Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037990000447.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 itstools
Input is AutoFlight-PT-05b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000447
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 17K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 165K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Mar 28 15:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 10:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 10:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 113K May 5 16:51 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-05b-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-05b-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620470257203

Running Version 0
[2021-05-08 10:37:39] [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]
[2021-05-08 10:37:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 10:37:39] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2021-05-08 10:37:39] [INFO ] Transformed 482 places.
[2021-05-08 10:37:39] [INFO ] Transformed 480 transitions.
[2021-05-08 10:37:39] [INFO ] Found NUPN structural information;
[2021-05-08 10:37:39] [INFO ] Parsed PT model containing 482 places and 480 transitions in 114 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 40 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 16) seen :9
FORMULA AutoFlight-PT-05b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-05b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 480 rows 482 cols
[2021-05-08 10:37:39] [INFO ] Computed 34 place invariants in 26 ms
[2021-05-08 10:37:39] [INFO ] [Real]Absence check using 33 positive place invariants in 21 ms returned sat
[2021-05-08 10:37:39] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 10:37:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:39] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-08 10:37:39] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:37:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 10:37:39] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:37:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:40] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2021-05-08 10:37:40] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 9 ms to minimize.
[2021-05-08 10:37:40] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 1 ms to minimize.
[2021-05-08 10:37:40] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 1 ms to minimize.
[2021-05-08 10:37:40] [INFO ] Deduced a trap composed of 28 places in 112 ms of which 6 ms to minimize.
[2021-05-08 10:37:40] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2021-05-08 10:37:40] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 1 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 0 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 1 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 0 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 1 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 53 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 0 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 48 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:37:41] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 1 ms to minimize.
[2021-05-08 10:37:42] [INFO ] Deduced a trap composed of 73 places in 80 ms of which 1 ms to minimize.
[2021-05-08 10:37:42] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 0 ms to minimize.
[2021-05-08 10:37:42] [INFO ] Deduced a trap composed of 40 places in 76 ms of which 1 ms to minimize.
[2021-05-08 10:37:42] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2021-05-08 10:37:42] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 2200 ms
[2021-05-08 10:37:42] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 36 ms.
[2021-05-08 10:37:44] [INFO ] Added : 417 causal constraints over 85 iterations in 2287 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 10:37:44] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 10:37:44] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned unsat
[2021-05-08 10:37:44] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-08 10:37:44] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:37:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:44] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2021-05-08 10:37:44] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:37:45] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 10:37:45] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:37:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:45] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 0 ms to minimize.
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 0 ms to minimize.
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 55 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 46 places in 85 ms of which 1 ms to minimize.
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 54 places in 87 ms of which 0 ms to minimize.
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 0 ms to minimize.
[2021-05-08 10:37:45] [INFO ] Deduced a trap composed of 49 places in 75 ms of which 1 ms to minimize.
[2021-05-08 10:37:46] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 0 ms to minimize.
[2021-05-08 10:37:46] [INFO ] Deduced a trap composed of 43 places in 67 ms of which 0 ms to minimize.
[2021-05-08 10:37:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 993 ms
[2021-05-08 10:37:46] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-08 10:37:48] [INFO ] Added : 478 causal constraints over 97 iterations in 2609 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 10:37:48] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 10:37:48] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:49] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2021-05-08 10:37:49] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:37:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 15 ms returned sat
[2021-05-08 10:37:49] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 10:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:49] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2021-05-08 10:37:49] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 0 ms to minimize.
[2021-05-08 10:37:49] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2021-05-08 10:37:49] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 0 ms to minimize.
[2021-05-08 10:37:49] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 6 ms to minimize.
[2021-05-08 10:37:49] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 1 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 0 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 81 places in 86 ms of which 1 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 0 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 68 places in 103 ms of which 0 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 0 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 74 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 0 ms to minimize.
[2021-05-08 10:37:50] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 1 ms to minimize.
[2021-05-08 10:37:51] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 1 ms to minimize.
[2021-05-08 10:37:51] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 0 ms to minimize.
[2021-05-08 10:37:51] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 0 ms to minimize.
[2021-05-08 10:37:51] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 1 ms to minimize.
[2021-05-08 10:37:51] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1957 ms
[2021-05-08 10:37:51] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 30 ms.
[2021-05-08 10:37:53] [INFO ] Added : 445 causal constraints over 90 iterations in 2422 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2021-05-08 10:37:53] [INFO ] [Real]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 10:37:53] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned unsat
[2021-05-08 10:37:54] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2021-05-08 10:37:54] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 10:37:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:54] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2021-05-08 10:37:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 10:37:54] [INFO ] [Nat]Absence check using 33 positive place invariants in 14 ms returned sat
[2021-05-08 10:37:54] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 10:37:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 10:37:54] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2021-05-08 10:37:54] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 0 ms to minimize.
[2021-05-08 10:37:54] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 0 ms to minimize.
[2021-05-08 10:37:54] [INFO ] Deduced a trap composed of 36 places in 83 ms of which 0 ms to minimize.
[2021-05-08 10:37:54] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 0 ms to minimize.
[2021-05-08 10:37:54] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 78 places in 83 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 77 places in 77 ms of which 1 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 44 places in 86 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 71 places in 85 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 63 places in 74 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 73 places in 73 ms of which 1 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 0 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 94 places in 85 ms of which 2 ms to minimize.
[2021-05-08 10:37:55] [INFO ] Deduced a trap composed of 52 places in 72 ms of which 0 ms to minimize.
[2021-05-08 10:37:56] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 2 ms to minimize.
[2021-05-08 10:37:56] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1634 ms
[2021-05-08 10:37:56] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints (skipped 0 transitions) in 28 ms.
[2021-05-08 10:37:58] [INFO ] Added : 468 causal constraints over 94 iterations in 2467 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-05b-ReachabilityFireability-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 42300 steps, including 179 resets, run finished after 195 ms. (steps per millisecond=216 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 58800 steps, including 236 resets, run finished after 209 ms. (steps per millisecond=281 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-05b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 54300 steps, including 228 resets, run finished after 159 ms. (steps per millisecond=341 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 62500 steps, including 247 resets, run finished after 185 ms. (steps per millisecond=337 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 14 out of 482 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 482/482 places, 480/480 transitions.
Drop transitions removed 181 transitions
Trivial Post-agglo rules discarded 181 transitions
Performed 181 trivial Post agglomeration. Transition count delta: 181
Iterating post reduction 0 with 181 rules applied. Total rules applied 181 place count 482 transition count 299
Reduce places removed 181 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 215 rules applied. Total rules applied 396 place count 301 transition count 265
Reduce places removed 10 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 15 rules applied. Total rules applied 411 place count 291 transition count 260
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 417 place count 286 transition count 259
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 417 place count 286 transition count 196
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 543 place count 223 transition count 196
Discarding 43 places :
Symmetric choice reduction at 4 with 43 rule applications. Total rules 586 place count 180 transition count 153
Iterating global reduction 4 with 43 rules applied. Total rules applied 629 place count 180 transition count 153
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 629 place count 180 transition count 143
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 649 place count 170 transition count 143
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 723 place count 133 transition count 106
Free-agglomeration rule applied 17 times.
Iterating global reduction 4 with 17 rules applied. Total rules applied 740 place count 133 transition count 89
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 757 place count 116 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 758 place count 115 transition count 88
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 761 place count 112 transition count 88
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 761 place count 112 transition count 85
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 767 place count 109 transition count 85
Applied a total of 767 rules in 100 ms. Remains 109 /482 variables (removed 373) and now considering 85/480 (removed 395) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/482 places, 85/480 transitions.
[2021-05-08 10:37:59] [INFO ] Flatten gal took : 36 ms
[2021-05-08 10:37:59] [INFO ] Flatten gal took : 11 ms
[2021-05-08 10:37:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10930764853626226102.gal : 7 ms
[2021-05-08 10:37:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17215774510312750630.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality10930764853626226102.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17215774510312750630.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/ReachabilityCardinality10930764853626226102.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17215774510312750630.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17215774510312750630.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 21
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :21 after 125
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :125 after 745
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :745 after 4309
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :4309 after 5376
Invariant property AutoFlight-PT-05b-ReachabilityFireability-12 does not hold.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property AutoFlight-PT-05b-ReachabilityFireability-08 does not hold.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :5376 after 27829
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :27829 after 38077
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :38077 after 77211
Reachability property AutoFlight-PT-05b-ReachabilityFireability-09 is true.
FORMULA AutoFlight-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 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,214660,0.066564,6108,2,2299,17,9682,6,0,488,6154,0
Total reachable state count : 214660

Verifying 3 reachability properties.
Invariant property AutoFlight-PT-05b-ReachabilityFireability-08 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
AutoFlight-PT-05b-ReachabilityFireability-08,12,0.067252,6108,2,131,17,9682,7,0,496,6154,0
Reachability property AutoFlight-PT-05b-ReachabilityFireability-09 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
AutoFlight-PT-05b-ReachabilityFireability-09,48384,0.184138,6372,2,976,17,9682,8,0,512,6154,0
Invariant property AutoFlight-PT-05b-ReachabilityFireability-12 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
AutoFlight-PT-05b-ReachabilityFireability-12,1,0.185279,6372,2,110,17,9682,9,0,526,6154,0
All properties solved without resorting to model-checking.

BK_STOP 1620470280827

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-05b"
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 AutoFlight-PT-05b, 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 r007-tall-162037990000447"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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