About the Execution of ITS-Tools for AutoFlight-PT-03b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
263.252 | 14172.00 | 24150.00 | 319.60 | TTFTTTTFFFFFTTFT | normal |
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-162037990000415.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-03b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990000415
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K 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 28K Mar 28 15:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K 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.1K Mar 23 01:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 01:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 10:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 10:15 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 70K 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-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 1620467450139
Running Version 0
[2021-05-08 09:50:51] [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 09:50:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 09:50:52] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2021-05-08 09:50:52] [INFO ] Transformed 298 places.
[2021-05-08 09:50:52] [INFO ] Transformed 296 transitions.
[2021-05-08 09:50:52] [INFO ] Found NUPN structural information;
[2021-05-08 09:50:52] [INFO ] Parsed PT model containing 298 places and 296 transitions in 99 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 62 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 16) seen :8
FORMULA AutoFlight-PT-03b-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 8) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 7) seen :1
FORMULA AutoFlight-PT-03b-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 6 properties.
// Phase 1: matrix 296 rows 298 cols
[2021-05-08 09:50:52] [INFO ] Computed 22 place invariants in 21 ms
[2021-05-08 09:50:52] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-08 09:50:52] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 09:50:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:52] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2021-05-08 09:50:52] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 4 ms to minimize.
[2021-05-08 09:50:52] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2021-05-08 09:50:52] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2021-05-08 09:50:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 292 ms
[2021-05-08 09:50:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:50:52] [INFO ] [Nat]Absence check using 21 positive place invariants in 11 ms returned sat
[2021-05-08 09:50:53] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 09:50:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:53] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2021-05-08 09:50:53] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 2 ms to minimize.
[2021-05-08 09:50:53] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 0 ms to minimize.
[2021-05-08 09:50:53] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2021-05-08 09:50:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 197 ms
[2021-05-08 09:50:53] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 22 ms.
[2021-05-08 09:50:54] [INFO ] Added : 260 causal constraints over 53 iterations in 924 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-08 09:50:54] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-08 09:50:54] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:54] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2021-05-08 09:50:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:50:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned sat
[2021-05-08 09:50:54] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:54] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-08 09:50:54] [INFO ] Deduced a trap composed of 51 places in 66 ms of which 0 ms to minimize.
[2021-05-08 09:50:54] [INFO ] Deduced a trap composed of 47 places in 59 ms of which 0 ms to minimize.
[2021-05-08 09:50:54] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2021-05-08 09:50:54] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 0 ms to minimize.
[2021-05-08 09:50:54] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 10 ms to minimize.
[2021-05-08 09:50:55] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2021-05-08 09:50:55] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 439 ms
[2021-05-08 09:50:55] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-08 09:50:56] [INFO ] Added : 284 causal constraints over 57 iterations in 961 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 09:50:56] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-08 09:50:56] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:56] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2021-05-08 09:50:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:50:56] [INFO ] [Nat]Absence check using 21 positive place invariants in 14 ms returned sat
[2021-05-08 09:50:56] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:56] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2021-05-08 09:50:56] [INFO ] Deduced a trap composed of 53 places in 54 ms of which 1 ms to minimize.
[2021-05-08 09:50:56] [INFO ] Deduced a trap composed of 47 places in 47 ms of which 0 ms to minimize.
[2021-05-08 09:50:56] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
[2021-05-08 09:50:56] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 0 ms to minimize.
[2021-05-08 09:50:56] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 0 ms to minimize.
[2021-05-08 09:50:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 297 ms
[2021-05-08 09:50:56] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-08 09:50:57] [INFO ] Added : 278 causal constraints over 57 iterations in 950 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 09:50:57] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2021-05-08 09:50:57] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:57] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2021-05-08 09:50:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:50:57] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-08 09:50:57] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:57] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2021-05-08 09:50:57] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 0 ms to minimize.
[2021-05-08 09:50:58] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2021-05-08 09:50:58] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 0 ms to minimize.
[2021-05-08 09:50:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 189 ms
[2021-05-08 09:50:58] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 18 ms.
[2021-05-08 09:50:58] [INFO ] Added : 274 causal constraints over 56 iterations in 884 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 5 ms.
[2021-05-08 09:50:59] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2021-05-08 09:50:59] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:59] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2021-05-08 09:50:59] [INFO ] Deduced a trap composed of 60 places in 39 ms of which 0 ms to minimize.
[2021-05-08 09:50:59] [INFO ] Deduced a trap composed of 36 places in 36 ms of which 1 ms to minimize.
[2021-05-08 09:50:59] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 0 ms to minimize.
[2021-05-08 09:50:59] [INFO ] Deduced a trap composed of 48 places in 41 ms of which 0 ms to minimize.
[2021-05-08 09:50:59] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 225 ms
[2021-05-08 09:50:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:50:59] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2021-05-08 09:50:59] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:50:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:50:59] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2021-05-08 09:50:59] [INFO ] Deduced a trap composed of 60 places in 45 ms of which 0 ms to minimize.
[2021-05-08 09:50:59] [INFO ] Deduced a trap composed of 36 places in 45 ms of which 0 ms to minimize.
[2021-05-08 09:50:59] [INFO ] Deduced a trap composed of 41 places in 43 ms of which 0 ms to minimize.
[2021-05-08 09:50:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 170 ms
[2021-05-08 09:50:59] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 17 ms.
[2021-05-08 09:51:00] [INFO ] Added : 295 causal constraints over 60 iterations in 950 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-08 09:51:00] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2021-05-08 09:51:00] [INFO ] [Real]Absence check using 21 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 09:51:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 09:51:00] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2021-05-08 09:51:00] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2021-05-08 09:51:00] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
[2021-05-08 09:51:00] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 4 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 352 ms
[2021-05-08 09:51:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 09:51:01] [INFO ] [Nat]Absence check using 21 positive place invariants in 9 ms returned sat
[2021-05-08 09:51:01] [INFO ] [Nat]Absence check using 21 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 09:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 09:51:01] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 0 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 35 places in 50 ms of which 1 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 0 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 0 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2021-05-08 09:51:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 345 ms
[2021-05-08 09:51:01] [INFO ] Computed and/alt/rep : 295/398/295 causal constraints (skipped 0 transitions) in 16 ms.
[2021-05-08 09:51:02] [INFO ] Added : 277 causal constraints over 56 iterations in 902 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 12 ms.
Incomplete Parikh walk after 29200 steps, including 191 resets, run finished after 129 ms. (steps per millisecond=226 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA AutoFlight-PT-03b-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-03b-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 30200 steps, including 202 resets, run finished after 84 ms. (steps per millisecond=359 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-03b-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 27900 steps, including 184 resets, run finished after 76 ms. (steps per millisecond=367 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 24800 steps, including 167 resets, run finished after 70 ms. (steps per millisecond=354 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 39400 steps, including 216 resets, run finished after 110 ms. (steps per millisecond=358 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 36100 steps, including 226 resets, run finished after 98 ms. (steps per millisecond=368 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 4 out of 298 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 298/298 places, 296/296 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 298 transition count 184
Reduce places removed 112 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 133 rules applied. Total rules applied 245 place count 186 transition count 163
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 254 place count 180 transition count 160
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 257 place count 177 transition count 160
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 257 place count 177 transition count 119
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 339 place count 136 transition count 119
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 366 place count 109 transition count 92
Iterating global reduction 4 with 27 rules applied. Total rules applied 393 place count 109 transition count 92
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 393 place count 109 transition count 84
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 409 place count 101 transition count 84
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 459 place count 76 transition count 59
Free-agglomeration rule applied 10 times.
Iterating global reduction 4 with 10 rules applied. Total rules applied 469 place count 76 transition count 49
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 479 place count 66 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 480 place count 65 transition count 48
Reduce places removed 9 places and 0 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 5 with 16 rules applied. Total rules applied 496 place count 56 transition count 41
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 503 place count 49 transition count 41
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 503 place count 49 transition count 33
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 519 place count 41 transition count 33
Applied a total of 519 rules in 78 ms. Remains 41 /298 variables (removed 257) and now considering 33/296 (removed 263) transitions.
Finished structural reductions, in 1 iterations. Remains : 41/298 places, 33/296 transitions.
[2021-05-08 09:51:03] [INFO ] Flatten gal took : 56 ms
[2021-05-08 09:51:03] [INFO ] Flatten gal took : 6 ms
[2021-05-08 09:51:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11705287213908903499.gal : 4 ms
[2021-05-08 09:51:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality460719176201697949.prop : 0 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/ReachabilityCardinality11705287213908903499.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality460719176201697949.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/ReachabilityCardinality11705287213908903499.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality460719176201697949.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality460719176201697949.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :4 after 25
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :25 after 32
Reachability property AutoFlight-PT-03b-ReachabilityFireability-12 is true.
FORMULA AutoFlight-PT-03b-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :32 after 48
Reachability property AutoFlight-PT-03b-ReachabilityFireability-13 is true.
FORMULA AutoFlight-PT-03b-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property AutoFlight-PT-03b-ReachabilityFireability-07 does not hold.
FORMULA AutoFlight-PT-03b-ReachabilityFireability-07 FALSE 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 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,68,0.013255,4316,2,125,12,580,6,0,191,212,0
Total reachable state count : 68
Verifying 3 reachability properties.
Invariant property AutoFlight-PT-03b-ReachabilityFireability-07 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-03b-ReachabilityFireability-07,1,0.013543,4316,2,42,12,580,7,0,197,212,0
Reachability property AutoFlight-PT-03b-ReachabilityFireability-12 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-03b-ReachabilityFireability-12,4,0.013686,4316,2,45,12,580,8,0,199,212,0
Reachability property AutoFlight-PT-03b-ReachabilityFireability-13 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-03b-ReachabilityFireability-13,8,0.013826,4316,2,46,12,580,9,0,201,212,0
All properties solved without resorting to model-checking.
BK_STOP 1620467464311
--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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-03b"
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-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 r007-tall-162037990000415"
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 '
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 ;