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

About the Execution of 2020-gold for AutoFlight-PT-05b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
290.128 3600000.00 42746.00 265.40 TFTFTFTTFTFFFFTT 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.r011-tall-162038006100224.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 gold2020
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 r011-tall-162038006100224
=====================================================================

--------------------
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 1620435744038

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-08 01:02:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-08 01:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 01:02:25] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2021-05-08 01:02:25] [INFO ] Transformed 482 places.
[2021-05-08 01:02:25] [INFO ] Transformed 480 transitions.
[2021-05-08 01:02:25] [INFO ] Found NUPN structural information;
[2021-05-08 01:02:25] [INFO ] Parsed PT model containing 482 places and 480 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 30 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 40 resets, run finished after 69 ms. (steps per millisecond=144 ) properties seen :[1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1]
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 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA AutoFlight-PT-05b-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=666 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 480 rows 482 cols
[2021-05-08 01:02:26] [INFO ] Computed 34 place invariants in 15 ms
[2021-05-08 01:02:26] [INFO ] [Real]Absence check using 33 positive place invariants in 35 ms returned sat
[2021-05-08 01:02:26] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:02:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:26] [INFO ] [Real]Absence check using state equation in 496 ms returned sat
[2021-05-08 01:02:26] [INFO ] Deduced a trap composed of 30 places in 164 ms
[2021-05-08 01:02:27] [INFO ] Deduced a trap composed of 19 places in 107 ms
[2021-05-08 01:02:27] [INFO ] Deduced a trap composed of 29 places in 114 ms
[2021-05-08 01:02:27] [INFO ] Deduced a trap composed of 23 places in 90 ms
[2021-05-08 01:02:27] [INFO ] Deduced a trap composed of 22 places in 81 ms
[2021-05-08 01:02:27] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 687 ms
[2021-05-08 01:02:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:02:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 145 ms returned sat
[2021-05-08 01:02:27] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:02:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:28] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2021-05-08 01:02:28] [INFO ] Deduced a trap composed of 19 places in 131 ms
[2021-05-08 01:02:28] [INFO ] Deduced a trap composed of 39 places in 129 ms
[2021-05-08 01:02:28] [INFO ] Deduced a trap composed of 23 places in 116 ms
[2021-05-08 01:02:28] [INFO ] Deduced a trap composed of 32 places in 112 ms
[2021-05-08 01:02:28] [INFO ] Deduced a trap composed of 31 places in 111 ms
[2021-05-08 01:02:28] [INFO ] Deduced a trap composed of 47 places in 108 ms
[2021-05-08 01:02:29] [INFO ] Deduced a trap composed of 40 places in 115 ms
[2021-05-08 01:02:29] [INFO ] Deduced a trap composed of 29 places in 143 ms
[2021-05-08 01:02:29] [INFO ] Deduced a trap composed of 88 places in 108 ms
[2021-05-08 01:02:29] [INFO ] Deduced a trap composed of 44 places in 118 ms
[2021-05-08 01:02:29] [INFO ] Deduced a trap composed of 30 places in 111 ms
[2021-05-08 01:02:29] [INFO ] Deduced a trap composed of 60 places in 120 ms
[2021-05-08 01:02:29] [INFO ] Deduced a trap composed of 48 places in 117 ms
[2021-05-08 01:02:30] [INFO ] Deduced a trap composed of 74 places in 114 ms
[2021-05-08 01:02:30] [INFO ] Deduced a trap composed of 73 places in 106 ms
[2021-05-08 01:02:30] [INFO ] Deduced a trap composed of 59 places in 109 ms
[2021-05-08 01:02:30] [INFO ] Deduced a trap composed of 75 places in 99 ms
[2021-05-08 01:02:30] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2295 ms
[2021-05-08 01:02:30] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 27 ms.
[2021-05-08 01:02:32] [INFO ] Added : 400 causal constraints over 80 iterations in 2028 ms. Result :(error "Solver has unexpectedly terminated")
[2021-05-08 01:02:32] [INFO ] [Real]Absence check using 33 positive place invariants in 33 ms returned sat
[2021-05-08 01:02:32] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned unsat
[2021-05-08 01:02:32] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-08 01:02:32] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:02:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:33] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2021-05-08 01:02:33] [INFO ] Deduced a trap composed of 65 places in 132 ms
[2021-05-08 01:02:33] [INFO ] Deduced a trap composed of 54 places in 126 ms
[2021-05-08 01:02:33] [INFO ] Deduced a trap composed of 61 places in 120 ms
[2021-05-08 01:02:33] [INFO ] Deduced a trap composed of 104 places in 116 ms
[2021-05-08 01:02:33] [INFO ] Deduced a trap composed of 97 places in 125 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 86 places in 114 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 101 places in 101 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 70 places in 106 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 104 places in 109 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 72 places in 111 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 81 places in 104 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 75 places in 102 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 96 places in 102 ms
[2021-05-08 01:02:34] [INFO ] Deduced a trap composed of 59 places in 65 ms
[2021-05-08 01:02:35] [INFO ] Deduced a trap composed of 74 places in 62 ms
[2021-05-08 01:02:35] [INFO ] Deduced a trap composed of 46 places in 68 ms
[2021-05-08 01:02:35] [INFO ] Deduced a trap composed of 39 places in 65 ms
[2021-05-08 01:02:35] [INFO ] Deduced a trap composed of 60 places in 61 ms
[2021-05-08 01:02:35] [INFO ] Trap strengthening (SAT) tested/added 19/18 trap constraints in 2112 ms
[2021-05-08 01:02:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:02:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 68 ms returned sat
[2021-05-08 01:02:35] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 2 ms returned sat
[2021-05-08 01:02:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:35] [INFO ] [Nat]Absence check using state equation in 481 ms returned sat
[2021-05-08 01:02:36] [INFO ] Deduced a trap composed of 52 places in 125 ms
[2021-05-08 01:02:36] [INFO ] Deduced a trap composed of 52 places in 142 ms
[2021-05-08 01:02:36] [INFO ] Deduced a trap composed of 33 places in 133 ms
[2021-05-08 01:02:36] [INFO ] Deduced a trap composed of 54 places in 129 ms
[2021-05-08 01:02:36] [INFO ] Deduced a trap composed of 35 places in 110 ms
[2021-05-08 01:02:36] [INFO ] Deduced a trap composed of 46 places in 120 ms
[2021-05-08 01:02:36] [INFO ] Deduced a trap composed of 38 places in 117 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 80 places in 114 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 39 places in 122 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 46 places in 102 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 74 places in 95 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 61 places in 118 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 80 places in 116 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 53 places in 88 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 63 places in 104 ms
[2021-05-08 01:02:37] [INFO ] Deduced a trap composed of 60 places in 100 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 37 places in 122 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 68 places in 120 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 58 places in 113 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 56 places in 114 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 41 places in 186 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 59 places in 66 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 42 places in 49 ms
[2021-05-08 01:02:38] [INFO ] Deduced a trap composed of 43 places in 41 ms
[2021-05-08 01:02:38] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3025 ms
[2021-05-08 01:02:38] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 24 ms.
[2021-05-08 01:02:40] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (=> (> t331 0) (and (> t329 0) (< o329 o331)))") while checking expression at index 2
[2021-05-08 01:02:40] [INFO ] [Real]Absence check using 33 positive place invariants in 32 ms returned sat
[2021-05-08 01:02:40] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 01:02:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:40] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 35 places in 120 ms
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 45 places in 116 ms
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 33 places in 116 ms
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 41 places in 108 ms
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 46 places in 116 ms
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 68 places in 101 ms
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 30 places in 93 ms
[2021-05-08 01:02:41] [INFO ] Deduced a trap composed of 39 places in 101 ms
[2021-05-08 01:02:42] [INFO ] Deduced a trap composed of 63 places in 104 ms
[2021-05-08 01:02:42] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1136 ms
[2021-05-08 01:02:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:02:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 156 ms returned sat
[2021-05-08 01:02:42] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 5 ms returned sat
[2021-05-08 01:02:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:42] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2021-05-08 01:02:42] [INFO ] Deduced a trap composed of 33 places in 119 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 35 places in 108 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 41 places in 103 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 53 places in 105 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 60 places in 96 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 58 places in 97 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 46 places in 95 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 57 places in 95 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 78 places in 84 ms
[2021-05-08 01:02:43] [INFO ] Deduced a trap composed of 39 places in 82 ms
[2021-05-08 01:02:44] [INFO ] Deduced a trap composed of 30 places in 90 ms
[2021-05-08 01:02:44] [INFO ] Deduced a trap composed of 72 places in 98 ms
[2021-05-08 01:02:44] [INFO ] Deduced a trap composed of 67 places in 98 ms
[2021-05-08 01:02:44] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1486 ms
[2021-05-08 01:02:44] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 22 ms.
[2021-05-08 01:02:46] [INFO ] Added : 470 causal constraints over 95 iterations in 2403 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-08 01:02:46] [INFO ] [Real]Absence check using 33 positive place invariants in 27 ms returned sat
[2021-05-08 01:02:46] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned unsat
[2021-05-08 01:02:46] [INFO ] [Real]Absence check using 33 positive place invariants in 30 ms returned sat
[2021-05-08 01:02:46] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 4 ms returned sat
[2021-05-08 01:02:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:47] [INFO ] [Real]Absence check using state equation in 511 ms returned sat
[2021-05-08 01:02:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 01:02:47] [INFO ] [Nat]Absence check using 33 positive place invariants in 71 ms returned sat
[2021-05-08 01:02:47] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 3 ms returned sat
[2021-05-08 01:02:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 01:02:48] [INFO ] [Nat]Absence check using state equation in 505 ms returned sat
[2021-05-08 01:02:48] [INFO ] Deduced a trap composed of 30 places in 108 ms
[2021-05-08 01:02:48] [INFO ] Deduced a trap composed of 94 places in 107 ms
[2021-05-08 01:02:48] [INFO ] Deduced a trap composed of 40 places in 105 ms
[2021-05-08 01:02:48] [INFO ] Deduced a trap composed of 56 places in 102 ms
[2021-05-08 01:02:48] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 500 ms
[2021-05-08 01:02:48] [INFO ] Computed and/alt/rep : 479/644/479 causal constraints in 28 ms.
[2021-05-08 01:02:51] [INFO ] Added : 468 causal constraints over 94 iterations in 2377 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 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
Incomplete Parikh walk after 60000 steps, including 206 resets, run finished after 201 ms. (steps per millisecond=298 ) properties seen :[1, 0, 0, 0] could not realise parikh vector
FORMULA AutoFlight-PT-05b-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 46500 steps, including 182 resets, run finished after 128 ms. (steps per millisecond=363 ) properties seen :[0, 1, 0] could not realise parikh vector
FORMULA AutoFlight-PT-05b-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 9 out of 482 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 482/482 places, 480/480 transitions.
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 186
Iterating post reduction 0 with 186 rules applied. Total rules applied 186 place count 482 transition count 294
Reduce places removed 186 places and 0 transitions.
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 221 rules applied. Total rules applied 407 place count 296 transition count 259
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 417 place count 286 transition count 259
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 417 place count 286 transition count 195
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 545 place count 222 transition count 195
Symmetric choice reduction at 3 with 48 rule applications. Total rules 593 place count 222 transition count 195
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 48 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 689 place count 174 transition count 147
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 689 place count 174 transition count 137
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 709 place count 164 transition count 137
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 789 place count 124 transition count 97
Free-agglomeration rule applied 17 times.
Iterating global reduction 3 with 17 rules applied. Total rules applied 806 place count 124 transition count 80
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 823 place count 107 transition count 80
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 824 place count 106 transition count 79
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 7 rules applied. Total rules applied 831 place count 101 transition count 77
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 833 place count 99 transition count 77
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 833 place count 99 transition count 74
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 839 place count 96 transition count 74
Applied a total of 839 rules in 105 ms. Remains 96 /482 variables (removed 386) and now considering 74/480 (removed 406) transitions.
Finished structural reductions, in 1 iterations. Remains : 96/482 places, 74/480 transitions.
Incomplete random walk after 1000000 steps, including 30878 resets, run finished after 2108 ms. (steps per millisecond=474 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 5991 resets, run finished after 779 ms. (steps per millisecond=1283 ) properties seen :[1, 0]
FORMULA AutoFlight-PT-05b-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Finished Best-First random walk after 4688 steps, including 25 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1172 )
FORMULA AutoFlight-PT-05b-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
All properties solved without resorting to model-checking.

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutoFlight-PT-05b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
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 gold2020"
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 r011-tall-162038006100224"
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 ;