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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K 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 46K 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 1717369057536

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 22:57:40] [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 22:57:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:57:40] [INFO ] Load time of PNML (sax parser for PT used): 163 ms
[2024-06-02 22:57:40] [INFO ] Transformed 184 places.
[2024-06-02 22:57:40] [INFO ] Transformed 178 transitions.
[2024-06-02 22:57:40] [INFO ] Found NUPN structural information;
[2024-06-02 22:57:40] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 410 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 184/184 places, 178/178 transitions.
[2024-06-02 22:57:40] [INFO ] Redundant transitions in 13 ms returned []
Running 177 sub problems to find dead transitions.
// Phase 1: matrix 178 rows 184 cols
[2024-06-02 22:57:40] [INFO ] Computed 24 invariants in 21 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 5/188 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 3 (OVERLAPS) 1/184 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 177 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-02 22:57:45] [INFO ] Deduced a trap composed of 20 places in 181 ms of which 34 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 8 places in 151 ms of which 4 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 3 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 14 places in 134 ms of which 3 ms to minimize.
[2024-06-02 22:57:46] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 3 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 4 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 11 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:57:47] [INFO ] Deduced a trap composed of 19 places in 99 ms of which 2 ms to minimize.
[2024-06-02 22:57:48] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 2 ms to minimize.
[2024-06-02 22:57:48] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 177 unsolved
[2024-06-02 22:57:49] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 2 ms to minimize.
[2024-06-02 22:57:49] [INFO ] Deduced a trap composed of 41 places in 126 ms of which 3 ms to minimize.
[2024-06-02 22:57:49] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
Problem TDEAD50 is UNSAT
Problem TDEAD53 is UNSAT
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 22 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
Problem TDEAD80 is UNSAT
Problem TDEAD83 is UNSAT
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 53 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:57:50] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 2 ms to minimize.
Problem TDEAD109 is UNSAT
Problem TDEAD112 is UNSAT
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 8 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 8 places in 113 ms of which 3 ms to minimize.
[2024-06-02 22:57:51] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
Problem TDEAD140 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD170 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 18/246 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 2 ms to minimize.
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 31 places in 81 ms of which 2 ms to minimize.
[2024-06-02 22:57:52] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 4/250 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:57:53] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:57:54] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/184 variables, 4/254 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:57:56] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
[2024-06-02 22:57:56] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 2/256 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/256 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 12 (OVERLAPS) 178/362 variables, 184/440 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:58:00] [INFO ] Deduced a trap composed of 34 places in 104 ms of which 3 ms to minimize.
[2024-06-02 22:58:00] [INFO ] Deduced a trap composed of 32 places in 92 ms of which 3 ms to minimize.
[2024-06-02 22:58:00] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 2 ms to minimize.
[2024-06-02 22:58:00] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 2 ms to minimize.
[2024-06-02 22:58:00] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 3 ms to minimize.
[2024-06-02 22:58:01] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2024-06-02 22:58:01] [INFO ] Deduced a trap composed of 30 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/362 variables, 7/447 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:58:02] [INFO ] Deduced a trap composed of 34 places in 90 ms of which 2 ms to minimize.
[2024-06-02 22:58:03] [INFO ] Deduced a trap composed of 34 places in 120 ms of which 15 ms to minimize.
[2024-06-02 22:58:03] [INFO ] Deduced a trap composed of 62 places in 126 ms of which 4 ms to minimize.
[2024-06-02 22:58:03] [INFO ] Deduced a trap composed of 32 places in 44 ms of which 2 ms to minimize.
[2024-06-02 22:58:03] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2024-06-02 22:58:03] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 3 ms to minimize.
[2024-06-02 22:58:03] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 3 ms to minimize.
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 3 ms to minimize.
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 4 ms to minimize.
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 4 ms to minimize.
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 54 places in 157 ms of which 3 ms to minimize.
[2024-06-02 22:58:04] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 3 ms to minimize.
[2024-06-02 22:58:05] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/362 variables, 13/460 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:58:06] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2024-06-02 22:58:06] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 3 ms to minimize.
[2024-06-02 22:58:06] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 3 ms to minimize.
[2024-06-02 22:58:06] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/362 variables, 4/464 constraints. Problems are: Problem set: 12 solved, 165 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/362 variables, and 464 constraints, problems are : Problem set: 12 solved, 165 unsolved in 30030 ms.
Refiners :[Domain max(s): 184/184 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 177/177 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 12 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 5/176 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/176 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 13/184 variables, 15/191 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 13/204 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 4/208 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 72/280 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/280 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 178/362 variables, 184/464 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 165/629 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:58:15] [INFO ] Deduced a trap composed of 30 places in 40 ms of which 1 ms to minimize.
[2024-06-02 22:58:15] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 2 ms to minimize.
[2024-06-02 22:58:16] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:58:16] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 3 ms to minimize.
[2024-06-02 22:58:16] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 3 ms to minimize.
[2024-06-02 22:58:17] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-02 22:58:17] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-02 22:58:17] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 2 ms to minimize.
[2024-06-02 22:58:17] [INFO ] Deduced a trap composed of 51 places in 68 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/362 variables, 9/638 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:58:22] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 2 ms to minimize.
[2024-06-02 22:58:22] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-02 22:58:22] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/362 variables, 3/641 constraints. Problems are: Problem set: 12 solved, 165 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/362 variables, 0/641 constraints. Problems are: Problem set: 12 solved, 165 unsolved
[2024-06-02 22:58:33] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 4 ms to minimize.
[2024-06-02 22:58:33] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 3 ms to minimize.
[2024-06-02 22:58:33] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/362 variables, 3/644 constraints. Problems are: Problem set: 12 solved, 165 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 644 constraints, problems are : Problem set: 12 solved, 165 unsolved in 30019 ms.
Refiners :[Domain max(s): 184/184 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 165/177 constraints, Known Traps: 87/87 constraints]
After SMT, in 60404ms problems are : Problem set: 12 solved, 165 unsolved
Search for dead transitions found 12 dead transitions in 60446ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 184/184 places, 166/178 transitions.
Reduce places removed 6 places and 0 transitions.
Starting structural reductions in STATESPACE mode, iteration 2 : 178/184 places, 166/178 transitions.
Finished structural reductions in STATESPACE mode , in 2 iterations and 60703 ms. Remains : 178/184 places, 166/178 transitions.
Final net has 178 places and 166 transitions.
[2024-06-02 22:58:41] [INFO ] Flatten gal took : 104 ms
[2024-06-02 22:58:41] [INFO ] Applying decomposition
[2024-06-02 22:58:41] [INFO ] Flatten gal took : 31 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/graph12259126611170765537.txt' '-o' '/tmp/graph12259126611170765537.bin' '-w' '/tmp/graph12259126611170765537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12259126611170765537.bin' '-l' '-1' '-v' '-w' '/tmp/graph12259126611170765537.weights' '-q' '0' '-e' '0.001'
[2024-06-02 22:58:41] [INFO ] Decomposing Gal with order
[2024-06-02 22:58:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:58:42] [INFO ] Removed a total of 12 redundant transitions.
[2024-06-02 22:58:42] [INFO ] Flatten gal took : 103 ms
[2024-06-02 22:58:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2024-06-02 22:58:42] [INFO ] Time to serialize gal into /tmp/StateSpace9241543074598054093.gal : 21 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/StateSpace9241543074598054093.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,1.49425e+10,12.2541,245372,5460,338,382784,2724,407,1.11409e+06,109,14670,0
Total reachable state count : 14942533802

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

BK_STOP 1717369134595

--------------------
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-14"
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-14, 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-171734920000112"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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