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.r576-smll-171734919900064.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 MedleyA-PT-08, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919900064
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 90K Jun 2 16:33 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 1717357819750

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 19:50:22] [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-06-02 19:50:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:50:22] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-06-02 19:50:22] [INFO ] Transformed 147 places.
[2024-06-02 19:50:22] [INFO ] Transformed 312 transitions.
[2024-06-02 19:50:22] [INFO ] Found NUPN structural information;
[2024-06-02 19:50:22] [INFO ] Parsed PT model containing 147 places and 312 transitions and 1378 arcs in 388 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 147/147 places, 312/312 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
[2024-06-02 19:50:22] [INFO ] Redundant transitions in 29 ms returned []
Running 305 sub problems to find dead transitions.
// Phase 1: matrix 306 rows 147 cols
[2024-06-02 19:50:23] [INFO ] Computed 11 invariants in 44 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 5/149 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 305 unsolved
Problem TDEAD161 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 3 (OVERLAPS) 3/147 variables, 6/155 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/158 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:50:28] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 23 ms to minimize.
[2024-06-02 19:50:28] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-06-02 19:50:28] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 2 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 37 places in 119 ms of which 2 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:50:29] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 2 ms to minimize.
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 27 ms to minimize.
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:50:30] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:50:31] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 17/175 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:50:31] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:50:31] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 2 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 33 places in 63 ms of which 2 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 46 places in 91 ms of which 1 ms to minimize.
[2024-06-02 19:50:32] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 29 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 44 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:50:33] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 1 ms to minimize.
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2024-06-02 19:50:34] [INFO ] Deduced a trap composed of 47 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 20/195 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 1 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 3 ms to minimize.
[2024-06-02 19:50:35] [INFO ] Deduced a trap composed of 29 places in 120 ms of which 2 ms to minimize.
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 2 ms to minimize.
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 39 places in 116 ms of which 2 ms to minimize.
[2024-06-02 19:50:36] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 7/202 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:50:37] [INFO ] Deduced a trap composed of 42 places in 124 ms of which 2 ms to minimize.
[2024-06-02 19:50:37] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 3 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 3 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:50:38] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:50:39] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 2 ms to minimize.
[2024-06-02 19:50:39] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 2 ms to minimize.
[2024-06-02 19:50:39] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 2 ms to minimize.
[2024-06-02 19:50:39] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 9 ms to minimize.
[2024-06-02 19:50:39] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:50:39] [INFO ] Deduced a trap composed of 26 places in 104 ms of which 2 ms to minimize.
[2024-06-02 19:50:39] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 16/218 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/218 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 10 (OVERLAPS) 306/453 variables, 147/365 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 0/365 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:50:48] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2024-06-02 19:50:48] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 2 ms to minimize.
[2024-06-02 19:50:49] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/453 variables, 3/368 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/453 variables, and 368 constraints, problems are : Problem set: 48 solved, 257 unsolved in 30037 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 63/63 constraints]
Escalating to Integer solving :Problem set: 48 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 144/144 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 5/149 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/144 variables, 0/149 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 3 (OVERLAPS) 3/147 variables, 6/155 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 3/158 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 63/221 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:50:56] [INFO ] Deduced a trap composed of 36 places in 127 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 1/222 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/222 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 8 (OVERLAPS) 306/453 variables, 147/369 constraints. Problems are: Problem set: 48 solved, 257 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 257/626 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:51:05] [INFO ] Deduced a trap composed of 33 places in 102 ms of which 1 ms to minimize.
[2024-06-02 19:51:06] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-02 19:51:06] [INFO ] Deduced a trap composed of 34 places in 108 ms of which 2 ms to minimize.
[2024-06-02 19:51:06] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 2 ms to minimize.
[2024-06-02 19:51:06] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 1 ms to minimize.
[2024-06-02 19:51:06] [INFO ] Deduced a trap composed of 47 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:51:06] [INFO ] Deduced a trap composed of 33 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:51:06] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:51:07] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-06-02 19:51:07] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 1 ms to minimize.
[2024-06-02 19:51:07] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 2 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:51:08] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 1 ms to minimize.
[2024-06-02 19:51:09] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-06-02 19:51:09] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2024-06-02 19:51:09] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 1 ms to minimize.
[2024-06-02 19:51:10] [INFO ] Deduced a trap composed of 51 places in 97 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/453 variables, 20/646 constraints. Problems are: Problem set: 48 solved, 257 unsolved
[2024-06-02 19:51:16] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 3 ms to minimize.
[2024-06-02 19:51:17] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/453 variables, 2/648 constraints. Problems are: Problem set: 48 solved, 257 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 453/453 variables, and 648 constraints, problems are : Problem set: 48 solved, 257 unsolved in 30016 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 257/305 constraints, Known Traps: 86/86 constraints]
After SMT, in 61080ms problems are : Problem set: 48 solved, 257 unsolved
Search for dead transitions found 48 dead transitions in 61130ms
Found 48 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 48 transitions
Dead transitions reduction (with SMT) removed 48 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 147/147 places, 258/312 transitions.
[2024-06-02 19:51:24] [INFO ] Redundant transitions in 4 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61418 ms. Remains : 147/147 places, 258/312 transitions.
Final net has 147 places and 258 transitions.
[2024-06-02 19:51:24] [INFO ] Flatten gal took : 96 ms
[2024-06-02 19:51:24] [INFO ] Applying decomposition
[2024-06-02 19:51:24] [INFO ] Flatten gal took : 30 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/graph672556969140138250.txt' '-o' '/tmp/graph672556969140138250.bin' '-w' '/tmp/graph672556969140138250.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph672556969140138250.bin' '-l' '-1' '-v' '-w' '/tmp/graph672556969140138250.weights' '-q' '0' '-e' '0.001'
[2024-06-02 19:51:24] [INFO ] Decomposing Gal with order
[2024-06-02 19:51:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 19:51:24] [INFO ] Removed a total of 397 redundant transitions.
[2024-06-02 19:51:24] [INFO ] Flatten gal took : 104 ms
[2024-06-02 19:51:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 17 ms.
[2024-06-02 19:51:24] [INFO ] Time to serialize gal into /tmp/StateSpace14462881191423027179.gal : 10 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/StateSpace14462881191423027179.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 ...220
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,3.17792e+07,0.993939,25692,896,238,30109,1659,467,125105,122,8909,0
Total reachable state count : 31779202

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

BK_STOP 1717357886020

--------------------
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="MedleyA-PT-08"
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 MedleyA-PT-08, 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 r576-smll-171734919900064"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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