Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r400-tall-171690532100352.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is StigmergyElection-PT-08a, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690532100352
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.7M
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 19:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 18:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 18:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 5.3M May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

no data necessary for post analysis


=== Now, execution of the tool begins

BK_START 1717012437187

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-08a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-29 19:53:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StateSpace, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:53:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:53:58] [INFO ] Load time of PNML (sax parser for PT used): 418 ms
[2024-05-29 19:53:58] [INFO ] Transformed 114 places.
[2024-05-29 19:53:58] [INFO ] Transformed 6882 transitions.
[2024-05-29 19:53:58] [INFO ] Found NUPN structural information;
[2024-05-29 19:53:58] [INFO ] Parsed PT model containing 114 places and 6882 transitions and 107626 arcs in 565 ms.
Ensure Unique test removed 6092 transitions
Reduce redundant transitions removed 6243 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 114/114 places, 639/639 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
[2024-05-29 19:53:59] [INFO ] Redundant transitions in 58 ms returned []
Running 622 sub problems to find dead transitions.
// Phase 1: matrix 623 rows 114 cols
[2024-05-29 19:53:59] [INFO ] Computed 9 invariants in 29 ms
[2024-05-29 19:53:59] [INFO ] State equation strengthened by 548 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 2 (OVERLAPS) 9/114 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 12 places in 221 ms of which 10 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 13 places in 152 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 1 ms to minimize.
[2024-05-29 19:54:10] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 0 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 1 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:54:11] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 120 ms of which 0 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2024-05-29 19:54:12] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 2 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2024-05-29 19:54:13] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 0 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 86 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 0 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2024-05-29 19:54:14] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:54:15] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 1 ms to minimize.
[2024-05-29 19:54:16] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 138 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 1 ms to minimize.
[2024-05-29 19:54:17] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 0 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 1 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 20/203 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 0 ms to minimize.
[2024-05-29 19:54:18] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 49 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 0 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-05-29 19:54:19] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:20] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 0 ms to minimize.
[2024-05-29 19:54:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 0 ms to minimize.
[2024-05-29 19:54:20] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-05-29 19:54:20] [INFO ] Deduced a trap composed of 13 places in 65 ms of which 0 ms to minimize.
[2024-05-29 19:54:20] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-29 19:54:20] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/114 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-05-29 19:54:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/114 variables, 7/236 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/114 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 12 (OVERLAPS) 623/737 variables, 114/350 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/737 variables, 548/898 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 737/737 variables, and 898 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30035 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 114/114 constraints, ReadFeed: 548/548 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 113/113 constraints]
Escalating to Integer solving :Problem set: 0 solved, 622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 105/105 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 2 (OVERLAPS) 9/114 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 9/123 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 113/236 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:37] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 622 unsolved
[2024-05-29 19:54:39] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:54:39] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 0 ms to minimize.
[2024-05-29 19:54:40] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 0 ms to minimize.
[2024-05-29 19:54:40] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-29 19:54:40] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 5/242 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 8 (OVERLAPS) 623/737 variables, 114/356 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 548/904 constraints. Problems are: Problem set: 0 solved, 622 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/737 variables, 622/1526 constraints. Problems are: Problem set: 0 solved, 622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 737/737 variables, and 1526 constraints, problems are : Problem set: 0 solved, 622 unsolved in 30017 ms.
Refiners :[Domain max(s): 114/114 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 114/114 constraints, ReadFeed: 548/548 constraints, PredecessorRefiner: 622/622 constraints, Known Traps: 119/119 constraints]
After SMT, in 66297ms problems are : Problem set: 0 solved, 622 unsolved
Search for dead transitions found 0 dead transitions in 66331ms
Starting structural reductions in STATESPACE mode, iteration 1 : 114/114 places, 623/639 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 66612 ms. Remains : 114/114 places, 623/639 transitions.
Final net has 114 places and 623 transitions.
[2024-05-29 19:55:05] [INFO ] Flatten gal took : 114 ms
[2024-05-29 19:55:05] [INFO ] Applying decomposition
[2024-05-29 19:55:05] [INFO ] Flatten gal took : 74 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph3663595239477605188.txt' '-o' '/tmp/graph3663595239477605188.bin' '-w' '/tmp/graph3663595239477605188.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3663595239477605188.bin' '-l' '-1' '-v' '-w' '/tmp/graph3663595239477605188.weights' '-q' '0' '-e' '0.001'
[2024-05-29 19:55:06] [INFO ] Decomposing Gal with order
[2024-05-29 19:55:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 19:55:06] [INFO ] Removed a total of 4145 redundant transitions.
[2024-05-29 19:55:06] [INFO ] Flatten gal took : 305 ms
[2024-05-29 19:55:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 38 ms.
[2024-05-29 19:55:06] [INFO ] Time to serialize gal into /tmp/StateSpace3676395242257260860.gal : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/StateSpace3676395242257260860.gal' '-t' 'CGAL' '--stats'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...219
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,462753,39.0965,762336,7793,34,187743,390,773,9.27758e+06,43,2101,0
Total reachable state count : 462753

Max variable value : 1
STATE_SPACE MAX_TOKEN_IN_PLACE 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Maximum sum along a path : 9
STATE_SPACE MAX_TOKEN_PER_MARKING 9 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Exact state count : 462753
STATE_SPACE STATES 462753 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 107557 ms.

BK_STOP 1717012545866

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StateSpace = StateSpace ]]
+ [[ -f modelMain.xml ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StateSpace -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-08a"
export BK_EXAMINATION="StateSpace"
export BK_TOOL="itstools"
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-5568"
echo " Executing tool itstools"
echo " Input is StigmergyElection-PT-08a, examination is StateSpace"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690532100352"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-08a.tgz
mv StigmergyElection-PT-08a execution
cd execution
if [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "UpperBounds" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] || [ "StateSpace" = "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 [ "StateSpace" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StateSpace" != "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 "StateSpace.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StateSpace.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StateSpace.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 '' StateSpace.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StateSpace" = "ReachabilityDeadlock" ] || [ "StateSpace" = "QuasiLiveness" ] || [ "StateSpace" = "StableMarking" ] || [ "StateSpace" = "Liveness" ] || [ "StateSpace" = "OneSafe" ] ; then
echo "FORMULA_NAME StateSpace"
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 ;