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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 5.8K May 30 14:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 30 14:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 30 14:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 30 14:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 25 13:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 11K May 30 14:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K May 30 14:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K May 30 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 30 14:55 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 1.2M 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-06b-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-06b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1654731377632

Running Version 0
[2022-06-08 23:36:20] [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:36:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 23:36:20] [INFO ] Load time of PNML (sax parser for PT used): 431 ms
[2022-06-08 23:36:20] [INFO ] Transformed 835 places.
[2022-06-08 23:36:20] [INFO ] Transformed 2416 transitions.
[2022-06-08 23:36:20] [INFO ] Found NUPN structural information;
[2022-06-08 23:36:20] [INFO ] Parsed PT model containing 835 places and 2416 transitions in 526 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 95 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 15) seen :3
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 2416 rows 835 cols
[2022-06-08 23:36:21] [INFO ] Computed 7 place invariants in 170 ms
[2022-06-08 23:36:22] [INFO ] [Real]Absence check using 7 positive place invariants in 64 ms returned sat
[2022-06-08 23:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:23] [INFO ] [Real]Absence check using state equation in 1131 ms returned sat
[2022-06-08 23:36:23] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:24] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned sat
[2022-06-08 23:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:26] [INFO ] [Real]Absence check using state equation in 1094 ms returned sat
[2022-06-08 23:36:28] [INFO ] Deduced a trap composed of 193 places in 1992 ms of which 5 ms to minimize.
[2022-06-08 23:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 2213 ms
[2022-06-08 23:36:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 25 ms returned sat
[2022-06-08 23:36:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:29] [INFO ] [Nat]Absence check using state equation in 1015 ms returned sat
[2022-06-08 23:36:30] [INFO ] Deduced a trap composed of 193 places in 1017 ms of which 2 ms to minimize.
[2022-06-08 23:36:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1222 ms
[2022-06-08 23:36:31] [INFO ] Computed and/alt/rep : 2241/9662/2241 causal constraints (skipped 174 transitions) in 433 ms.
[2022-06-08 23:36:35] [INFO ] Deduced a trap composed of 189 places in 1629 ms of which 3 ms to minimize.
[2022-06-08 23:36:35] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
[2022-06-08 23:36:35] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2022-06-08 23:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:36] [INFO ] [Real]Absence check using state equation in 872 ms returned sat
[2022-06-08 23:36:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:36] [INFO ] [Real]Absence check using 7 positive place invariants in 22 ms returned sat
[2022-06-08 23:36:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:37] [INFO ] [Real]Absence check using state equation in 1174 ms returned sat
[2022-06-08 23:36:37] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:38] [INFO ] [Real]Absence check using 7 positive place invariants in 33 ms returned sat
[2022-06-08 23:36:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:39] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2022-06-08 23:36:39] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:39] [INFO ] [Real]Absence check using 7 positive place invariants in 23 ms returned sat
[2022-06-08 23:36:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:40] [INFO ] [Real]Absence check using state equation in 1132 ms returned sat
[2022-06-08 23:36:42] [INFO ] Deduced a trap composed of 244 places in 1518 ms of which 3 ms to minimize.
[2022-06-08 23:36:43] [INFO ] Deduced a trap composed of 227 places in 1281 ms of which 3 ms to minimize.
[2022-06-08 23:36:45] [INFO ] Deduced a trap composed of 192 places in 1417 ms of which 1 ms to minimize.
[2022-06-08 23:36:45] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
[2022-06-08 23:36:45] [INFO ] [Real]Absence check using 7 positive place invariants in 21 ms returned sat
[2022-06-08 23:36:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:46] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2022-06-08 23:36:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:46] [INFO ] [Nat]Absence check using 7 positive place invariants in 24 ms returned sat
[2022-06-08 23:36:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:47] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2022-06-08 23:36:49] [INFO ] Deduced a trap composed of 244 places in 1085 ms of which 1 ms to minimize.
[2022-06-08 23:36:50] [INFO ] Deduced a trap composed of 190 places in 1048 ms of which 2 ms to minimize.
[2022-06-08 23:36:51] [INFO ] Deduced a trap composed of 190 places in 1262 ms of which 1 ms to minimize.
[2022-06-08 23:36:52] [INFO ] Deduced a trap composed of 189 places in 1184 ms of which 1 ms to minimize.
[2022-06-08 23:36:52] [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:36:53] [INFO ] [Real]Absence check using 7 positive place invariants in 24 ms returned sat
[2022-06-08 23:36:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:54] [INFO ] [Real]Absence check using state equation in 1356 ms returned sat
[2022-06-08 23:36:54] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:55] [INFO ] [Real]Absence check using 7 positive place invariants in 20 ms returned sat
[2022-06-08 23:36:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:55] [INFO ] [Real]Absence check using state equation in 867 ms returned sat
[2022-06-08 23:36:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:36:56] [INFO ] [Nat]Absence check using 7 positive place invariants in 23 ms returned sat
[2022-06-08 23:36:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:36:57] [INFO ] [Nat]Absence check using state equation in 927 ms returned sat
[2022-06-08 23:36:58] [INFO ] Deduced a trap composed of 249 places in 1431 ms of which 1 ms to minimize.
[2022-06-08 23:37:00] [INFO ] Deduced a trap composed of 245 places in 1972 ms of which 2 ms to minimize.
[2022-06-08 23:37:02] [INFO ] Deduced a trap composed of 189 places in 1363 ms of which 1 ms to minimize.
[2022-06-08 23:37:02] [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 8
[2022-06-08 23:37:02] [INFO ] [Real]Absence check using 7 positive place invariants in 23 ms returned sat
[2022-06-08 23:37:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:37:03] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2022-06-08 23:37:05] [INFO ] Deduced a trap composed of 194 places in 1867 ms of which 1 ms to minimize.
[2022-06-08 23:37:07] [INFO ] Deduced a trap composed of 194 places in 1211 ms of which 1 ms to minimize.
[2022-06-08 23:37:08] [INFO ] Deduced a trap composed of 191 places in 1047 ms of which 1 ms to minimize.
[2022-06-08 23:37:08] [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 9
[2022-06-08 23:37:08] [INFO ] [Real]Absence check using 7 positive place invariants in 31 ms returned sat
[2022-06-08 23:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:37:09] [INFO ] [Real]Absence check using state equation in 1354 ms returned sat
[2022-06-08 23:37:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:37:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 23 ms returned sat
[2022-06-08 23:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:37:11] [INFO ] [Nat]Absence check using state equation in 1114 ms returned sat
[2022-06-08 23:37:11] [INFO ] Computed and/alt/rep : 2241/9662/2241 causal constraints (skipped 174 transitions) in 630 ms.
[2022-06-08 23:37:16] [INFO ] Deduced a trap composed of 189 places in 1573 ms of which 1 ms to minimize.
[2022-06-08 23:37:16] [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 10
[2022-06-08 23:37:16] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned sat
[2022-06-08 23:37:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:37:17] [INFO ] [Real]Absence check using state equation in 955 ms returned sat
[2022-06-08 23:37:18] [INFO ] Deduced a trap composed of 160 places in 982 ms of which 1 ms to minimize.
[2022-06-08 23:37:19] [INFO ] Deduced a trap composed of 193 places in 913 ms of which 1 ms to minimize.
[2022-06-08 23:37:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2217 ms
[2022-06-08 23:37:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:37:20] [INFO ] [Nat]Absence check using 7 positive place invariants in 22 ms returned sat
[2022-06-08 23:37:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:37:21] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2022-06-08 23:37:22] [INFO ] Deduced a trap composed of 160 places in 1308 ms of which 1 ms to minimize.
[2022-06-08 23:37:23] [INFO ] Deduced a trap composed of 193 places in 1199 ms of which 1 ms to minimize.
[2022-06-08 23:37:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 2750 ms
[2022-06-08 23:37:24] [INFO ] Computed and/alt/rep : 2241/9662/2241 causal constraints (skipped 174 transitions) in 198 ms.
[2022-06-08 23:37:26] [INFO ] Deduced a trap composed of 189 places in 1564 ms of which 2 ms to minimize.
[2022-06-08 23:37:26] [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 11
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-07 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-06 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Support contains 119 out of 835 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 835/835 places, 2416/2416 transitions.
Graph (trivial) has 636 edges and 835 vertex of which 40 / 835 are part of one of the 8 SCC in 9 ms
Free SCC test removed 32 places
Drop transitions removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (complete) has 1629 edges and 803 vertex of which 795 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.31 ms
Discarding 8 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 367 transitions
Trivial Post-agglo rules discarded 367 transitions
Performed 367 trivial Post agglomeration. Transition count delta: 367
Iterating post reduction 0 with 370 rules applied. Total rules applied 372 place count 795 transition count 2001
Reduce places removed 367 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 375 rules applied. Total rules applied 747 place count 428 transition count 1993
Reduce places removed 3 places and 0 transitions.
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Iterating post reduction 2 with 62 rules applied. Total rules applied 809 place count 425 transition count 1934
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 3 with 59 rules applied. Total rules applied 868 place count 366 transition count 1934
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 868 place count 366 transition count 1915
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 906 place count 347 transition count 1915
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 939 place count 314 transition count 1882
Iterating global reduction 4 with 33 rules applied. Total rules applied 972 place count 314 transition count 1882
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 974 place count 314 transition count 1880
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 975 place count 313 transition count 1880
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 975 place count 313 transition count 1879
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 977 place count 312 transition count 1879
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 986 place count 303 transition count 697
Iterating global reduction 6 with 9 rules applied. Total rules applied 995 place count 303 transition count 697
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 1055 place count 273 transition count 667
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 1056 place count 272 transition count 666
Iterating global reduction 6 with 1 rules applied. Total rules applied 1057 place count 272 transition count 666
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1069 place count 266 transition count 667
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 1073 place count 266 transition count 663
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 1079 place count 266 transition count 657
Free-agglomeration rule applied 37 times.
Iterating global reduction 7 with 37 rules applied. Total rules applied 1116 place count 266 transition count 620
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 7 with 37 rules applied. Total rules applied 1153 place count 229 transition count 620
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 1157 place count 229 transition count 616
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 1159 place count 229 transition count 616
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1160 place count 229 transition count 616
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 1161 place count 228 transition count 615
Applied a total of 1161 rules in 663 ms. Remains 228 /835 variables (removed 607) and now considering 615/2416 (removed 1801) transitions.
Finished structural reductions, in 1 iterations. Remains : 228/835 places, 615/2416 transitions.
[2022-06-08 23:37:27] [INFO ] Flatten gal took : 265 ms
[2022-06-08 23:37:27] [INFO ] Flatten gal took : 150 ms
[2022-06-08 23:37:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3581893974688102930.gal : 58 ms
[2022-06-08 23:37:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5942682084876125803.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/ReachabilityCardinality3581893974688102930.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality5942682084876125803.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/ReachabilityCardinality3581893974688102930.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality5942682084876125803.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality5942682084876125803.prop.
SDD proceeding with computation,7 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,7 properties remain. new max is 8
SDD size :5 after 33
SDD proceeding with computation,7 properties remain. new max is 16
SDD size :33 after 51
SDD proceeding with computation,7 properties remain. new max is 32
SDD size :51 after 107
SDD proceeding with computation,7 properties remain. new max is 64
SDD size :107 after 131
SDD proceeding with computation,7 properties remain. new max is 128
SDD size :131 after 715
SDD proceeding with computation,7 properties remain. new max is 256
SDD size :715 after 2017
SDD proceeding with computation,7 properties remain. new max is 512
SDD size :2017 after 182786
Invariant property StigmergyElection-PT-06b-ReachabilityCardinality-14 does not hold.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :182786 after 4.02887e+06
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :4.02887e+06 after 2.07226e+07
Detected timeout of ITS tools.
[2022-06-08 23:37:43] [INFO ] Flatten gal took : 84 ms
[2022-06-08 23:37:43] [INFO ] Applying decomposition
[2022-06-08 23:37:43] [INFO ] Flatten gal took : 60 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/graph4621164317486850766.txt, -o, /tmp/graph4621164317486850766.bin, -w, /tmp/graph4621164317486850766.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/graph4621164317486850766.bin, -l, -1, -v, -w, /tmp/graph4621164317486850766.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:37:43] [INFO ] Decomposing Gal with order
[2022-06-08 23:37:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:37:43] [INFO ] Removed a total of 641 redundant transitions.
[2022-06-08 23:37:44] [INFO ] Flatten gal took : 275 ms
[2022-06-08 23:37:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 692 labels/synchronizations in 55 ms.
[2022-06-08 23:37:44] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11164236033410174237.gal : 16 ms
[2022-06-08 23:37:44] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7472163356446033590.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/ReachabilityCardinality11164236033410174237.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7472163356446033590.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/ReachabilityCardinality11164236033410174237.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7472163356446033590.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7472163356446033590.prop.
SDD proceeding with computation,6 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,6 properties remain. new max is 32
SDD size :1 after 83
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :83 after 14828
SDD proceeding with computation,6 properties remain. new max is 128
SDD size :14828 after 26943
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :26943 after 43718
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :43718 after 244709
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :244709 after 3.61456e+07
Reachability property StigmergyElection-PT-06b-ReachabilityCardinality-15 is true.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property StigmergyElection-PT-06b-ReachabilityCardinality-13 is true.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :3.61456e+07 after 8.10369e+07
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :8.10369e+07 after 8.1171e+07
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :8.1171e+07 after 8.15558e+07
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8553190780507331638
[2022-06-08 23:37:59] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8553190780507331638
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8553190780507331638]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8553190780507331638] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8553190780507331638] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Incomplete random walk after 1000000 steps, including 28745 resets, run finished after 2039 ms. (steps per millisecond=490 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 5837 resets, run finished after 1376 ms. (steps per millisecond=726 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4593 resets, run finished after 1181 ms. (steps per millisecond=846 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4598 resets, run finished after 534 ms. (steps per millisecond=1872 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4604 resets, run finished after 491 ms. (steps per millisecond=2036 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 13708099 steps, run timeout after 30001 ms. (steps per millisecond=456 ) properties seen :{}
Probabilistic random walk after 13708099 steps, saw 2001123 distinct states, run finished after 30007 ms. (steps per millisecond=456 ) properties seen :{}
Running SMT prover for 4 properties.
// Phase 1: matrix 615 rows 228 cols
[2022-06-08 23:38:35] [INFO ] Computed 5 place invariants in 8 ms
[2022-06-08 23:38:36] [INFO ] [Real]Absence check using 5 positive place invariants in 42 ms returned sat
[2022-06-08 23:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:36] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2022-06-08 23:38:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:38:36] [INFO ] [Nat]Absence check using 5 positive place invariants in 60 ms returned sat
[2022-06-08 23:38:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:37] [INFO ] [Nat]Absence check using state equation in 845 ms returned sat
[2022-06-08 23:38:37] [INFO ] State equation strengthened by 190 read => feed constraints.
[2022-06-08 23:38:37] [INFO ] [Nat]Added 190 Read/Feed constraints in 149 ms returned sat
[2022-06-08 23:38:38] [INFO ] Computed and/alt/rep : 265/729/265 causal constraints (skipped 346 transitions) in 113 ms.
[2022-06-08 23:38:40] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 2 ms to minimize.
[2022-06-08 23:38:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 313 ms
[2022-06-08 23:38:40] [INFO ] Added : 197 causal constraints over 40 iterations in 2847 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-06-08 23:38:40] [INFO ] [Real]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-06-08 23:38:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:41] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2022-06-08 23:38:41] [INFO ] [Real]Added 190 Read/Feed constraints in 194 ms returned sat
[2022-06-08 23:38:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:38:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-06-08 23:38:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:41] [INFO ] [Nat]Absence check using state equation in 233 ms returned sat
[2022-06-08 23:38:41] [INFO ] [Nat]Added 190 Read/Feed constraints in 175 ms returned sat
[2022-06-08 23:38:42] [INFO ] Deduced a trap composed of 41 places in 230 ms of which 1 ms to minimize.
[2022-06-08 23:38:42] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 1 ms to minimize.
[2022-06-08 23:38:42] [INFO ] Deduced a trap composed of 39 places in 212 ms of which 1 ms to minimize.
[2022-06-08 23:38:42] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 1 ms to minimize.
[2022-06-08 23:38:43] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 1 ms to minimize.
[2022-06-08 23:38:43] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1288 ms
[2022-06-08 23:38:43] [INFO ] Computed and/alt/rep : 265/729/265 causal constraints (skipped 346 transitions) in 202 ms.
[2022-06-08 23:38:46] [INFO ] Added : 199 causal constraints over 41 iterations in 2922 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2022-06-08 23:38:46] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-08 23:38:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:46] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2022-06-08 23:38:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:38:46] [INFO ] [Nat]Absence check using 5 positive place invariants in 6 ms returned sat
[2022-06-08 23:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:46] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2022-06-08 23:38:46] [INFO ] [Nat]Added 190 Read/Feed constraints in 173 ms returned sat
[2022-06-08 23:38:47] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 1 ms to minimize.
[2022-06-08 23:38:47] [INFO ] Deduced a trap composed of 52 places in 272 ms of which 1 ms to minimize.
[2022-06-08 23:38:47] [INFO ] Deduced a trap composed of 48 places in 354 ms of which 1 ms to minimize.
[2022-06-08 23:38:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1093 ms
[2022-06-08 23:38:48] [INFO ] Computed and/alt/rep : 265/729/265 causal constraints (skipped 346 transitions) in 244 ms.
[2022-06-08 23:38:51] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 2 ms to minimize.
[2022-06-08 23:38:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 291 ms
[2022-06-08 23:38:51] [INFO ] Added : 195 causal constraints over 39 iterations in 3162 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-06-08 23:38:51] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-08 23:38:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:51] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2022-06-08 23:38:51] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 23:38:51] [INFO ] [Nat]Absence check using 5 positive place invariants in 5 ms returned sat
[2022-06-08 23:38:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 23:38:51] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2022-06-08 23:38:52] [INFO ] [Nat]Added 190 Read/Feed constraints in 172 ms returned sat
[2022-06-08 23:38:52] [INFO ] Deduced a trap composed of 39 places in 608 ms of which 1 ms to minimize.
[2022-06-08 23:38:53] [INFO ] Deduced a trap composed of 60 places in 412 ms of which 1 ms to minimize.
[2022-06-08 23:38:53] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 1 ms to minimize.
[2022-06-08 23:38:53] [INFO ] Deduced a trap composed of 52 places in 302 ms of which 1 ms to minimize.
[2022-06-08 23:38:54] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 0 ms to minimize.
[2022-06-08 23:38:54] [INFO ] Deduced a trap composed of 46 places in 267 ms of which 1 ms to minimize.
[2022-06-08 23:38:54] [INFO ] Deduced a trap composed of 49 places in 228 ms of which 1 ms to minimize.
[2022-06-08 23:38:54] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 1 ms to minimize.
[2022-06-08 23:38:55] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 1 ms to minimize.
[2022-06-08 23:38:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3200 ms
[2022-06-08 23:38:55] [INFO ] Computed and/alt/rep : 265/729/265 causal constraints (skipped 346 transitions) in 73 ms.
[2022-06-08 23:38:57] [INFO ] Added : 185 causal constraints over 38 iterations in 2458 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 11 ms.
Incomplete Parikh walk after 570400 steps, including 1002 resets, run finished after 1137 ms. (steps per millisecond=501 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 545800 steps, including 1002 resets, run finished after 635 ms. (steps per millisecond=859 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 431300 steps, including 1002 resets, run finished after 567 ms. (steps per millisecond=760 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 389700 steps, including 1002 resets, run finished after 461 ms. (steps per millisecond=845 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 59 out of 228 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 228/228 places, 615/615 transitions.
Graph (trivial) has 118 edges and 228 vertex of which 8 / 228 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 654 edges and 224 vertex of which 222 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 222 transition count 559
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 57 rules applied. Total rules applied 105 place count 178 transition count 546
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 117 place count 168 transition count 544
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 117 place count 168 transition count 539
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 127 place count 163 transition count 539
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 130 place count 160 transition count 535
Iterating global reduction 3 with 3 rules applied. Total rules applied 133 place count 160 transition count 535
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 153 place count 150 transition count 525
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 148 transition count 523
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 148 transition count 523
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 165 place count 144 transition count 523
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 167 place count 144 transition count 521
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 171 place count 144 transition count 517
Free-agglomeration rule applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 144 transition count 505
Reduce places removed 13 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 15 rules applied. Total rules applied 198 place count 131 transition count 503
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 201 place count 129 transition count 502
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 201 place count 129 transition count 498
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 209 place count 125 transition count 498
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 210 place count 124 transition count 497
Iterating global reduction 6 with 1 rules applied. Total rules applied 211 place count 124 transition count 497
Performed 5 Post agglomeration using F-continuation condition with reduction of 16 identical transitions.
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 221 place count 119 transition count 476
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 6 with 34 rules applied. Total rules applied 255 place count 119 transition count 442
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 256 place count 118 transition count 370
Iterating global reduction 7 with 1 rules applied. Total rules applied 257 place count 118 transition count 370
Drop transitions removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 7 with 130 rules applied. Total rules applied 387 place count 118 transition count 240
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 389 place count 117 transition count 246
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 390 place count 117 transition count 245
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 391 place count 116 transition count 245
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 392 place count 116 transition count 244
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 396 place count 116 transition count 244
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 399 place count 116 transition count 241
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 402 place count 113 transition count 238
Iterating global reduction 8 with 3 rules applied. Total rules applied 405 place count 113 transition count 238
Applied a total of 405 rules in 262 ms. Remains 113 /228 variables (removed 115) and now considering 238/615 (removed 377) transitions.
Finished structural reductions, in 1 iterations. Remains : 113/228 places, 238/615 transitions.
[2022-06-08 23:39:00] [INFO ] Flatten gal took : 21 ms
[2022-06-08 23:39:00] [INFO ] Flatten gal took : 20 ms
[2022-06-08 23:39:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1638189972523308792.gal : 4 ms
[2022-06-08 23:39:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15320693290354559371.prop : 69 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/ReachabilityCardinality1638189972523308792.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality15320693290354559371.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/ReachabilityCardinality1638189972523308792.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality15320693290354559371.prop --nowitness --gen-order FOLLOW
Loading property file /tmp/ReachabilityCardinality15320693290354559371.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 9
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :9 after 41
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :41 after 295
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :295 after 1233
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1233 after 43121
Invariant property StigmergyElection-PT-06b-ReachabilityCardinality-12 does not hold.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Reachability property StigmergyElection-PT-06b-ReachabilityCardinality-09 is true.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :43121 after 216891
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :216891 after 218744
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :218744 after 283802
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :283802 after 344033
Detected timeout of ITS tools.
[2022-06-08 23:39:16] [INFO ] Flatten gal took : 19 ms
[2022-06-08 23:39:16] [INFO ] Applying decomposition
[2022-06-08 23:39:16] [INFO ] Flatten gal took : 34 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/graph14127813759545568315.txt, -o, /tmp/graph14127813759545568315.bin, -w, /tmp/graph14127813759545568315.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/graph14127813759545568315.bin, -l, -1, -v, -w, /tmp/graph14127813759545568315.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 23:39:16] [INFO ] Decomposing Gal with order
[2022-06-08 23:39:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 23:39:16] [INFO ] Removed a total of 1032 redundant transitions.
[2022-06-08 23:39:16] [INFO ] Flatten gal took : 52 ms
[2022-06-08 23:39:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 22 ms.
[2022-06-08 23:39:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3177735459077228439.gal : 5 ms
[2022-06-08 23:39:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7225552105523527772.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/ReachabilityCardinality3177735459077228439.gal, -t, CGAL, -reachable-file, /tmp/ReachabilityCardinality7225552105523527772.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/ReachabilityCardinality3177735459077228439.gal -t CGAL -reachable-file /tmp/ReachabilityCardinality7225552105523527772.prop --nowitness
Loading property file /tmp/ReachabilityCardinality7225552105523527772.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :1 after 77
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :77 after 682539
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,2.01073e+06,0.088721,6304,273,30,2556,392,537,3556,77,829,0
Total reachable state count : 2010727

Verifying 2 reachability properties.
Reachability property StigmergyElection-PT-06b-ReachabilityCardinality-05 is true.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-05 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
StigmergyElection-PT-06b-ReachabilityCardinality-05,150,0.094245,6304,63,18,2556,392,605,3556,86,829,839
Reachability property StigmergyElection-PT-06b-ReachabilityCardinality-10 is true.
FORMULA StigmergyElection-PT-06b-ReachabilityCardinality-10 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
StigmergyElection-PT-06b-ReachabilityCardinality-10,400,0.094922,6304,59,18,2556,392,614,3556,86,829,858
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.

BK_STOP 1654731557688

--------------------
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
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
++ cut -d . -f 9
+ 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-06b"
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-06b, 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-165463878500122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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