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-165286037100102.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-165286037100102
=====================================================================

--------------------
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-ReachabilityFireability-00
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPt-PT-010B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1655071263817

Running Version 0
[2022-06-12 22:01:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-12 22:01:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:01:05] [INFO ] Load time of PNML (sax parser for PT used): 120 ms
[2022-06-12 22:01:05] [INFO ] Transformed 703 places.
[2022-06-12 22:01:05] [INFO ] Transformed 653 transitions.
[2022-06-12 22:01:05] [INFO ] Found NUPN structural information;
[2022-06-12 22:01:05] [INFO ] Parsed PT model containing 703 places and 653 transitions in 189 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 16) seen :13
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :1
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 653 rows 703 cols
[2022-06-12 22:01:06] [INFO ] Computed 91 place invariants in 23 ms
[2022-06-12 22:01:06] [INFO ] [Real]Absence check using 91 positive place invariants in 34 ms returned sat
[2022-06-12 22:01:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:01:06] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-06-12 22:01:07] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 6 ms to minimize.
[2022-06-12 22:01:07] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 1 ms to minimize.
[2022-06-12 22:01:07] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 0 ms to minimize.
[2022-06-12 22:01:07] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 1 ms to minimize.
[2022-06-12 22:01:07] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:01:07] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 1 ms to minimize.
[2022-06-12 22:01:07] [INFO ] Deduced a trap composed of 19 places in 131 ms of which 10 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 25 places in 96 ms of which 0 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 0 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 0 ms to minimize.
[2022-06-12 22:01:08] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2022-06-12 22:01:09] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2022-06-12 22:01:09] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 0 ms to minimize.
[2022-06-12 22:01:09] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 0 ms to minimize.
[2022-06-12 22:01:09] [INFO ] Deduced a trap composed of 24 places in 46 ms of which 1 ms to minimize.
[2022-06-12 22:01:09] [INFO ] Deduced a trap composed of 26 places in 43 ms of which 0 ms to minimize.
[2022-06-12 22:01:09] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 2614 ms
[2022-06-12 22:01:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:01:09] [INFO ] [Nat]Absence check using 91 positive place invariants in 39 ms returned sat
[2022-06-12 22:01:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:01:09] [INFO ] [Nat]Absence check using state equation in 210 ms returned sat
[2022-06-12 22:01:09] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 1 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 31 places in 108 ms of which 1 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 0 ms to minimize.
[2022-06-12 22:01:10] [INFO ] Deduced a trap composed of 26 places in 95 ms of which 0 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 31 places in 87 ms of which 0 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 0 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 0 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 1 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 1 ms to minimize.
[2022-06-12 22:01:11] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2022-06-12 22:01:12] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
[2022-06-12 22:01:12] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 1 ms to minimize.
[2022-06-12 22:01:12] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 0 ms to minimize.
[2022-06-12 22:01:12] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 0 ms to minimize.
[2022-06-12 22:01:12] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
[2022-06-12 22:01:12] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 2514 ms
[2022-06-12 22:01:12] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 45 ms.
[2022-06-12 22:01:14] [INFO ] Deduced a trap composed of 19 places in 202 ms of which 1 ms to minimize.
[2022-06-12 22:01:14] [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 22:01:14] [INFO ] [Real]Absence check using 91 positive place invariants in 33 ms returned sat
[2022-06-12 22:01:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:01:15] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2022-06-12 22:01:15] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 0 ms to minimize.
[2022-06-12 22:01:15] [INFO ] Deduced a trap composed of 20 places in 117 ms of which 1 ms to minimize.
[2022-06-12 22:01:15] [INFO ] Deduced a trap composed of 20 places in 114 ms of which 1 ms to minimize.
[2022-06-12 22:01:15] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:01:15] [INFO ] Deduced a trap composed of 19 places in 102 ms of which 0 ms to minimize.
[2022-06-12 22:01:15] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 1 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 1 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 1 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 1 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 0 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 0 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 8 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 0 ms to minimize.
[2022-06-12 22:01:16] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 0 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 24 places in 71 ms of which 0 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 0 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 0 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 0 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2022-06-12 22:01:17] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 2750 ms
[2022-06-12 22:01:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:01:18] [INFO ] [Nat]Absence check using 91 positive place invariants in 31 ms returned sat
[2022-06-12 22:01:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:01:18] [INFO ] [Nat]Absence check using state equation in 208 ms returned sat
[2022-06-12 22:01:18] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 0 ms to minimize.
[2022-06-12 22:01:18] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:01:18] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 1 ms to minimize.
[2022-06-12 22:01:18] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2022-06-12 22:01:18] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 0 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 1 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 0 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 1 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 20 places in 82 ms of which 0 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 1 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 25 places in 74 ms of which 1 ms to minimize.
[2022-06-12 22:01:19] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 1 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 1 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 0 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 22 places in 77 ms of which 1 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 0 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 1 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2022-06-12 22:01:20] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 0 ms to minimize.
[2022-06-12 22:01:21] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2022-06-12 22:01:21] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 2884 ms
[2022-06-12 22:01:21] [INFO ] Computed and/alt/rep : 652/983/652 causal constraints (skipped 0 transitions) in 37 ms.
[2022-06-12 22:01: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 1
Fused 2 Parikh solutions to 1 different solutions.
Support contains 6 out of 703 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 703/703 places, 653/653 transitions.
Drop transitions removed 167 transitions
Trivial Post-agglo rules discarded 167 transitions
Performed 167 trivial Post agglomeration. Transition count delta: 167
Iterating post reduction 0 with 167 rules applied. Total rules applied 167 place count 703 transition count 486
Reduce places removed 167 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 169 rules applied. Total rules applied 336 place count 536 transition count 484
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 337 place count 535 transition count 484
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 337 place count 535 transition count 441
Deduced a syphon composed of 43 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 423 place count 492 transition count 441
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 493 place count 422 transition count 371
Iterating global reduction 3 with 70 rules applied. Total rules applied 563 place count 422 transition count 371
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 563 place count 422 transition count 343
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 619 place count 394 transition count 343
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 957 place count 225 transition count 174
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 1013 place count 197 transition count 191
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1014 place count 197 transition count 190
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 4 with 10 rules applied. Total rules applied 1024 place count 197 transition count 190
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1025 place count 196 transition count 189
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1027 place count 194 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1027 place count 194 transition count 188
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1029 place count 193 transition count 188
Applied a total of 1029 rules in 169 ms. Remains 193 /703 variables (removed 510) and now considering 188/653 (removed 465) transitions.
Finished structural reductions, in 1 iterations. Remains : 193/703 places, 188/653 transitions.
[2022-06-12 22:01:23] [INFO ] Flatten gal took : 59 ms
[2022-06-12 22:01:23] [INFO ] Flatten gal took : 22 ms
[2022-06-12 22:01:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3751915542089498177.gal : 13 ms
[2022-06-12 22:01:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality392043554270269150.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/ReachabilityCardinality3751915542089498177.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality392043554270269150.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/ReachabilityCardinality3751915542089498177.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality392043554270269150.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality392043554270269150.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :16 after 44
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :44 after 64
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :64 after 229
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :229 after 288
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :288 after 515
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :515 after 8126
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :8126 after 129799
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :129799 after 2.3279e+07
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-12 is true.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.3279e+07 after 1.76344e+10
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.76344e+10 after 2.74906e+11
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2.74906e+11 after 4.98557e+12
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :4.98557e+12 after 9.41633e+13
Detected timeout of ITS tools.
[2022-06-12 22:01:38] [INFO ] Flatten gal took : 18 ms
[2022-06-12 22:01:38] [INFO ] Applying decomposition
[2022-06-12 22:01:38] [INFO ] Flatten gal took : 17 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/graph15723331638419621215.txt, -o, /tmp/graph15723331638419621215.bin, -w, /tmp/graph15723331638419621215.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/graph15723331638419621215.bin, -l, -1, -v, -w, /tmp/graph15723331638419621215.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:01:38] [INFO ] Decomposing Gal with order
[2022-06-12 22:01:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:01:38] [INFO ] Removed a total of 180 redundant transitions.
[2022-06-12 22:01:38] [INFO ] Flatten gal took : 60 ms
[2022-06-12 22:01:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 11 ms.
[2022-06-12 22:01:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1875938542760448294.gal : 5 ms
[2022-06-12 22:01:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1240967499966129595.prop : 3 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/ReachabilityCardinality1875938542760448294.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality1240967499966129595.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/ReachabilityCardinality1875938542760448294.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality1240967499966129595.prop --nowitness
Loading property file /tmp/ReachabilityCardinality1240967499966129595.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :384 after 1.02975e+20
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-10 is true.
FORMULA ShieldIIPt-PT-010B-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 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\_mod\_flat,6.8725e+27,4.15267,87084,1385,88,132440,395,401,471923,68,2812,0
Total reachable state count : 6872503632395615753866313728

Verifying 1 reachability properties.
Reachability property ShieldIIPt-PT-010B-ReachabilityFireability-10 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ShieldIIPt-PT-010B-ReachabilityFireability-10,5.06655e+21,4.16029,87348,128,25,132440,395,434,471923,75,2812,0
All properties solved without resorting to model-checking.

BK_STOP 1655071303871

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldIIPt-PT-010B"
export BK_EXAMINATION="ReachabilityFireability"
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 ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r233-tall-165286037100102"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;