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-165463878400116.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 StigmergyElection-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878400116
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 6.9K May 30 14:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 30 14:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 30 14:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 30 14:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 25 13:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 25 13:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 25 13:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 12K May 30 14:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K May 30 14:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 25 13:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 25 13:04 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 428K 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 StigmergyElection-PT-05b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-05b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654731040839

Running Version 0
[2022-06-08 23:30:44] [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 23:30:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:30:44] [INFO ] Load time of PNML (sax parser for PT used): 290 ms
[2022-06-08 23:30:44] [INFO ] Transformed 699 places.
[2022-06-08 23:30:44] [INFO ] Transformed 1266 transitions.
[2022-06-08 23:30:44] [INFO ] Found NUPN structural information;
[2022-06-08 23:30:44] [INFO ] Parsed PT model containing 699 places and 1266 transitions in 383 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 112 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 15) seen :7
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1266 rows 699 cols
[2022-06-08 23:30:45] [INFO ] Computed 6 place invariants in 57 ms
[2022-06-08 23:30:45] [INFO ] [Real]Absence check using 6 positive place invariants in 40 ms returned sat
[2022-06-08 23:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:47] [INFO ] [Real]Absence check using state equation in 1218 ms returned sat
[2022-06-08 23:30:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:30:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 25 ms returned sat
[2022-06-08 23:30:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:48] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2022-06-08 23:30:48] [INFO ] Deduced a trap composed of 189 places in 668 ms of which 6 ms to minimize.
[2022-06-08 23:30:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 756 ms
[2022-06-08 23:30:49] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned sat
[2022-06-08 23:30:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:49] [INFO ] [Real]Absence check using state equation in 656 ms returned sat
[2022-06-08 23:30:50] [INFO ] Deduced a trap composed of 202 places in 863 ms of which 3 ms to minimize.
[2022-06-08 23:30:51] [INFO ] Deduced a trap composed of 114 places in 688 ms of which 2 ms to minimize.
[2022-06-08 23:30:52] [INFO ] Deduced a trap composed of 199 places in 696 ms of which 2 ms to minimize.
[2022-06-08 23:30:52] [INFO ] Deduced a trap composed of 193 places in 555 ms of which 1 ms to minimize.
[2022-06-08 23:30:53] [INFO ] Deduced a trap composed of 248 places in 457 ms of which 1 ms to minimize.
[2022-06-08 23:30:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3676 ms
[2022-06-08 23:30:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:30:53] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2022-06-08 23:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:54] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2022-06-08 23:30:55] [INFO ] Deduced a trap composed of 202 places in 814 ms of which 2 ms to minimize.
[2022-06-08 23:30:55] [INFO ] Deduced a trap composed of 110 places in 582 ms of which 3 ms to minimize.
[2022-06-08 23:30:56] [INFO ] Deduced a trap composed of 189 places in 867 ms of which 2 ms to minimize.
[2022-06-08 23:30:57] [INFO ] Deduced a trap composed of 196 places in 746 ms of which 2 ms to minimize.
[2022-06-08 23:30:58] [INFO ] Deduced a trap composed of 192 places in 644 ms of which 1 ms to minimize.
[2022-06-08 23:30:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 4148 ms
[2022-06-08 23:30:58] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 218 ms.
[2022-06-08 23:30:58] [INFO ] Added : 0 causal constraints over 0 iterations in 226 ms. Result :unknown
[2022-06-08 23:30:58] [INFO ] [Real]Absence check using 6 positive place invariants in 29 ms returned sat
[2022-06-08 23:30:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:30:59] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2022-06-08 23:30:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:30:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 19 ms returned sat
[2022-06-08 23:30:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:00] [INFO ] [Nat]Absence check using state equation in 450 ms returned sat
[2022-06-08 23:31:00] [INFO ] Deduced a trap composed of 190 places in 393 ms of which 1 ms to minimize.
[2022-06-08 23:31:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 524 ms
[2022-06-08 23:31:00] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 113 ms.
[2022-06-08 23:31:04] [INFO ] Added : 173 causal constraints over 35 iterations in 3730 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-06-08 23:31:04] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2022-06-08 23:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:05] [INFO ] [Real]Absence check using state equation in 694 ms returned sat
[2022-06-08 23:31:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:31:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 29 ms returned sat
[2022-06-08 23:31:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:06] [INFO ] [Nat]Absence check using state equation in 689 ms returned sat
[2022-06-08 23:31:07] [INFO ] Deduced a trap composed of 118 places in 849 ms of which 1 ms to minimize.
[2022-06-08 23:31:08] [INFO ] Deduced a trap composed of 190 places in 869 ms of which 1 ms to minimize.
[2022-06-08 23:31:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1994 ms
[2022-06-08 23:31:08] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 162 ms.
[2022-06-08 23:31:11] [INFO ] Deduced a trap composed of 20 places in 1037 ms of which 1 ms to minimize.
[2022-06-08 23:31:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 3
[2022-06-08 23:31:11] [INFO ] [Real]Absence check using 6 positive place invariants in 32 ms returned sat
[2022-06-08 23:31:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:12] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2022-06-08 23:31:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:31:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 17 ms returned unsat
[2022-06-08 23:31:13] [INFO ] [Real]Absence check using 6 positive place invariants in 18 ms returned sat
[2022-06-08 23:31:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:13] [INFO ] [Real]Absence check using state equation in 613 ms returned sat
[2022-06-08 23:31:14] [INFO ] Deduced a trap composed of 189 places in 552 ms of which 1 ms to minimize.
[2022-06-08 23:31:15] [INFO ] Deduced a trap composed of 198 places in 747 ms of which 1 ms to minimize.
[2022-06-08 23:31:15] [INFO ] Deduced a trap composed of 189 places in 751 ms of which 1 ms to minimize.
[2022-06-08 23:31:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2306 ms
[2022-06-08 23:31:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:31:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 30 ms returned sat
[2022-06-08 23:31:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:16] [INFO ] [Nat]Absence check using state equation in 629 ms returned sat
[2022-06-08 23:31:17] [INFO ] Deduced a trap composed of 189 places in 827 ms of which 1 ms to minimize.
[2022-06-08 23:31:18] [INFO ] Deduced a trap composed of 247 places in 835 ms of which 1 ms to minimize.
[2022-06-08 23:31:19] [INFO ] Deduced a trap composed of 170 places in 758 ms of which 1 ms to minimize.
[2022-06-08 23:31:20] [INFO ] Deduced a trap composed of 241 places in 684 ms of which 1 ms to minimize.
[2022-06-08 23:31:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 3479 ms
[2022-06-08 23:31:20] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 145 ms.
[2022-06-08 23:31:21] [INFO ] Added : 25 causal constraints over 5 iterations in 649 ms. Result :unknown
[2022-06-08 23:31:21] [INFO ] [Real]Absence check using 6 positive place invariants in 31 ms returned sat
[2022-06-08 23:31:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:22] [INFO ] [Real]Absence check using state equation in 857 ms returned sat
[2022-06-08 23:31:22] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 91 ms.
[2022-06-08 23:31:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:31:23] [INFO ] [Nat]Absence check using 6 positive place invariants in 33 ms returned sat
[2022-06-08 23:31:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:24] [INFO ] [Nat]Absence check using state equation in 824 ms returned sat
[2022-06-08 23:31:24] [INFO ] Deduced a trap composed of 190 places in 480 ms of which 2 ms to minimize.
[2022-06-08 23:31:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 629 ms
[2022-06-08 23:31:25] [INFO ] Computed and/alt/rep : 1141/3195/1141 causal constraints (skipped 124 transitions) in 153 ms.
[2022-06-08 23:31:28] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
[2022-06-08 23:31:28] [INFO ] [Real]Absence check using 6 positive place invariants in 27 ms returned sat
[2022-06-08 23:31:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:31:29] [INFO ] [Real]Absence check using state equation in 633 ms returned sat
[2022-06-08 23:31:29] [INFO ] Solution in real domain found non-integer solution.
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 8 Parikh solutions to 4 different solutions.
Incomplete Parikh walk after 14100 steps, including 157 resets, run finished after 49 ms. (steps per millisecond=287 ) properties (out of 5) seen :0 could not realise parikh vector
Incomplete Parikh walk after 29100 steps, including 226 resets, run finished after 74 ms. (steps per millisecond=393 ) properties (out of 5) seen :2 could not realise parikh vector
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 9400 steps, including 151 resets, run finished after 24 ms. (steps per millisecond=391 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 28 out of 699 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 699/699 places, 1266/1266 transitions.
Graph (trivial) has 658 edges and 699 vertex of which 83 / 699 are part of one of the 13 SCC in 41 ms
Free SCC test removed 70 places
Drop transitions removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Graph (complete) has 1197 edges and 629 vertex of which 619 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.13 ms
Discarding 10 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 402 transitions
Trivial Post-agglo rules discarded 402 transitions
Performed 402 trivial Post agglomeration. Transition count delta: 402
Iterating post reduction 0 with 407 rules applied. Total rules applied 409 place count 619 transition count 765
Reduce places removed 402 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 417 rules applied. Total rules applied 826 place count 217 transition count 750
Reduce places removed 7 places and 0 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 2 with 29 rules applied. Total rules applied 855 place count 210 transition count 728
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 27 rules applied. Total rules applied 882 place count 188 transition count 723
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 884 place count 186 transition count 723
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 15 Pre rules applied. Total rules applied 884 place count 186 transition count 708
Deduced a syphon composed of 15 places in 2 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 914 place count 171 transition count 708
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 948 place count 137 transition count 674
Iterating global reduction 5 with 34 rules applied. Total rules applied 982 place count 137 transition count 674
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 983 place count 137 transition count 673
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 983 place count 137 transition count 671
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 987 place count 135 transition count 671
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 993 place count 129 transition count 450
Iterating global reduction 6 with 6 rules applied. Total rules applied 999 place count 129 transition count 450
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1003 place count 129 transition count 446
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 1043 place count 109 transition count 426
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1044 place count 109 transition count 425
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 1048 place count 105 transition count 421
Iterating global reduction 8 with 4 rules applied. Total rules applied 1052 place count 105 transition count 421
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 1060 place count 101 transition count 423
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1061 place count 101 transition count 422
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 1067 place count 101 transition count 416
Free-agglomeration rule applied 29 times.
Iterating global reduction 9 with 29 rules applied. Total rules applied 1096 place count 101 transition count 387
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 1125 place count 72 transition count 387
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 1128 place count 69 transition count 384
Iterating global reduction 10 with 3 rules applied. Total rules applied 1131 place count 69 transition count 384
Drop transitions removed 83 transitions
Redundant transition composition rules discarded 83 transitions
Iterating global reduction 10 with 83 rules applied. Total rules applied 1214 place count 69 transition count 301
Applied a total of 1214 rules in 508 ms. Remains 69 /699 variables (removed 630) and now considering 301/1266 (removed 965) transitions.
Finished structural reductions, in 1 iterations. Remains : 69/699 places, 301/1266 transitions.
[2022-06-08 23:31:30] [INFO ] Flatten gal took : 101 ms
[2022-06-08 23:31:30] [INFO ] Flatten gal took : 61 ms
[2022-06-08 23:31:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16516461367968139874.gal : 28 ms
[2022-06-08 23:31:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4393235653225575746.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/ReachabilityCardinality16516461367968139874.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality4393235653225575746.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/ReachabilityCardinality16516461367968139874.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality4393235653225575746.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality4393235653225575746.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 11
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :11 after 15
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15 after 29
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :29 after 181
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :181 after 2506
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :2506 after 3037
Reachability property StigmergyElection-PT-05b-ReachabilityCardinality-14 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property StigmergyElection-PT-05b-ReachabilityCardinality-05 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3037 after 6199
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :6199 after 7023
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,45355,1.01716,21564,2,2767,16,30501,7,0,578,28241,0
Total reachable state count : 45355

Verifying 3 reachability properties.
Reachability property StigmergyElection-PT-05b-ReachabilityCardinality-05 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
StigmergyElection-PT-05b-ReachabilityCardinality-05,1,1.01821,21564,2,70,16,30501,8,0,581,28241,0
Reachability property StigmergyElection-PT-05b-ReachabilityCardinality-11 is true.
FORMULA StigmergyElection-PT-05b-ReachabilityCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
StigmergyElection-PT-05b-ReachabilityCardinality-11,672,1.01879,21564,2,405,16,30501,8,0,582,28241,0
Reachability property StigmergyElection-PT-05b-ReachabilityCardinality-14 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
StigmergyElection-PT-05b-ReachabilityCardinality-14,1,1.02293,21564,2,70,16,30501,9,0,635,28241,0
All properties solved without resorting to model-checking.

BK_STOP 1654731092616

--------------------
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="StigmergyElection-PT-05b"
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 StigmergyElection-PT-05b, 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-165463878400116"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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