fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r010-tajo-165245701800173
Last Updated
Jun 22, 2022

About the Execution of 2021-gold for AutoFlight-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
255.979 55026.00 83014.00 176.20 FFTTTFTTTTTTTTFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r010-tajo-165245701800173.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-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 gold2021
Input is AutoFlight-PT-06b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701800173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.4K Apr 30 01:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 30 01:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 30 01:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 30 01:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Apr 30 01:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 01:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 01:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 103K Apr 30 01:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 134K May 10 09:33 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-06b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069643975

Running Version 0
[2022-06-12 21:34:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2022-06-12 21:34:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:34:06] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-06-12 21:34:06] [INFO ] Transformed 574 places.
[2022-06-12 21:34:06] [INFO ] Transformed 572 transitions.
[2022-06-12 21:34:06] [INFO ] Found NUPN structural information;
[2022-06-12 21:34:06] [INFO ] Parsed PT model containing 574 places and 572 transitions in 197 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 34 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 16) seen :5
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 11) seen :1
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 10 properties.
// Phase 1: matrix 572 rows 574 cols
[2022-06-12 21:34:07] [INFO ] Computed 40 place invariants in 41 ms
[2022-06-12 21:34:07] [INFO ] [Real]Absence check using 39 positive place invariants in 19 ms returned sat
[2022-06-12 21:34:07] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:08] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-06-12 21:34:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:08] [INFO ] [Nat]Absence check using 39 positive place invariants in 26 ms returned sat
[2022-06-12 21:34:08] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:34:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:08] [INFO ] [Nat]Absence check using state equation in 214 ms returned sat
[2022-06-12 21:34:08] [INFO ] Deduced a trap composed of 22 places in 225 ms of which 5 ms to minimize.
[2022-06-12 21:34:08] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 2 ms to minimize.
[2022-06-12 21:34:09] [INFO ] Deduced a trap composed of 24 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:34:11] [INFO ] Deduced a trap composed of 74 places in 2324 ms of which 1 ms to minimize.
[2022-06-12 21:34:11] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 1 ms to minimize.
[2022-06-12 21:34:11] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:34:12] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 14 ms to minimize.
[2022-06-12 21:34:12] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3706 ms
[2022-06-12 21:34:12] [INFO ] Computed and/alt/rep : 571/767/571 causal constraints (skipped 0 transitions) in 85 ms.
[2022-06-12 21:34:13] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
[2022-06-12 21:34:13] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2022-06-12 21:34:13] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:13] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2022-06-12 21:34:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:13] [INFO ] [Real]Absence check using 39 positive place invariants in 32 ms returned sat
[2022-06-12 21:34:13] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:14] [INFO ] [Real]Absence check using state equation in 710 ms returned sat
[2022-06-12 21:34:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:14] [INFO ] [Nat]Absence check using 39 positive place invariants in 23 ms returned sat
[2022-06-12 21:34:14] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:34:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:15] [INFO ] [Nat]Absence check using state equation in 549 ms returned sat
[2022-06-12 21:34:15] [INFO ] Deduced a trap composed of 24 places in 280 ms of which 1 ms to minimize.
[2022-06-12 21:34:15] [INFO ] Deduced a trap composed of 28 places in 222 ms of which 1 ms to minimize.
[2022-06-12 21:34:16] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:34:16] [INFO ] Deduced a trap composed of 50 places in 235 ms of which 1 ms to minimize.
[2022-06-12 21:34:16] [INFO ] Deduced a trap composed of 25 places in 172 ms of which 1 ms to minimize.
[2022-06-12 21:34:16] [INFO ] Deduced a trap composed of 72 places in 96 ms of which 1 ms to minimize.
[2022-06-12 21:34:16] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 17 ms to minimize.
[2022-06-12 21:34:17] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 0 ms to minimize.
[2022-06-12 21:34:22] [INFO ] Deduced a trap composed of 31 places in 5769 ms of which 25 ms to minimize.
[2022-06-12 21:34:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 2
[2022-06-12 21:34:23] [INFO ] [Real]Absence check using 39 positive place invariants in 33 ms returned sat
[2022-06-12 21:34:23] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:23] [INFO ] [Real]Absence check using state equation in 619 ms returned sat
[2022-06-12 21:34:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2022-06-12 21:34:23] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:34:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:24] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2022-06-12 21:34:24] [INFO ] Deduced a trap composed of 24 places in 177 ms of which 1 ms to minimize.
[2022-06-12 21:34:24] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 0 ms to minimize.
[2022-06-12 21:34:29] [INFO ] Deduced a trap composed of 27 places in 5184 ms of which 1 ms to minimize.
[2022-06-12 21:34:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-12 21:34:29] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-06-12 21:34:29] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:34:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:30] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2022-06-12 21:34:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:30] [INFO ] [Real]Absence check using 39 positive place invariants in 18 ms returned sat
[2022-06-12 21:34:30] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:30] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2022-06-12 21:34:30] [INFO ] Deduced a trap composed of 25 places in 166 ms of which 1 ms to minimize.
[2022-06-12 21:34:30] [INFO ] Deduced a trap composed of 85 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 1 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 1 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 1 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 88 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:34:31] [INFO ] Deduced a trap composed of 88 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 100 places in 142 ms of which 0 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 73 places in 144 ms of which 1 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 0 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 1 ms to minimize.
[2022-06-12 21:34:32] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 0 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 84 places in 101 ms of which 1 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 6 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 55 places in 87 ms of which 2 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 102 places in 115 ms of which 1 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 65 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 101 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:34:33] [INFO ] Deduced a trap composed of 98 places in 135 ms of which 0 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 93 places in 121 ms of which 0 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 107 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 0 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 84 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 85 places in 104 ms of which 1 ms to minimize.
[2022-06-12 21:34:34] [INFO ] Deduced a trap composed of 81 places in 111 ms of which 1 ms to minimize.
[2022-06-12 21:34:35] [INFO ] Deduced a trap composed of 84 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:34:35] [INFO ] Deduced a trap composed of 46 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:34:35] [INFO ] Deduced a trap composed of 121 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:34:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-12 21:34:35] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-06-12 21:34:35] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:35] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2022-06-12 21:34:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:35] [INFO ] [Real]Absence check using 39 positive place invariants in 25 ms returned sat
[2022-06-12 21:34:35] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:34:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:36] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2022-06-12 21:34:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:36] [INFO ] [Real]Absence check using 39 positive place invariants in 23 ms returned sat
[2022-06-12 21:34:36] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:34:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:36] [INFO ] [Real]Absence check using state equation in 362 ms returned sat
[2022-06-12 21:34:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:37] [INFO ] [Real]Absence check using 39 positive place invariants in 16 ms returned sat
[2022-06-12 21:34:37] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:34:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:37] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2022-06-12 21:34:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:34:37] [INFO ] [Nat]Absence check using 39 positive place invariants in 21 ms returned sat
[2022-06-12 21:34:37] [INFO ] [Nat]Absence check using 39 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:34:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:34:37] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2022-06-12 21:34:37] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 0 ms to minimize.
[2022-06-12 21:34:37] [INFO ] Deduced a trap composed of 56 places in 137 ms of which 0 ms to minimize.
[2022-06-12 21:34:38] [INFO ] Deduced a trap composed of 30 places in 157 ms of which 0 ms to minimize.
[2022-06-12 21:34:38] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 0 ms to minimize.
[2022-06-12 21:34:38] [INFO ] Deduced a trap composed of 81 places in 204 ms of which 0 ms to minimize.
[2022-06-12 21:34:38] [INFO ] Deduced a trap composed of 53 places in 174 ms of which 9 ms to minimize.
[2022-06-12 21:34:38] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 0 ms to minimize.
[2022-06-12 21:34:39] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 0 ms to minimize.
[2022-06-12 21:34:39] [INFO ] Deduced a trap composed of 64 places in 185 ms of which 1 ms to minimize.
[2022-06-12 21:34:39] [INFO ] Deduced a trap composed of 62 places in 159 ms of which 0 ms to minimize.
[2022-06-12 21:34:39] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 1 ms to minimize.
[2022-06-12 21:34:39] [INFO ] Deduced a trap composed of 72 places in 151 ms of which 1 ms to minimize.
[2022-06-12 21:34:40] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 0 ms to minimize.
[2022-06-12 21:34:40] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2022-06-12 21:34:40] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 1 ms to minimize.
[2022-06-12 21:34:40] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:34:40] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:34:40] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 0 ms to minimize.
[2022-06-12 21:34:40] [INFO ] Deduced a trap composed of 91 places in 117 ms of which 1 ms to minimize.
[2022-06-12 21:34:41] [INFO ] Deduced a trap composed of 104 places in 115 ms of which 0 ms to minimize.
[2022-06-12 21:34:41] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 1 ms to minimize.
[2022-06-12 21:34:41] [INFO ] Deduced a trap composed of 70 places in 146 ms of which 1 ms to minimize.
[2022-06-12 21:34:41] [INFO ] Deduced a trap composed of 117 places in 123 ms of which 0 ms to minimize.
[2022-06-12 21:34:41] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 1 ms to minimize.
[2022-06-12 21:34:41] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 1 ms to minimize.
[2022-06-12 21:34:42] [INFO ] Deduced a trap composed of 93 places in 159 ms of which 1 ms to minimize.
[2022-06-12 21:34:42] [INFO ] Deduced a trap composed of 100 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:34:42] [INFO ] Deduced a trap composed of 92 places in 136 ms of which 1 ms to minimize.
[2022-06-12 21:34:42] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 1 different solutions.
Support contains 57 out of 574 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 574/574 places, 572/572 transitions.
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 0 with 166 rules applied. Total rules applied 166 place count 574 transition count 406
Reduce places removed 166 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 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 193 rules applied. Total rules applied 359 place count 408 transition count 379
Reduce places removed 6 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 2 with 24 rules applied. Total rules applied 383 place count 402 transition count 361
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 403 place count 384 transition count 359
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 65 Pre rules applied. Total rules applied 403 place count 384 transition count 294
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 4 with 130 rules applied. Total rules applied 533 place count 319 transition count 294
Discarding 44 places :
Symmetric choice reduction at 4 with 44 rule applications. Total rules 577 place count 275 transition count 250
Iterating global reduction 4 with 44 rules applied. Total rules applied 621 place count 275 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 624 place count 275 transition count 247
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 625 place count 274 transition count 247
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 11 Pre rules applied. Total rules applied 625 place count 274 transition count 236
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 647 place count 263 transition count 236
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 98 rules applied. Total rules applied 745 place count 214 transition count 187
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 747 place count 213 transition count 187
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 751 place count 213 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 753 place count 212 transition count 182
Free-agglomeration rule applied 19 times.
Iterating global reduction 6 with 19 rules applied. Total rules applied 772 place count 212 transition count 163
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 6 with 19 rules applied. Total rules applied 791 place count 193 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 792 place count 192 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 793 place count 191 transition count 162
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 793 place count 191 transition count 161
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 795 place count 190 transition count 161
Applied a total of 795 rules in 311 ms. Remains 190 /574 variables (removed 384) and now considering 161/572 (removed 411) transitions.
Finished structural reductions, in 1 iterations. Remains : 190/574 places, 161/572 transitions.
[2022-06-12 21:34:43] [INFO ] Flatten gal took : 71 ms
[2022-06-12 21:34:43] [INFO ] Flatten gal took : 21 ms
[2022-06-12 21:34:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18133535163753175962.gal : 19 ms
[2022-06-12 21:34:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13123593330909591681.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality18133535163753175962.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality13123593330909591681.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/ReachabilityCardinality18133535163753175962.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality13123593330909591681.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality13123593330909591681.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :6 after 8
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :8 after 27
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :27 after 48
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :48 after 68
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :68 after 1696
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :1696 after 8279
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :8279 after 2.3658e+07
SDD proceeding with computation,5 properties remain. new max is 1024
SDD size :2.3658e+07 after 3.76603e+07
Detected timeout of ITS tools.
[2022-06-12 21:34:58] [INFO ] Flatten gal took : 35 ms
[2022-06-12 21:34:58] [INFO ] Applying decomposition
[2022-06-12 21:34:58] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10768234121325419144.txt, -o, /tmp/graph10768234121325419144.bin, -w, /tmp/graph10768234121325419144.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10768234121325419144.bin, -l, -1, -v, -w, /tmp/graph10768234121325419144.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 21:34:58] [INFO ] Decomposing Gal with order
[2022-06-12 21:34:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 21:34:58] [INFO ] Removed a total of 35 redundant transitions.
[2022-06-12 21:34:58] [INFO ] Flatten gal took : 50 ms
[2022-06-12 21:34:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2022-06-12 21:34:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18336492515271635242.gal : 8 ms
[2022-06-12 21:34:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17886639673028956309.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality18336492515271635242.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17886639673028956309.prop, --nowitness], 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/ReachabilityCardinality18336492515271635242.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17886639673028956309.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17886639673028956309.prop.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :1 after 420
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :420 after 7.22105e+06
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :7.22105e+06 after 6.30949e+10
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\_mod\_flat,6.49096e+11,0.297209,13556,1874,57,19997,313,741,28522,83,844,0
Total reachable state count : 649096082148

Verifying 5 reachability properties.
Invariant property AutoFlight-PT-06b-ReachabilityCardinality-01 does not hold.
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-06b-ReachabilityCardinality-01,5.29079e+08,0.299016,13820,120,28,19997,313,741,28522,85,844,51
Reachability property AutoFlight-PT-06b-ReachabilityCardinality-04 is true.
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-06b-ReachabilityCardinality-04,1.7496e+06,0.313153,13820,100,23,19997,313,789,28522,89,844,6768
Invariant property AutoFlight-PT-06b-ReachabilityCardinality-05 does not hold.
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-06b-ReachabilityCardinality-05,7.04959e+08,0.33722,13820,213,26,19997,313,824,28522,92,844,16620
Reachability property AutoFlight-PT-06b-ReachabilityCardinality-09 is true.
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-06b-ReachabilityCardinality-09,3.77914e+06,0.338038,13820,95,22,19997,313,824,28522,92,844,16620
Reachability property AutoFlight-PT-06b-ReachabilityCardinality-15 is true.
FORMULA AutoFlight-PT-06b-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

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-06b-ReachabilityCardinality-15,6.61349e+06,0.339002,13820,98,23,19997,313,831,28522,92,844,16638
All properties solved without resorting to model-checking.

BK_STOP 1655069699001

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-06b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2021"
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 gold2021"
echo " Input is AutoFlight-PT-06b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r010-tajo-165245701800173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutoFlight-PT-06b.tgz
mv AutoFlight-PT-06b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;