fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037990100471
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for AutoFlight-PT-12a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
265.855 21670.00 21841.00 3791.90 FFTFTTTTTTFFTTFT 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-162037990100471.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-12a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037990100471
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.1K Mar 28 15:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K Mar 28 15:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 01:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 23 01:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 22 10:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 22 10:18 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 85K 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-12a-ReachabilityFireability-00
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-01
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-02
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-03
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-04
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-05
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-06
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-07
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-08
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-09
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-10
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-11
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-12
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-13
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-14
FORMULA_NAME AutoFlight-PT-12a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1620472285151

Running Version 0
[2021-05-08 11:11:32] [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 11:11:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 11:11:32] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-08 11:11:32] [INFO ] Transformed 307 places.
[2021-05-08 11:11:32] [INFO ] Transformed 305 transitions.
[2021-05-08 11:11:32] [INFO ] Found NUPN structural information;
[2021-05-08 11:11:32] [INFO ] Parsed PT model containing 307 places and 305 transitions in 101 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 60 transitions
Reduce redundant transitions removed 60 transitions.
Incomplete random walk after 10000 steps, including 187 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 16) seen :7
FORMULA AutoFlight-PT-12a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :1
FORMULA AutoFlight-PT-12a-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 245 rows 307 cols
[2021-05-08 11:11:33] [INFO ] Computed 76 place invariants in 21 ms
[2021-05-08 11:11:33] [INFO ] [Real]Absence check using 75 positive place invariants in 24 ms returned sat
[2021-05-08 11:11:33] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 4 ms returned unsat
[2021-05-08 11:11:33] [INFO ] [Real]Absence check using 75 positive place invariants in 23 ms returned sat
[2021-05-08 11:11:33] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:33] [INFO ] [Real]Absence check using state equation in 235 ms returned sat
[2021-05-08 11:11:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:11:33] [INFO ] [Nat]Absence check using 75 positive place invariants in 17 ms returned sat
[2021-05-08 11:11:33] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:33] [INFO ] [Nat]Absence check using state equation in 97 ms returned sat
[2021-05-08 11:11:33] [INFO ] State equation strengthened by 60 read => feed constraints.
[2021-05-08 11:11:33] [INFO ] [Nat]Added 60 Read/Feed constraints in 11 ms returned sat
[2021-05-08 11:11:34] [INFO ] Computed and/alt/rep : 216/444/216 causal constraints (skipped 28 transitions) in 24 ms.
[2021-05-08 11:11:34] [INFO ] Added : 108 causal constraints over 22 iterations in 537 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2021-05-08 11:11:34] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2021-05-08 11:11:34] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:34] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2021-05-08 11:11:34] [INFO ] [Real]Added 60 Read/Feed constraints in 11 ms returned sat
[2021-05-08 11:11:34] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:11:34] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2021-05-08 11:11:34] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 0 ms returned sat
[2021-05-08 11:11:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:34] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2021-05-08 11:11:34] [INFO ] [Nat]Added 60 Read/Feed constraints in 7 ms returned sat
[2021-05-08 11:11:34] [INFO ] Computed and/alt/rep : 216/444/216 causal constraints (skipped 28 transitions) in 15 ms.
[2021-05-08 11:11:35] [INFO ] Deduced a trap composed of 114 places in 73 ms of which 1 ms to minimize.
[2021-05-08 11:11:35] [INFO ] Deduced a trap composed of 115 places in 47 ms of which 1 ms to minimize.
[2021-05-08 11:11:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2021-05-08 11:11:35] [INFO ] Added : 111 causal constraints over 23 iterations in 723 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2021-05-08 11:11:35] [INFO ] [Real]Absence check using 75 positive place invariants in 17 ms returned sat
[2021-05-08 11:11:35] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 15 ms returned sat
[2021-05-08 11:11:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:35] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2021-05-08 11:11:35] [INFO ] [Real]Added 60 Read/Feed constraints in 8 ms returned sat
[2021-05-08 11:11:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:11:35] [INFO ] [Nat]Absence check using 75 positive place invariants in 18 ms returned sat
[2021-05-08 11:11:35] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:36] [INFO ] [Nat]Absence check using state equation in 119 ms returned sat
[2021-05-08 11:11:36] [INFO ] [Nat]Added 60 Read/Feed constraints in 9 ms returned sat
[2021-05-08 11:11:36] [INFO ] Deduced a trap composed of 135 places in 85 ms of which 1 ms to minimize.
[2021-05-08 11:11:36] [INFO ] Deduced a trap composed of 128 places in 51 ms of which 0 ms to minimize.
[2021-05-08 11:11:36] [INFO ] Deduced a trap composed of 133 places in 55 ms of which 1 ms to minimize.
[2021-05-08 11:11:36] [INFO ] Deduced a trap composed of 132 places in 56 ms of which 1 ms to minimize.
[2021-05-08 11:11:36] [INFO ] Deduced a trap composed of 127 places in 55 ms of which 0 ms to minimize.
[2021-05-08 11:11:36] [INFO ] Deduced a trap composed of 130 places in 62 ms of which 1 ms to minimize.
[2021-05-08 11:11:36] [INFO ] Deduced a trap composed of 137 places in 53 ms of which 1 ms to minimize.
[2021-05-08 11:11:36] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 542 ms
[2021-05-08 11:11:36] [INFO ] Computed and/alt/rep : 216/444/216 causal constraints (skipped 28 transitions) in 16 ms.
[2021-05-08 11:11:37] [INFO ] Added : 106 causal constraints over 22 iterations in 474 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2021-05-08 11:11:37] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2021-05-08 11:11:37] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 7 ms returned sat
[2021-05-08 11:11:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:37] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2021-05-08 11:11:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:11:37] [INFO ] [Nat]Absence check using 75 positive place invariants in 14 ms returned sat
[2021-05-08 11:11:37] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:37] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-08 11:11:37] [INFO ] [Nat]Added 60 Read/Feed constraints in 6 ms returned sat
[2021-05-08 11:11:37] [INFO ] Deduced a trap composed of 127 places in 44 ms of which 1 ms to minimize.
[2021-05-08 11:11:37] [INFO ] Deduced a trap composed of 128 places in 42 ms of which 1 ms to minimize.
[2021-05-08 11:11:37] [INFO ] Deduced a trap composed of 135 places in 40 ms of which 0 ms to minimize.
[2021-05-08 11:11:37] [INFO ] Deduced a trap composed of 133 places in 46 ms of which 0 ms to minimize.
[2021-05-08 11:11:37] [INFO ] Deduced a trap composed of 132 places in 42 ms of which 0 ms to minimize.
[2021-05-08 11:11:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 283 ms
[2021-05-08 11:11:37] [INFO ] Computed and/alt/rep : 216/444/216 causal constraints (skipped 28 transitions) in 17 ms.
[2021-05-08 11:11:38] [INFO ] Added : 216 causal constraints over 44 iterations in 886 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-08 11:11:38] [INFO ] [Real]Absence check using 75 positive place invariants in 14 ms returned sat
[2021-05-08 11:11:38] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:38] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2021-05-08 11:11:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:11:38] [INFO ] [Nat]Absence check using 75 positive place invariants in 22 ms returned sat
[2021-05-08 11:11:38] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 11:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:39] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2021-05-08 11:11:39] [INFO ] [Nat]Added 60 Read/Feed constraints in 10 ms returned sat
[2021-05-08 11:11:39] [INFO ] Deduced a trap composed of 135 places in 50 ms of which 1 ms to minimize.
[2021-05-08 11:11:39] [INFO ] Deduced a trap composed of 127 places in 48 ms of which 0 ms to minimize.
[2021-05-08 11:11:39] [INFO ] Deduced a trap composed of 128 places in 53 ms of which 0 ms to minimize.
[2021-05-08 11:11:39] [INFO ] Deduced a trap composed of 132 places in 46 ms of which 0 ms to minimize.
[2021-05-08 11:11:39] [INFO ] Deduced a trap composed of 137 places in 46 ms of which 0 ms to minimize.
[2021-05-08 11:11:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 333 ms
[2021-05-08 11:11:39] [INFO ] Computed and/alt/rep : 216/444/216 causal constraints (skipped 28 transitions) in 16 ms.
[2021-05-08 11:11:40] [INFO ] Deduced a trap composed of 130 places in 40 ms of which 0 ms to minimize.
[2021-05-08 11:11:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2021-05-08 11:11:40] [INFO ] Added : 156 causal constraints over 32 iterations in 686 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2021-05-08 11:11:40] [INFO ] [Real]Absence check using 75 positive place invariants in 13 ms returned sat
[2021-05-08 11:11:40] [INFO ] [Real]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:40] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2021-05-08 11:11:40] [INFO ] [Real]Added 60 Read/Feed constraints in 6 ms returned sat
[2021-05-08 11:11:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 11:11:40] [INFO ] [Nat]Absence check using 75 positive place invariants in 13 ms returned sat
[2021-05-08 11:11:40] [INFO ] [Nat]Absence check using 75 positive and 1 generalized place invariants in 1 ms returned sat
[2021-05-08 11:11:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 11:11:40] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-08 11:11:40] [INFO ] [Nat]Added 60 Read/Feed constraints in 6 ms returned sat
[2021-05-08 11:11:40] [INFO ] Computed and/alt/rep : 216/444/216 causal constraints (skipped 28 transitions) in 14 ms.
[2021-05-08 11:11:40] [INFO ] Added : 167 causal constraints over 34 iterations in 647 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2021-05-08 11:11:41] [INFO ] [Real]Absence check using 75 positive place invariants in 9 ms returned unsat
FORMULA AutoFlight-PT-12a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-12a-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 6 different solutions.
Incomplete Parikh walk after 12300 steps, including 253 resets, run finished after 84 ms. (steps per millisecond=146 ) properties (out of 6) seen :2 could not realise parikh vector
FORMULA AutoFlight-PT-12a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 11800 steps, including 255 resets, run finished after 67 ms. (steps per millisecond=176 ) properties (out of 4) seen :2 could not realise parikh vector
FORMULA AutoFlight-PT-12a-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA AutoFlight-PT-12a-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 9700 steps, including 285 resets, run finished after 50 ms. (steps per millisecond=194 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29200 steps, including 314 resets, run finished after 132 ms. (steps per millisecond=221 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 18400 steps, including 246 resets, run finished after 82 ms. (steps per millisecond=224 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 17700 steps, including 251 resets, run finished after 76 ms. (steps per millisecond=232 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 22 out of 307 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 307/307 places, 245/245 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 307 transition count 216
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 278 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 276 transition count 214
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 62 place count 276 transition count 202
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 86 place count 264 transition count 202
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 124 place count 245 transition count 183
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 143 place count 245 transition count 164
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 3 with 19 rules applied. Total rules applied 162 place count 226 transition count 164
Applied a total of 162 rules in 77 ms. Remains 226 /307 variables (removed 81) and now considering 164/245 (removed 81) transitions.
Finished structural reductions, in 1 iterations. Remains : 226/307 places, 164/245 transitions.
[2021-05-08 11:11:41] [INFO ] Flatten gal took : 49 ms
[2021-05-08 11:11:41] [INFO ] Flatten gal took : 20 ms
[2021-05-08 11:11:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4283312177188850482.gal : 9 ms
[2021-05-08 11:11:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8689094725501392167.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/ReachabilityCardinality4283312177188850482.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality8689094725501392167.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/ReachabilityCardinality4283312177188850482.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality8689094725501392167.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality8689094725501392167.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :9 after 33
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :33 after 65
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :65 after 789
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :789 after 929
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :929 after 1265
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1265 after 1720
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1720 after 3905
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :3905 after 10477
Invariant property AutoFlight-PT-12a-ReachabilityFireability-11 does not hold.
FORMULA AutoFlight-PT-12a-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Invariant property AutoFlight-PT-12a-ReachabilityFireability-10 does not hold.
FORMULA AutoFlight-PT-12a-ReachabilityFireability-10 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 1025 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,29497,0.364797,11220,2,3855,16,25749,6,0,964,20523,0
Total reachable state count : 29497

Verifying 2 reachability properties.
Invariant property AutoFlight-PT-12a-ReachabilityFireability-10 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-12a-ReachabilityFireability-10,32,0.414069,11484,2,298,16,25749,7,0,994,20523,0
Invariant property AutoFlight-PT-12a-ReachabilityFireability-11 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
AutoFlight-PT-12a-ReachabilityFireability-11,64,0.640542,11484,2,332,16,25749,8,0,1023,20523,0
All properties solved without resorting to model-checking.

BK_STOP 1620472306821

--------------------
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-12a"
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-12a, 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-162037990100471"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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