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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K 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 95K 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 160K 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 1717364736100

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-06-02 21:45:38] [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 21:45:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:45:38] [INFO ] Load time of PNML (sax parser for PT used): 234 ms
[2024-06-02 21:45:39] [INFO ] Transformed 150 places.
[2024-06-02 21:45:39] [INFO ] Transformed 478 transitions.
[2024-06-02 21:45:39] [INFO ] Found NUPN structural information;
[2024-06-02 21:45:39] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 527 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Starting structural reductions in STATESPACE mode, iteration 0 : 150/150 places, 469/469 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
[2024-06-02 21:45:39] [INFO ] Redundant transitions in 30 ms returned []
Running 465 sub problems to find dead transitions.
[2024-06-02 21:45:39] [INFO ] Flow matrix only has 394 transitions (discarded 72 similar events)
// Phase 1: matrix 394 rows 150 cols
[2024-06-02 21:45:39] [INFO ] Computed 23 invariants in 16 ms
[2024-06-02 21:45:39] [INFO ] State equation strengthened by 171 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 14/163 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD412 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/150 variables, 9/172 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/173 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:45:47] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 19 ms to minimize.
[2024-06-02 21:45:48] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:45:48] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 3 ms to minimize.
[2024-06-02 21:45:48] [INFO ] Deduced a trap composed of 29 places in 144 ms of which 4 ms to minimize.
[2024-06-02 21:45:48] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:45:48] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:45:48] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:45:48] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 2 ms to minimize.
[2024-06-02 21:45:49] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:45:49] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:45:49] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2024-06-02 21:45:49] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:45:49] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-06-02 21:45:49] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 1 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:45:50] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 20/193 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:45:51] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-06-02 21:45:51] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:45:51] [INFO ] Deduced a trap composed of 48 places in 115 ms of which 2 ms to minimize.
[2024-06-02 21:45:51] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:45:51] [INFO ] Deduced a trap composed of 20 places in 129 ms of which 2 ms to minimize.
[2024-06-02 21:45:51] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 2 ms to minimize.
[2024-06-02 21:45:52] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-02 21:45:52] [INFO ] Deduced a trap composed of 41 places in 97 ms of which 6 ms to minimize.
[2024-06-02 21:45:52] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-06-02 21:45:52] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 2 ms to minimize.
[2024-06-02 21:45:52] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:45:52] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 2 ms to minimize.
[2024-06-02 21:45:52] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-06-02 21:45:53] [INFO ] Deduced a trap composed of 39 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:45:53] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 2 ms to minimize.
[2024-06-02 21:45:53] [INFO ] Deduced a trap composed of 20 places in 75 ms of which 1 ms to minimize.
[2024-06-02 21:45:53] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:45:54] [INFO ] Deduced a trap composed of 33 places in 90 ms of which 2 ms to minimize.
[2024-06-02 21:45:54] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:45:55] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 20/213 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:45:57] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2024-06-02 21:45:57] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-02 21:45:57] [INFO ] Deduced a trap composed of 36 places in 145 ms of which 2 ms to minimize.
[2024-06-02 21:45:57] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 4/217 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:45:59] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:45:59] [INFO ] Deduced a trap composed of 28 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:45:59] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2024-06-02 21:46:00] [INFO ] Deduced a trap composed of 43 places in 128 ms of which 2 ms to minimize.
[2024-06-02 21:46:00] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-06-02 21:46:01] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 6/223 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/223 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 10 (OVERLAPS) 394/544 variables, 150/373 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 171/544 constraints. Problems are: Problem set: 108 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 544/544 variables, and 544 constraints, problems are : Problem set: 108 solved, 357 unsolved in 30048 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 108 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 149/149 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 14/163 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/163 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 3 (OVERLAPS) 1/150 variables, 9/172 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/173 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 50/223 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:46:13] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:46:13] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:46:13] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 3 ms to minimize.
[2024-06-02 21:46:15] [INFO ] Deduced a trap composed of 26 places in 103 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 4/227 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:46:15] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:46:15] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:46:16] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 4 ms to minimize.
[2024-06-02 21:46:16] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 4/231 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:46:18] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2024-06-02 21:46:18] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:46:18] [INFO ] Deduced a trap composed of 44 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:46:19] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:46:19] [INFO ] Deduced a trap composed of 39 places in 93 ms of which 1 ms to minimize.
[2024-06-02 21:46:19] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 6/237 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/237 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 10 (OVERLAPS) 394/544 variables, 150/387 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/544 variables, 171/558 constraints. Problems are: Problem set: 108 solved, 357 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/544 variables, 357/915 constraints. Problems are: Problem set: 108 solved, 357 unsolved
[2024-06-02 21:46:39] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:46:39] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:46:39] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:46:39] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:46:39] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 544/544 variables, and 920 constraints, problems are : Problem set: 108 solved, 357 unsolved in 30017 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 357/465 constraints, Known Traps: 69/69 constraints]
After SMT, in 61127ms problems are : Problem set: 108 solved, 357 unsolved
Search for dead transitions found 108 dead transitions in 61182ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in STATESPACE mode, iteration 1 : 150/150 places, 358/469 transitions.
[2024-06-02 21:46:40] [INFO ] Redundant transitions in 6 ms returned []
Finished structural reductions in STATESPACE mode , in 2 iterations and 61608 ms. Remains : 150/150 places, 358/469 transitions.
Final net has 150 places and 358 transitions.
[2024-06-02 21:46:41] [INFO ] Flatten gal took : 119 ms
[2024-06-02 21:46:41] [INFO ] Applying decomposition
[2024-06-02 21:46:41] [INFO ] Flatten gal took : 43 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/graph16273678791145152308.txt' '-o' '/tmp/graph16273678791145152308.bin' '-w' '/tmp/graph16273678791145152308.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16273678791145152308.bin' '-l' '-1' '-v' '-w' '/tmp/graph16273678791145152308.weights' '-q' '0' '-e' '0.001'
[2024-06-02 21:46:41] [INFO ] Decomposing Gal with order
[2024-06-02 21:46:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 21:46:41] [INFO ] Removed a total of 516 redundant transitions.
[2024-06-02 21:46:41] [INFO ] Flatten gal took : 128 ms
[2024-06-02 21:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 105 labels/synchronizations in 20 ms.
[2024-06-02 21:46:41] [INFO ] Time to serialize gal into /tmp/StateSpace16611765748066348729.gal : 12 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/StateSpace16611765748066348729.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
Detected timeout of ITS tools.
[2024-06-02 22:07:02] [INFO ] Applying decomposition
[2024-06-02 22:07:02] [INFO ] Flatten gal took : 53 ms
[2024-06-02 22:07:02] [INFO ] Decomposing Gal with order
[2024-06-02 22:07:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 22:07:02] [INFO ] Removed a total of 708 redundant transitions.
[2024-06-02 22:07:02] [INFO ] Flatten gal took : 63 ms
[2024-06-02 22:07:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 9 ms.
[2024-06-02 22:07:02] [INFO ] Time to serialize gal into /tmp/StateSpace8114977143702226517.gal : 8 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/StateSpace8114977143702226517.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
ITS-tools command line returned an error code 137
[2024-06-02 22:26:24] [INFO ] Flatten gal took : 27 ms
[2024-06-02 22:26:24] [INFO ] Input system was already deterministic with 358 transitions.
[2024-06-02 22:26:24] [INFO ] Transformed 150 places.
[2024-06-02 22:26:24] [INFO ] Transformed 358 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-06-02 22:26:24] [INFO ] Time to serialize gal into /tmp/StateSpace10582864233880000250.gal : 7 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/StateSpace10582864233880000250.gal' '-t' 'CGAL' '--stats' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

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 ...286
Successfully loaded order from file /home/mcc/execution/model.ord
ITS-tools command line returned an error code 137
Total runtime 3252912 ms.

BK_STOP 1717367991609

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

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