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.r026-smll-171620167000088.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 AutoFlight-PT-02b, examination is StateSpace
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-smll-171620167000088
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 22:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 22:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 22:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 22:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 48K May 18 16:42 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 1716248502011

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StateSpace
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-02b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StateSpace PT
Running Version 202405141337
[2024-05-20 23:41:43] [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-20 23:41:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 23:41:44] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-20 23:41:44] [INFO ] Transformed 206 places.
[2024-05-20 23:41:44] [INFO ] Transformed 204 transitions.
[2024-05-20 23:41:44] [INFO ] Found NUPN structural information;
[2024-05-20 23:41:44] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 270 ms.
Starting structural reductions in STATESPACE mode, iteration 0 : 206/206 places, 204/204 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
[2024-05-20 23:41:44] [INFO ] Redundant transitions in 10 ms returned []
Running 199 sub problems to find dead transitions.
// Phase 1: matrix 200 rows 206 cols
[2024-05-20 23:41:44] [INFO ] Computed 16 invariants in 22 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 15/220 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 15 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 42 places in 75 ms of which 3 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 1 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2024-05-20 23:41:48] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 2 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 31 places in 45 ms of which 1 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 3 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 32 places in 94 ms of which 2 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 3 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 2 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 3 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 3 ms to minimize.
[2024-05-20 23:41:49] [INFO ] Deduced a trap composed of 41 places in 87 ms of which 3 ms to minimize.
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 30 places in 105 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 2 ms to minimize.
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 2 ms to minimize.
[2024-05-20 23:41:50] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 3 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 30 places in 89 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 3 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 7 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 41 places in 66 ms of which 2 ms to minimize.
[2024-05-20 23:41:51] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2024-05-20 23:41:52] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 2 ms to minimize.
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 1 ms to minimize.
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 41 places in 91 ms of which 3 ms to minimize.
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-20 23:41:53] [INFO ] Deduced a trap composed of 45 places in 53 ms of which 1 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 43 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 2 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 3 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-20 23:41:54] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-05-20 23:41:55] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-20 23:41:55] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-20 23:41:55] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:41:55] [INFO ] Deduced a trap composed of 41 places in 83 ms of which 3 ms to minimize.
[2024-05-20 23:41:55] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 2 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 2 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 33 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 3 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 27 places in 31 ms of which 1 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 27 places in 40 ms of which 2 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2024-05-20 23:41:56] [INFO ] Deduced a trap composed of 29 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 11/293 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:41:57] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 2 ms to minimize.
[2024-05-20 23:41:57] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 3 ms to minimize.
[2024-05-20 23:41:57] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 2 ms to minimize.
[2024-05-20 23:41:57] [INFO ] Deduced a trap composed of 42 places in 81 ms of which 2 ms to minimize.
[2024-05-20 23:41:57] [INFO ] Deduced a trap composed of 53 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 5/298 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:00] [INFO ] Deduced a trap composed of 34 places in 101 ms of which 3 ms to minimize.
[2024-05-20 23:42:00] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-20 23:42:00] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2024-05-20 23:42:00] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-20 23:42:00] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-20 23:42:01] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-20 23:42:01] [INFO ] Deduced a trap composed of 36 places in 80 ms of which 3 ms to minimize.
[2024-05-20 23:42:01] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 8/306 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:01] [INFO ] Deduced a trap composed of 47 places in 77 ms of which 3 ms to minimize.
[2024-05-20 23:42:01] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 3 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 2 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 2 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 2 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 2 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 39 places in 96 ms of which 3 ms to minimize.
[2024-05-20 23:42:02] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 11/317 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:04] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2024-05-20 23:42:04] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 2 ms to minimize.
[2024-05-20 23:42:04] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2024-05-20 23:42:04] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/206 variables, 4/321 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:06] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/206 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:08] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/206 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/206 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 16 (OVERLAPS) 200/406 variables, 206/529 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:11] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/406 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 406/406 variables, and 530 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30024 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 205/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/205 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (OVERLAPS) 1/206 variables, 15/220 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 102/324 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:16] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2024-05-20 23:42:16] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:18] [INFO ] Deduced a trap composed of 33 places in 60 ms of which 2 ms to minimize.
[2024-05-20 23:42:18] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
[2024-05-20 23:42:18] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 2 ms to minimize.
[2024-05-20 23:42:18] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 4/330 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 200/406 variables, 206/536 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 199/735 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:21] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-05-20 23:42:21] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-20 23:42:21] [INFO ] Deduced a trap composed of 32 places in 29 ms of which 0 ms to minimize.
[2024-05-20 23:42:22] [INFO ] Deduced a trap composed of 35 places in 42 ms of which 1 ms to minimize.
[2024-05-20 23:42:24] [INFO ] Deduced a trap composed of 37 places in 48 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 5/740 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 199 unsolved
[2024-05-20 23:42:37] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2024-05-20 23:42:37] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:42:37] [INFO ] Deduced a trap composed of 51 places in 55 ms of which 1 ms to minimize.
[2024-05-20 23:42:38] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 2 ms to minimize.
[2024-05-20 23:42:38] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-20 23:42:38] [INFO ] Deduced a trap composed of 30 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/406 variables, 6/746 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 746 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30012 ms.
Refiners :[Domain max(s): 206/206 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 119/119 constraints]
After SMT, in 60211ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Starting structural reductions in STATESPACE mode, iteration 1 : 206/206 places, 200/204 transitions.
Finished structural reductions in STATESPACE mode , in 1 iterations and 60412 ms. Remains : 206/206 places, 200/204 transitions.
Final net has 206 places and 200 transitions.
[2024-05-20 23:42:44] [INFO ] Flatten gal took : 72 ms
[2024-05-20 23:42:44] [INFO ] Applying decomposition
[2024-05-20 23:42:44] [INFO ] Flatten gal took : 21 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/graph8083440232389023281.txt' '-o' '/tmp/graph8083440232389023281.bin' '-w' '/tmp/graph8083440232389023281.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8083440232389023281.bin' '-l' '-1' '-v' '-w' '/tmp/graph8083440232389023281.weights' '-q' '0' '-e' '0.001'
[2024-05-20 23:42:45] [INFO ] Decomposing Gal with order
[2024-05-20 23:42:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 23:42:45] [INFO ] Removed a total of 19 redundant transitions.
[2024-05-20 23:42:45] [INFO ] Flatten gal took : 77 ms
[2024-05-20 23:42:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 7 ms.
[2024-05-20 23:42:45] [INFO ] Time to serialize gal into /tmp/StateSpace10863173228882632883.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/StateSpace10863173228882632883.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,1.61545e+13,1.02107,31940,5002,16,56784,187,416,92903,33,357,0
Total reachable state count : 16154516414537

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

BK_STOP 1716248566425

--------------------
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="AutoFlight-PT-02b"
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 AutoFlight-PT-02b, 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 r026-smll-171620167000088"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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