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.r046-smll-165252115900182.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 DES-PT-30a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r046-smll-165252115900182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.4K Apr 29 15:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 29 15:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Apr 29 15:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 29 15:57 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.6K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 29 16:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 29 16:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 29 16:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K Apr 29 16:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 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 70K 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 DES-PT-30a-ReachabilityCardinality-00
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-01
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-02
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-03
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-04
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-05
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-06
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-07
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-08
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-09
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-10
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-11
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-12
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-13
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-14
FORMULA_NAME DES-PT-30a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1655072480043

Running Version 0
[2022-06-12 22:21:23] [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 22:21:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-12 22:21:23] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2022-06-12 22:21:23] [INFO ] Transformed 234 places.
[2022-06-12 22:21:23] [INFO ] Transformed 191 transitions.
[2022-06-12 22:21:23] [INFO ] Found NUPN structural information;
[2022-06-12 22:21:23] [INFO ] Parsed PT model containing 234 places and 191 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 216 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 15) seen :2
FORMULA DES-PT-30a-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 41 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 177 rows 234 cols
[2022-06-12 22:21:24] [INFO ] Computed 59 place invariants in 37 ms
[2022-06-12 22:21:24] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2022-06-12 22:21:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2022-06-12 22:21:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:24] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2022-06-12 22:21:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:25] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 22:21:25] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 39 ms returned sat
[2022-06-12 22:21:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:26] [INFO ] [Real]Absence check using state equation in 1350 ms returned sat
[2022-06-12 22:21:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:26] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2022-06-12 22:21:26] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 116 ms returned sat
[2022-06-12 22:21:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:27] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2022-06-12 22:21:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-06-12 22:21:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2022-06-12 22:21:28] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 4 ms to minimize.
[2022-06-12 22:21:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
[2022-06-12 22:21:28] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 32 ms.
[2022-06-12 22:21:29] [INFO ] Added : 87 causal constraints over 18 iterations in 990 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 22:21:29] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-06-12 22:21:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-06-12 22:21:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:30] [INFO ] [Real]Absence check using state equation in 918 ms returned sat
[2022-06-12 22:21:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:30] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2022-06-12 22:21:30] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 180 ms returned sat
[2022-06-12 22:21:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:31] [INFO ] [Nat]Absence check using state equation in 994 ms returned sat
[2022-06-12 22:21:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 10 ms returned sat
[2022-06-12 22:21:31] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 19 ms.
[2022-06-12 22:21:32] [INFO ] Added : 124 causal constraints over 25 iterations in 1041 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 39 ms.
[2022-06-12 22:21:32] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-06-12 22:21:32] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2022-06-12 22:21:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:33] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2022-06-12 22:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:33] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-06-12 22:21:33] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2022-06-12 22:21:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:33] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2022-06-12 22:21:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 22:21:33] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 157 ms returned sat
[2022-06-12 22:21:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:34] [INFO ] [Nat]Absence check using state equation in 920 ms returned sat
[2022-06-12 22:21:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:21:34] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2022-06-12 22:21:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2022-06-12 22:21:34] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 17 ms.
[2022-06-12 22:21:36] [INFO ] Added : 139 causal constraints over 28 iterations in 1499 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 22:21:36] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-06-12 22:21:36] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 56 ms returned sat
[2022-06-12 22:21:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:36] [INFO ] [Real]Absence check using state equation in 497 ms returned sat
[2022-06-12 22:21:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:36] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2022-06-12 22:21:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2022-06-12 22:21:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:37] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-06-12 22:21:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-06-12 22:21:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 132 ms returned sat
[2022-06-12 22:21:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:38] [INFO ] [Nat]Absence check using state equation in 1023 ms returned sat
[2022-06-12 22:21:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-06-12 22:21:38] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 21 ms.
[2022-06-12 22:21:38] [INFO ] Added : 83 causal constraints over 17 iterations in 470 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 4 ms.
[2022-06-12 22:21:38] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2022-06-12 22:21:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-06-12 22:21:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:39] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-06-12 22:21:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:21:39] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 208 ms returned sat
[2022-06-12 22:21:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:39] [INFO ] [Nat]Absence check using state equation in 532 ms returned sat
[2022-06-12 22:21:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-06-12 22:21:40] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 20 ms.
[2022-06-12 22:21:40] [INFO ] Added : 108 causal constraints over 22 iterations in 718 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-06-12 22:21:40] [INFO ] [Real]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:21:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2022-06-12 22:21:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:41] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-06-12 22:21:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2022-06-12 22:21:41] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 185 ms returned sat
[2022-06-12 22:21:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:41] [INFO ] [Nat]Absence check using state equation in 350 ms returned sat
[2022-06-12 22:21:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-06-12 22:21:41] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 1 ms to minimize.
[2022-06-12 22:21:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2022-06-12 22:21:41] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 23 ms.
[2022-06-12 22:21:42] [INFO ] Added : 118 causal constraints over 24 iterations in 1084 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2022-06-12 22:21:43] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-06-12 22:21:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2022-06-12 22:21:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:43] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2022-06-12 22:21:43] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-06-12 22:21:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 156 ms returned sat
[2022-06-12 22:21:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:44] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2022-06-12 22:21:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 9 ms returned sat
[2022-06-12 22:21:44] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 0 ms to minimize.
[2022-06-12 22:21:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2022-06-12 22:21:44] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 26 ms.
[2022-06-12 22:21:45] [INFO ] Added : 86 causal constraints over 18 iterations in 632 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-12 22:21:45] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 22:21:45] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2022-06-12 22:21:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:45] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-06-12 22:21:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:46] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-06-12 22:21:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 42 ms returned sat
[2022-06-12 22:21:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:46] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-06-12 22:21:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-12 22:21:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-06-12 22:21:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 143 ms returned sat
[2022-06-12 22:21:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-12 22:21:47] [INFO ] [Nat]Absence check using state equation in 928 ms returned sat
[2022-06-12 22:21:47] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2022-06-12 22:21:47] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2022-06-12 22:21:47] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2022-06-12 22:21:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2022-06-12 22:21:47] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 25 ms.
[2022-06-12 22:21:48] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 1 ms to minimize.
[2022-06-12 22:21:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-06-12 22:21:48] [INFO ] Added : 78 causal constraints over 16 iterations in 1135 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
FORMULA DES-PT-30a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DES-PT-30a-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 13 Parikh solutions to 8 different solutions.
Incomplete Parikh walk after 72600 steps, including 1819 resets, run finished after 404 ms. (steps per millisecond=179 ) properties (out of 8) seen :0 could not realise parikh vector
Incomplete Parikh walk after 111600 steps, including 2785 resets, run finished after 509 ms. (steps per millisecond=219 ) properties (out of 8) seen :1 could not realise parikh vector
FORMULA DES-PT-30a-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 138400 steps, including 3397 resets, run finished after 371 ms. (steps per millisecond=373 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 57600 steps, including 1389 resets, run finished after 154 ms. (steps per millisecond=374 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 91900 steps, including 2249 resets, run finished after 240 ms. (steps per millisecond=382 ) properties (out of 7) seen :0 could not realise parikh vector
Incomplete Parikh walk after 107500 steps, including 1981 resets, run finished after 281 ms. (steps per millisecond=382 ) properties (out of 7) seen :5 could not realise parikh vector
FORMULA DES-PT-30a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-30a-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 61200 steps, including 1500 resets, run finished after 247 ms. (steps per millisecond=247 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 31100 steps, including 327 resets, run finished after 120 ms. (steps per millisecond=259 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 31 out of 234 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 234/234 places, 177/177 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 176
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 233 transition count 175
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 233 transition count 175
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 233 transition count 175
Applied a total of 7 rules in 132 ms. Remains 233 /234 variables (removed 1) and now considering 175/177 (removed 2) transitions.
Finished structural reductions, in 1 iterations. Remains : 233/234 places, 175/177 transitions.
[2022-06-12 22:21:51] [INFO ] Flatten gal took : 121 ms
[2022-06-12 22:21:51] [INFO ] Flatten gal took : 50 ms
[2022-06-12 22:21:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7653622592166924941.gal : 24 ms
[2022-06-12 22:21:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17326241318875418132.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/ReachabilityCardinality7653622592166924941.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality17326241318875418132.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/ReachabilityCardinality7653622592166924941.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality17326241318875418132.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality17326241318875418132.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 11
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :11 after 24
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :24 after 34
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :34 after 769
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :769 after 1037
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1037 after 2881
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :2881 after 90673
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :90673 after 111717
Detected timeout of ITS tools.
[2022-06-12 22:22:07] [INFO ] Flatten gal took : 26 ms
[2022-06-12 22:22:07] [INFO ] Applying decomposition
[2022-06-12 22:22:07] [INFO ] Flatten gal took : 25 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/graph1658687260669994100.txt, -o, /tmp/graph1658687260669994100.bin, -w, /tmp/graph1658687260669994100.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/graph1658687260669994100.bin, -l, -1, -v, -w, /tmp/graph1658687260669994100.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-12 22:22:07] [INFO ] Decomposing Gal with order
[2022-06-12 22:22:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-12 22:22:07] [INFO ] Removed a total of 46 redundant transitions.
[2022-06-12 22:22:07] [INFO ] Flatten gal took : 105 ms
[2022-06-12 22:22:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 17 ms.
[2022-06-12 22:22:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6199582712508160972.gal : 11 ms
[2022-06-12 22:22:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2846192409196858018.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/ReachabilityCardinality6199582712508160972.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality2846192409196858018.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/ReachabilityCardinality6199582712508160972.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality2846192409196858018.prop --nowitness
Loading property file /tmp/ReachabilityCardinality2846192409196858018.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 9
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :9 after 1005
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :1005 after 7271
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :7271 after 7.16786e+08
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :7.16786e+08 after 1.26676e+09
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.26676e+09 after 2.03672e+09
Reachability property DES-PT-30a-ReachabilityCardinality-04 is true.
FORMULA DES-PT-30a-ReachabilityCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.37966e+11 after 3.75821e+11
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4.25751e+12 after 4.74588e+12
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :9.1626e+12 after 9.65097e+12
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,1.3445e+13,9.32558,158108,18260,2686,348733,13296,367,418503,308,79576,0
Total reachable state count : 13444991798181

Verifying 2 reachability properties.
Reachability property DES-PT-30a-ReachabilityCardinality-04 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
DES-PT-30a-ReachabilityCardinality-04,1.94424e+07,9.591,158108,129,241,348733,13296,528,418503,355,79576,74706
Reachability property DES-PT-30a-ReachabilityCardinality-07 is true.
FORMULA DES-PT-30a-ReachabilityCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-30a-ReachabilityCardinality-07,257924,9.61063,158108,231,349,348733,13296,528,418503,356,79576,74706
All properties solved without resorting to model-checking.

BK_STOP 1655072538227

--------------------
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="DES-PT-30a"
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 DES-PT-30a, 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 r046-smll-165252115900182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a 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 ;