Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r233-tall-165286037100101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is ShieldIIPt-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037100101
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 9.3K Apr 29 18:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 111K Apr 29 18:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 18:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 18:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Apr 29 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 18:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 18:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 167K May 10 09:34 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 ShieldIIPt-PT-010B-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655071192761

Running Version 0
[2022-06-12 21:59:54] [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:59:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 21:59:54] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2022-06-12 21:59:54] [INFO ] Transformed 703 places.
[2022-06-12 21:59:54] [INFO ] Transformed 653 transitions.
[2022-06-12 21:59:54] [INFO ] Found NUPN structural information;
[2022-06-12 21:59:54] [INFO ] Parsed PT model containing 703 places and 653 transitions in 130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 72 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 13) seen :6
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 653 rows 703 cols
[2022-06-12 21:59:54] [INFO ] Computed 91 place invariants in 16 ms
[2022-06-12 21:59:55] [INFO ] [Real]Absence check using 91 positive place invariants in 36 ms returned sat
[2022-06-12 21:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:59:55] [INFO ] [Real]Absence check using state equation in 262 ms returned sat
[2022-06-12 21:59:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:59:55] [INFO ] [Real]Absence check using 91 positive place invariants in 37 ms returned sat
[2022-06-12 21:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:59:55] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2022-06-12 21:59:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:59:56] [INFO ] [Real]Absence check using 91 positive place invariants in 30 ms returned sat
[2022-06-12 21:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:59:56] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-06-12 21:59:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:59:56] [INFO ] [Real]Absence check using 91 positive place invariants in 28 ms returned sat
[2022-06-12 21:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 21:59:56] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 19 places in 166 ms of which 4 ms to minimize.
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 1 ms to minimize.
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 24 places in 81 ms of which 1 ms to minimize.
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-06-12 21:59:57] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 22 places in 95 ms of which 1 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Deduced a trap composed of 18 places in 25 ms of which 1 ms to minimize.
[2022-06-12 21:59:58] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1897 ms
[2022-06-12 21:59:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 21:59:58] [INFO ] [Nat]Absence check using 91 positive place invariants in 29 ms returned sat
[2022-06-12 21:59:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 21:59:59] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2022-06-12 21:59:59] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 1 ms to minimize.
[2022-06-12 21:59:59] [INFO ] Deduced a trap composed of 19 places in 88 ms of which 1 ms to minimize.
[2022-06-12 21:59:59] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 0 ms to minimize.
[2022-06-12 21:59:59] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2022-06-12 21:59:59] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2022-06-12 21:59:59] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-06-12 21:59:59] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 4 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 26 places in 31 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 31 places in 29 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Deduced a trap composed of 25 places in 27 ms of which 0 ms to minimize.
[2022-06-12 22:00:00] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1826 ms
[2022-06-12 22:00:01] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 34 ms.
[2022-06-12 22:00:03] [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 22:00:04] [INFO ] [Real]Absence check using 91 positive place invariants in 40 ms returned sat
[2022-06-12 22:00:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:00:04] [INFO ] [Real]Absence check using state equation in 340 ms returned sat
[2022-06-12 22:00:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:00:04] [INFO ] [Nat]Absence check using 91 positive place invariants in 41 ms returned sat
[2022-06-12 22:00:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:00:04] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 1 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 19 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 27 places in 86 ms of which 0 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:00:05] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:00:06] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 0 ms to minimize.
[2022-06-12 22:00:06] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2022-06-12 22:00:06] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 0 ms to minimize.
[2022-06-12 22:00:06] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1400 ms
[2022-06-12 22:00:06] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 34 ms.
[2022-06-12 22:00:09] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2022-06-12 22:00:09] [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 4
[2022-06-12 22:00:09] [INFO ] [Real]Absence check using 91 positive place invariants in 31 ms returned sat
[2022-06-12 22:00:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:00:10] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2022-06-12 22:00:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:00:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 32 ms returned sat
[2022-06-12 22:00:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:00:10] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2022-06-12 22:00:10] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2022-06-12 22:00:10] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:00:10] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:00:10] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 8 ms to minimize.
[2022-06-12 22:00:11] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 0 ms to minimize.
[2022-06-12 22:00:11] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:00:11] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 0 ms to minimize.
[2022-06-12 22:00:11] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:00:11] [INFO ] Deduced a trap composed of 44 places in 106 ms of which 1 ms to minimize.
[2022-06-12 22:00:11] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2022-06-12 22:00:11] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 0 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 2 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 0 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 18 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 0 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2022-06-12 22:00:12] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 25 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2022-06-12 22:00:13] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2022-06-12 22:00:14] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2022-06-12 22:00:14] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2022-06-12 22:00:14] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 0 ms to minimize.
[2022-06-12 22:00:14] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2022-06-12 22:00:14] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 0 ms to minimize.
[2022-06-12 22:00:14] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2022-06-12 22:00:14] [INFO ] Trap strengthening (SAT) tested/added 36/35 trap constraints in 3956 ms
[2022-06-12 22:00:14] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 32 ms.
[2022-06-12 22:00:15] [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 22:00:15] [INFO ] [Real]Absence check using 91 positive place invariants in 38 ms returned sat
[2022-06-12 22:00:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:00:15] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2022-06-12 22:00:15] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:00:15] [INFO ] [Nat]Absence check using 91 positive place invariants in 38 ms returned sat
[2022-06-12 22:00:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:00:16] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2022-06-12 22:00:16] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2022-06-12 22:00:16] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 0 ms to minimize.
[2022-06-12 22:00:16] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 0 ms to minimize.
[2022-06-12 22:00:16] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 0 ms to minimize.
[2022-06-12 22:00:16] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2022-06-12 22:00:16] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2022-06-12 22:00:16] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 1 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 0 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 0 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 0 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 0 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 0 ms to minimize.
[2022-06-12 22:00:17] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1309 ms
[2022-06-12 22:00:17] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 34 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-06-12 22:00:20] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 0 ms to minimize.
[2022-06-12 22:00:20] [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 6
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-04 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 7 Parikh solutions to 1 different solutions.
Support contains 104 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 703 transition count 550
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 105 rules applied. Total rules applied 208 place count 600 transition count 548
Reduce places removed 1 places and 0 transitions.
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Iterating post reduction 2 with 22 rules applied. Total rules applied 230 place count 599 transition count 527
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 251 place count 578 transition count 527
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 251 place count 578 transition count 483
Deduced a syphon composed of 44 places in 2 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 339 place count 534 transition count 483
Discarding 49 places :
Symmetric choice reduction at 4 with 49 rule applications. Total rules 388 place count 485 transition count 434
Iterating global reduction 4 with 49 rules applied. Total rules applied 437 place count 485 transition count 434
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 437 place count 485 transition count 420
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 465 place count 471 transition count 420
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 4 with 262 rules applied. Total rules applied 727 place count 340 transition count 289
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 751 place count 328 transition count 289
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 756 place count 328 transition count 284
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 761 place count 323 transition count 284
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 766 place count 323 transition count 284
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 767 place count 322 transition count 283
Applied a total of 767 rules in 185 ms. Remains 322 /703 variables (removed 381) and now considering 283/653 (removed 370) transitions.
Finished structural reductions, in 1 iterations. Remains : 322/703 places, 283/653 transitions.
[2022-06-12 22:00:21] [INFO ] Flatten gal took : 58 ms
[2022-06-12 22:00:21] [INFO ] Flatten gal took : 28 ms
[2022-06-12 22:00:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17164544613576668459.gal : 12 ms
[2022-06-12 22:00:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9818773118526264362.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/ReachabilityCardinality17164544613576668459.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality9818773118526264362.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/ReachabilityCardinality17164544613576668459.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality9818773118526264362.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality9818773118526264362.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 8
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :8 after 14
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :14 after 167
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :167 after 3083
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :3083 after 1.50878e+06
Detected timeout of ITS tools.
[2022-06-12 22:00:36] [INFO ] Flatten gal took : 25 ms
[2022-06-12 22:00:36] [INFO ] Applying decomposition
[2022-06-12 22:00:36] [INFO ] Flatten gal took : 19 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/graph673273388111652787.txt, -o, /tmp/graph673273388111652787.bin, -w, /tmp/graph673273388111652787.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/graph673273388111652787.bin, -l, -1, -v, -w, /tmp/graph673273388111652787.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:00:36] [INFO ] Decomposing Gal with order
[2022-06-12 22:00:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:00:36] [INFO ] Removed a total of 76 redundant transitions.
[2022-06-12 22:00:36] [INFO ] Flatten gal took : 55 ms
[2022-06-12 22:00:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 44 labels/synchronizations in 16 ms.
[2022-06-12 22:00:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8080273865185791544.gal : 12 ms
[2022-06-12 22:00:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17176220674049001518.prop : 2 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/ReachabilityCardinality8080273865185791544.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17176220674049001518.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/ReachabilityCardinality8080273865185791544.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17176220674049001518.prop --nowitness
Loading property file /tmp/ReachabilityCardinality17176220674049001518.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 5
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :5 after 721
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :721 after 10689
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :10689 after 1.53465e+07
Invariant property ShieldIIPt-PT-010B-ReachabilityCardinality-15 does not hold.
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property ShieldIIPt-PT-010B-ReachabilityCardinality-12 is true.
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Invariant property ShieldIIPt-PT-010B-ReachabilityCardinality-10 does not hold.
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1.35908e+14 after 4.19857e+20
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15249309536276051345
[2022-06-12 22:00:51] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15249309536276051345
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15249309536276051345]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15249309536276051345] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin15249309536276051345] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Finished random walk after 153872 steps, including 0 resets, run visited all 1 properties in 434 ms. (steps per millisecond=354 )
FORMULA ShieldIIPt-PT-010B-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1655071254222

--------------------
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="ShieldIIPt-PT-010B"
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 ShieldIIPt-PT-010B, 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 r233-tall-165286037100101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-010B.tgz
mv ShieldIIPt-PT-010B 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 ;