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-165245701700161.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-04b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-tajo-165245701700161
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.2K Apr 30 01:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 30 01:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 01:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 01:30 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.7K May 9 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 30 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 30 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 99K Apr 30 01:31 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 91K 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-04b-ReachabilityCardinality-00
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-01
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-02
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-03
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-04
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-05
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-06
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-07
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-08
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-09
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-10
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-11
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-12
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-13
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-14
FORMULA_NAME AutoFlight-PT-04b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655069581835

Running Version 0
[2022-06-12 21:33:03] [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:33:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:33:03] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2022-06-12 21:33:03] [INFO ] Transformed 390 places.
[2022-06-12 21:33:03] [INFO ] Transformed 388 transitions.
[2022-06-12 21:33:03] [INFO ] Found NUPN structural information;
[2022-06-12 21:33:03] [INFO ] Parsed PT model containing 390 places and 388 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 50 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 15) seen :5
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 388 rows 390 cols
[2022-06-12 21:33:04] [INFO ] Computed 28 place invariants in 23 ms
[2022-06-12 21:33:04] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-06-12 21:33:04] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-12 21:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:04] [INFO ] [Real]Absence check using state equation in 104 ms returned sat
[2022-06-12 21:33:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:04] [INFO ] [Nat]Absence check using 27 positive place invariants in 12 ms returned sat
[2022-06-12 21:33:04] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:04] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-06-12 21:33:04] [INFO ] Deduced a trap composed of 18 places in 126 ms of which 4 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 101 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 69 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:33:05] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 16 ms to minimize.
[2022-06-12 21:33:06] [INFO ] Deduced a trap composed of 67 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:33:06] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 1 ms to minimize.
[2022-06-12 21:33:06] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1366 ms
[2022-06-12 21:33:06] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 21 ms.
[2022-06-12 21:33:08] [INFO ] Added : 355 causal constraints over 72 iterations in 1890 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:08] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2022-06-12 21:33:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:08] [INFO ] [Nat]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:08] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2022-06-12 21:33:08] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2022-06-12 21:33:08] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:33:08] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:33:08] [INFO ] Deduced a trap composed of 55 places in 69 ms of which 0 ms to minimize.
[2022-06-12 21:33:08] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:33:09] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:33:09] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:33:09] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2022-06-12 21:33:09] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 735 ms
[2022-06-12 21:33:09] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 28 ms.
[2022-06-12 21:33:11] [INFO ] Added : 356 causal constraints over 72 iterations in 1770 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using state equation in 258 ms returned sat
[2022-06-12 21:33:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using 27 positive place invariants in 10 ms returned sat
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2022-06-12 21:33:11] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:11] [INFO ] [Real]Absence check using state equation in 135 ms returned sat
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 1 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 0 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 43 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 0 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 0 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Deduced a trap composed of 43 places in 59 ms of which 0 ms to minimize.
[2022-06-12 21:33:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 836 ms
[2022-06-12 21:33:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:12] [INFO ] [Nat]Absence check using 27 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:12] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:13] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 6 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 43 places in 78 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:33:13] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 848 ms
[2022-06-12 21:33:13] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 22 ms.
[2022-06-12 21:33:15] [INFO ] Added : 375 causal constraints over 75 iterations in 2010 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using 27 positive place invariants in 13 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using state equation in 113 ms returned sat
[2022-06-12 21:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using 27 positive place invariants in 11 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 4 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:16] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2022-06-12 21:33:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:16] [INFO ] [Nat]Absence check using 27 positive place invariants in 17 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:16] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2022-06-12 21:33:16] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:33:16] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2022-06-12 21:33:16] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 76 places in 65 ms of which 1 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 67 places in 64 ms of which 1 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2022-06-12 21:33:17] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 637 ms
[2022-06-12 21:33:17] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 22 ms.
[2022-06-12 21:33:19] [INFO ] Added : 381 causal constraints over 77 iterations in 1756 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 21:33:19] [INFO ] [Real]Absence check using 27 positive place invariants in 12 ms returned sat
[2022-06-12 21:33:19] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:19] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2022-06-12 21:33:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:19] [INFO ] [Nat]Absence check using 27 positive place invariants in 16 ms returned sat
[2022-06-12 21:33:19] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:19] [INFO ] [Nat]Absence check using state equation in 199 ms returned sat
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:33:19] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 0 ms to minimize.
[2022-06-12 21:33:20] [INFO ] Deduced a trap composed of 41 places in 78 ms of which 0 ms to minimize.
[2022-06-12 21:33:20] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 0 ms to minimize.
[2022-06-12 21:33:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 570 ms
[2022-06-12 21:33:20] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2022-06-12 21:33:20] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-12 21:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:20] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2022-06-12 21:33:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:20] [INFO ] [Real]Absence check using 27 positive place invariants in 18 ms returned sat
[2022-06-12 21:33:20] [INFO ] [Real]Absence check using 27 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-12 21:33:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:20] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 1 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 10 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 36 places in 102 ms of which 1 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 1 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 48 places in 84 ms of which 0 ms to minimize.
[2022-06-12 21:33:21] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 38 places in 86 ms of which 0 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 0 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1401 ms
[2022-06-12 21:33:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:33:22] [INFO ] [Nat]Absence check using 27 positive place invariants in 17 ms returned sat
[2022-06-12 21:33:22] [INFO ] [Nat]Absence check using 27 positive and 1 generalized place invariants in 17 ms returned sat
[2022-06-12 21:33:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:33:22] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2022-06-12 21:33:22] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 36 places in 65 ms of which 0 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 0 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Deduced a trap composed of 56 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:33:23] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1106 ms
[2022-06-12 21:33:23] [INFO ] Computed and/alt/rep : 387/521/387 causal constraints (skipped 0 transitions) in 22 ms.
[2022-06-12 21:33:25] [INFO ] Added : 382 causal constraints over 77 iterations in 2120 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 9 ms.
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 5 different solutions.
Incomplete Parikh walk after 41200 steps, including 203 resets, run finished after 189 ms. (steps per millisecond=217 ) properties (out of 5) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 21900 steps, including 116 resets, run finished after 68 ms. (steps per millisecond=322 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 36000 steps, including 163 resets, run finished after 87 ms. (steps per millisecond=413 ) properties (out of 3) seen :1 could not realise parikh vector
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 43900 steps, including 222 resets, run finished after 193 ms. (steps per millisecond=227 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 48900 steps, including 233 resets, run finished after 141 ms. (steps per millisecond=346 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 26 out of 390 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 390/390 places, 388/388 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 390 transition count 269
Reduce places removed 119 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 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 141 rules applied. Total rules applied 260 place count 271 transition count 247
Reduce places removed 6 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 18 rules applied. Total rules applied 278 place count 265 transition count 235
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 291 place count 253 transition count 234
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 50 Pre rules applied. Total rules applied 291 place count 253 transition count 184
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 391 place count 203 transition count 184
Discarding 30 places :
Symmetric choice reduction at 4 with 30 rule applications. Total rules 421 place count 173 transition count 154
Iterating global reduction 4 with 30 rules applied. Total rules applied 451 place count 173 transition count 154
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 452 place count 173 transition count 153
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 452 place count 173 transition count 145
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 468 place count 165 transition count 145
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 538 place count 130 transition count 110
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 540 place count 130 transition count 108
Free-agglomeration rule applied 14 times.
Iterating global reduction 5 with 14 rules applied. Total rules applied 554 place count 130 transition count 94
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 568 place count 116 transition count 94
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 569 place count 115 transition count 93
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 572 place count 112 transition count 93
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 572 place count 112 transition count 90
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 578 place count 109 transition count 90
Applied a total of 578 rules in 111 ms. Remains 109 /390 variables (removed 281) and now considering 90/388 (removed 298) transitions.
Finished structural reductions, in 1 iterations. Remains : 109/390 places, 90/388 transitions.
[2022-06-12 21:33:27] [INFO ] Flatten gal took : 50 ms
[2022-06-12 21:33:27] [INFO ] Flatten gal took : 13 ms
[2022-06-12 21:33:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6431526430686226232.gal : 9 ms
[2022-06-12 21:33:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2355363367879676667.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/ReachabilityCardinality6431526430686226232.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2355363367879676667.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/ReachabilityCardinality6431526430686226232.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2355363367879676667.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality2355363367879676667.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :3 after 5
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :5 after 15
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :15 after 21
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :21 after 51
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :51 after 1659
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :1659 after 5211
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5211 after 34195
Reachability property AutoFlight-PT-04b-ReachabilityCardinality-05 is true.
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :34195 after 58256
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :58256 after 190617
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :190617 after 1.0016e+06
Reachability property AutoFlight-PT-04b-ReachabilityCardinality-14 is true.
FORMULA AutoFlight-PT-04b-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 2049 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,6.88822e+06,8.5244,11076,2,6522,19,27823,6,0,500,30026,0
Total reachable state count : 6888221

Verifying 2 reachability properties.
Reachability property AutoFlight-PT-04b-ReachabilityCardinality-05 is true.

Detected timeout of ITS tools.
All properties solved without resorting to model-checking.

BK_STOP 1655069622619

--------------------
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-04b"
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-04b, 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-165245701700161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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