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.r305-smll-165463878400059.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 StigmergyCommit-PT-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K May 30 14:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 30 14:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 30 14:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 25 13:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 13:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 13:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 7.4K May 30 14:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K May 30 14:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 30 14:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K May 30 14:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 25 13:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 1.8M May 29 12:20 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 StigmergyCommit-PT-06a-ReachabilityCardinality-00
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-01
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-02
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-03
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-04
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-05
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-06
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-07
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-08
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-09
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-10
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-11
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-12
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-13
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-14
FORMULA_NAME StigmergyCommit-PT-06a-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654719760781

Running Version 0
[2022-06-08 20:22:43] [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-08 20:22:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 20:22:44] [INFO ] Load time of PNML (sax parser for PT used): 494 ms
[2022-06-08 20:22:44] [INFO ] Transformed 256 places.
[2022-06-08 20:22:44] [INFO ] Transformed 2816 transitions.
[2022-06-08 20:22:44] [INFO ] Found NUPN structural information;
[2022-06-08 20:22:44] [INFO ] Parsed PT model containing 256 places and 2816 transitions in 603 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 20 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2229 transitions
Reduce redundant transitions removed 2229 transitions.
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 234 ms. (steps per millisecond=42 ) properties (out of 14) seen :4
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-03 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 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2022-06-08 20:22:44] [INFO ] Flow matrix only has 566 transitions (discarded 21 similar events)
// Phase 1: matrix 566 rows 256 cols
[2022-06-08 20:22:45] [INFO ] Computed 8 place invariants in 37 ms
[2022-06-08 20:22:45] [INFO ] [Real]Absence check using 8 positive place invariants in 25 ms returned sat
[2022-06-08 20:22:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:45] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2022-06-08 20:22:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:45] [INFO ] [Nat]Absence check using 8 positive place invariants in 11 ms returned sat
[2022-06-08 20:22:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:45] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2022-06-08 20:22:46] [INFO ] State equation strengthened by 351 read => feed constraints.
[2022-06-08 20:22:46] [INFO ] [Nat]Added 351 Read/Feed constraints in 94 ms returned sat
[2022-06-08 20:22:46] [INFO ] Deduced a trap composed of 16 places in 311 ms of which 17 ms to minimize.
[2022-06-08 20:22:46] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 3 ms to minimize.
[2022-06-08 20:22:47] [INFO ] Deduced a trap composed of 16 places in 225 ms of which 2 ms to minimize.
[2022-06-08 20:22:47] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2022-06-08 20:22:47] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2022-06-08 20:22:47] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 0 ms to minimize.
[2022-06-08 20:22:47] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 4 ms to minimize.
[2022-06-08 20:22:47] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 2 ms to minimize.
[2022-06-08 20:22:47] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 1 ms to minimize.
[2022-06-08 20:22:48] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 0 ms to minimize.
[2022-06-08 20:22:48] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-06-08 20:22:48] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2023 ms
[2022-06-08 20:22:48] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 118 ms.
[2022-06-08 20:22:50] [INFO ] Deduced a trap composed of 2 places in 320 ms of which 1 ms to minimize.
[2022-06-08 20:22:50] [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-08 20:22:51] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:51] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2022-06-08 20:22:51] [INFO ] [Real]Added 351 Read/Feed constraints in 149 ms returned sat
[2022-06-08 20:22:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2022-06-08 20:22:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:51] [INFO ] [Nat]Absence check using state equation in 258 ms returned sat
[2022-06-08 20:22:52] [INFO ] [Nat]Added 351 Read/Feed constraints in 149 ms returned sat
[2022-06-08 20:22:52] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 1 ms to minimize.
[2022-06-08 20:22:52] [INFO ] Deduced a trap composed of 16 places in 204 ms of which 1 ms to minimize.
[2022-06-08 20:22:52] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 1 ms to minimize.
[2022-06-08 20:22:53] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 1 ms to minimize.
[2022-06-08 20:22:53] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 1 ms to minimize.
[2022-06-08 20:22:53] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2022-06-08 20:22:53] [INFO ] Deduced a trap composed of 16 places in 289 ms of which 0 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 1 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 0 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 1 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 0 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 0 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2022-06-08 20:22:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2691 ms
[2022-06-08 20:22:54] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 73 ms.
[2022-06-08 20:22:56] [INFO ] Added : 190 causal constraints over 38 iterations in 1793 ms. Result :unknown
[2022-06-08 20:22:56] [INFO ] [Real]Absence check using 8 positive place invariants in 10 ms returned sat
[2022-06-08 20:22:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:56] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2022-06-08 20:22:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 20:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:57] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2022-06-08 20:22:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:57] [INFO ] [Real]Absence check using 8 positive place invariants in 7 ms returned sat
[2022-06-08 20:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:57] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2022-06-08 20:22:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:57] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2022-06-08 20:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:57] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2022-06-08 20:22:57] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:57] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 20:22:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:58] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2022-06-08 20:22:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:58] [INFO ] [Real]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 20:22:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:58] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2022-06-08 20:22:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:22:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 8 ms returned sat
[2022-06-08 20:22:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:22:58] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2022-06-08 20:22:58] [INFO ] [Nat]Added 351 Read/Feed constraints in 77 ms returned sat
[2022-06-08 20:22:58] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 1 ms to minimize.
[2022-06-08 20:22:59] [INFO ] Deduced a trap composed of 16 places in 229 ms of which 1 ms to minimize.
[2022-06-08 20:22:59] [INFO ] Deduced a trap composed of 16 places in 169 ms of which 1 ms to minimize.
[2022-06-08 20:22:59] [INFO ] Deduced a trap composed of 18 places in 136 ms of which 1 ms to minimize.
[2022-06-08 20:22:59] [INFO ] Deduced a trap composed of 16 places in 137 ms of which 1 ms to minimize.
[2022-06-08 20:22:59] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 1 ms to minimize.
[2022-06-08 20:22:59] [INFO ] Deduced a trap composed of 16 places in 101 ms of which 1 ms to minimize.
[2022-06-08 20:23:00] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 2 ms to minimize.
[2022-06-08 20:23:00] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 10 ms to minimize.
[2022-06-08 20:23:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2022-06-08 20:23:00] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2022-06-08 20:23:00] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1763 ms
[2022-06-08 20:23:00] [INFO ] Computed and/alt/rep : 289/366/289 causal constraints (skipped 276 transitions) in 57 ms.
[2022-06-08 20:23:03] [INFO ] Added : 282 causal constraints over 57 iterations in 2923 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2022-06-08 20:23:03] [INFO ] [Real]Absence check using 8 positive place invariants in 13 ms returned sat
[2022-06-08 20:23:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:03] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2022-06-08 20:23:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:23:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 15 ms returned sat
[2022-06-08 20:23:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:04] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2022-06-08 20:23:04] [INFO ] [Nat]Added 351 Read/Feed constraints in 155 ms returned sat
[2022-06-08 20:23:04] [INFO ] Deduced a trap composed of 17 places in 159 ms of which 0 ms to minimize.
[2022-06-08 20:23:04] [INFO ] Deduced a trap composed of 17 places in 134 ms of which 0 ms to minimize.
[2022-06-08 20:23:04] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2022-06-08 20:23:04] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2022-06-08 20:23:05] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2022-06-08 20:23:05] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2022-06-08 20:23:05] [INFO ] Deduced a trap composed of 16 places in 142 ms of which 0 ms to minimize.
[2022-06-08 20:23:05] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 1 ms to minimize.
[2022-06-08 20:23:05] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 1 ms to minimize.
[2022-06-08 20:23:05] [INFO ] Deduced a trap composed of 16 places in 110 ms of which 1 ms to minimize.
[2022-06-08 20:23:06] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 0 ms to minimize.
[2022-06-08 20:23:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 11 trap constraints in 1698 ms
[2022-06-08 20:23:06] [INFO ] [Real]Absence check using 8 positive place invariants in 14 ms returned sat
[2022-06-08 20:23:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:06] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2022-06-08 20:23:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 20:23:06] [INFO ] [Nat]Absence check using 8 positive place invariants in 16 ms returned sat
[2022-06-08 20:23:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 20:23:06] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-06-08 20:23:07] [INFO ] [Nat]Added 351 Read/Feed constraints in 173 ms returned sat
[2022-06-08 20:23:07] [INFO ] Deduced a trap composed of 16 places in 246 ms of which 1 ms to minimize.
[2022-06-08 20:23:07] [INFO ] Deduced a trap composed of 17 places in 290 ms of which 3 ms to minimize.
[2022-06-08 20:23:07] [INFO ] Deduced a trap composed of 16 places in 243 ms of which 1 ms to minimize.
[2022-06-08 20:23:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 904 ms
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-05 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 10 Parikh solutions to 2 different solutions.
Finished Parikh walk after 22034 steps, including 35 resets, run visited all 3 properties in 385 ms. (steps per millisecond=57 )
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyCommit-PT-06a-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.

BK_STOP 1654719789405

--------------------
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="StigmergyCommit-PT-06a"
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 StigmergyCommit-PT-06a, 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 r305-smll-165463878400059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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