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.r579-smll-171734921400162.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 ltsminxred
Input is MedleyA-PT-21, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400162
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K 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 22K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K 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 70K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-21-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717363849088

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:30:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:30:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:30:52] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2024-06-02 21:30:52] [INFO ] Transformed 306 places.
[2024-06-02 21:30:52] [INFO ] Transformed 298 transitions.
[2024-06-02 21:30:52] [INFO ] Found NUPN structural information;
[2024-06-02 21:30:52] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 446 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Support contains 143 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 292 transition count 284
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 292 transition count 284
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 33 place count 287 transition count 279
Iterating global reduction 0 with 5 rules applied. Total rules applied 38 place count 287 transition count 279
Applied a total of 38 rules in 129 ms. Remains 287 /306 variables (removed 19) and now considering 279/298 (removed 19) transitions.
// Phase 1: matrix 279 rows 287 cols
[2024-06-02 21:30:52] [INFO ] Computed 20 invariants in 46 ms
[2024-06-02 21:30:53] [INFO ] Implicit Places using invariants in 577 ms returned []
[2024-06-02 21:30:53] [INFO ] Invariant cache hit.
[2024-06-02 21:30:54] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 1200 ms to find 0 implicit places.
Running 278 sub problems to find dead transitions.
[2024-06-02 21:30:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 22 ms to minimize.
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 3 ms to minimize.
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 6 ms to minimize.
[2024-06-02 21:30:59] [INFO ] Deduced a trap composed of 13 places in 149 ms of which 3 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 16 places in 109 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 31 places in 70 ms of which 2 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-06-02 21:31:00] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 3 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 3 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 3 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 84 places in 194 ms of which 5 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 37 places in 45 ms of which 2 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 41 places in 39 ms of which 2 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 35 places in 36 ms of which 1 ms to minimize.
[2024-06-02 21:31:01] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:02] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:31:02] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 3 ms to minimize.
[2024-06-02 21:31:02] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 2 ms to minimize.
[2024-06-02 21:31:02] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:31:03] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:31:03] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 3 ms to minimize.
[2024-06-02 21:31:03] [INFO ] Deduced a trap composed of 84 places in 228 ms of which 5 ms to minimize.
[2024-06-02 21:31:03] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 5 ms to minimize.
[2024-06-02 21:31:04] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 4 ms to minimize.
[2024-06-02 21:31:04] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:31:04] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:31:04] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 3 ms to minimize.
[2024-06-02 21:31:04] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 3 ms to minimize.
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 3 ms to minimize.
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 3 ms to minimize.
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 3 ms to minimize.
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 3 ms to minimize.
[2024-06-02 21:31:05] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:08] [INFO ] Deduced a trap composed of 51 places in 88 ms of which 3 ms to minimize.
[2024-06-02 21:31:09] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 2 ms to minimize.
[2024-06-02 21:31:09] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:31:09] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-06-02 21:31:09] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 3 ms to minimize.
[2024-06-02 21:31:10] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:31:10] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-06-02 21:31:10] [INFO ] Deduced a trap composed of 80 places in 161 ms of which 4 ms to minimize.
[2024-06-02 21:31:10] [INFO ] Deduced a trap composed of 43 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:31:11] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 1 ms to minimize.
[2024-06-02 21:31:11] [INFO ] Deduced a trap composed of 46 places in 69 ms of which 4 ms to minimize.
[2024-06-02 21:31:11] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 2 ms to minimize.
[2024-06-02 21:31:11] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-06-02 21:31:12] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 2 ms to minimize.
[2024-06-02 21:31:12] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:31:12] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 16/76 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:13] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 5 ms to minimize.
[2024-06-02 21:31:13] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 2 ms to minimize.
[2024-06-02 21:31:14] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 2 ms to minimize.
[2024-06-02 21:31:14] [INFO ] Deduced a trap composed of 41 places in 48 ms of which 2 ms to minimize.
[2024-06-02 21:31:15] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-06-02 21:31:15] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:31:16] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:17] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
[2024-06-02 21:31:18] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2024-06-02 21:31:19] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 2 ms to minimize.
[2024-06-02 21:31:19] [INFO ] Deduced a trap composed of 38 places in 72 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:23] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 1.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 287/566 variables, and 88 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/287 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 68/68 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 1/287 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/287 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:27] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 2 ms to minimize.
[2024-06-02 21:31:29] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:31] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:31:32] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 2 ms to minimize.
[2024-06-02 21:31:33] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:31:35] [INFO ] Deduced a trap composed of 35 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 7 (OVERLAPS) 279/566 variables, 287/382 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 278/660 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:41] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 4 ms to minimize.
[2024-06-02 21:31:41] [INFO ] Deduced a trap composed of 31 places in 121 ms of which 3 ms to minimize.
[2024-06-02 21:31:44] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 4 ms to minimize.
[2024-06-02 21:31:44] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 4 ms to minimize.
[2024-06-02 21:31:45] [INFO ] Deduced a trap composed of 82 places in 152 ms of which 4 ms to minimize.
[2024-06-02 21:31:45] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 3 ms to minimize.
[2024-06-02 21:31:45] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 3 ms to minimize.
[2024-06-02 21:31:46] [INFO ] Deduced a trap composed of 84 places in 189 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 8/668 constraints. Problems are: Problem set: 0 solved, 278 unsolved
[2024-06-02 21:31:52] [INFO ] Deduced a trap composed of 81 places in 141 ms of which 3 ms to minimize.
[2024-06-02 21:31:53] [INFO ] Deduced a trap composed of 84 places in 95 ms of which 3 ms to minimize.
[2024-06-02 21:31:53] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 1)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 1)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 1)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 566/566 variables, and 671 constraints, problems are : Problem set: 0 solved, 278 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 86/86 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 60264ms
Starting structural reductions in LTL mode, iteration 1 : 287/306 places, 279/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61641 ms. Remains : 287/306 places, 279/298 transitions.
Support contains 143 out of 287 places after structural reductions.
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 69 ms
[2024-06-02 21:31:54] [INFO ] Flatten gal took : 30 ms
[2024-06-02 21:31:54] [INFO ] Input system was already deterministic with 279 transitions.
Support contains 141 out of 287 places (down from 143) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2207 ms. (18 steps per ms) remains 20/121 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 19/19 properties
[2024-06-02 21:31:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 230/263 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 24/287 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 279/566 variables, 287/307 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/566 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/566 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 307 constraints, problems are : Problem set: 0 solved, 19 unsolved in 961 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 230/263 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 2 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 1 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 43 places in 51 ms of which 1 ms to minimize.
Problem AtomicPropp76 is UNSAT
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 2 ms to minimize.
[2024-06-02 21:31:57] [INFO ] Deduced a trap composed of 18 places in 55 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 9/26 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 24/287 variables, 3/29 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-06-02 21:31:58] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/30 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 279/566 variables, 287/317 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/566 variables, 18/335 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-06-02 21:31:58] [INFO ] Deduced a trap composed of 32 places in 49 ms of which 2 ms to minimize.
[2024-06-02 21:31:58] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/566 variables, 3/338 constraints. Problems are: Problem set: 1 solved, 18 unsolved
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 1 ms to minimize.
[2024-06-02 21:31:59] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 2/340 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/566 variables, 0/340 constraints. Problems are: Problem set: 1 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 340 constraints, problems are : Problem set: 1 solved, 18 unsolved in 3440 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 18/19 constraints, Known Traps: 15/15 constraints]
After SMT, in 4424ms problems are : Problem set: 1 solved, 18 unsolved
Parikh walk visited 14 properties in 12272 ms.
Support contains 10 out of 287 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 287/287 places, 279/279 transitions.
Graph (trivial) has 199 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 282 transition count 203
Reduce places removed 70 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 72 rules applied. Total rules applied 143 place count 212 transition count 201
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 145 place count 210 transition count 201
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 145 place count 210 transition count 166
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 215 place count 175 transition count 166
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 244 place count 146 transition count 137
Iterating global reduction 3 with 29 rules applied. Total rules applied 273 place count 146 transition count 137
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 273 place count 146 transition count 129
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 289 place count 138 transition count 129
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 357 place count 104 transition count 95
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 367 place count 99 transition count 126
Free-agglomeration rule applied 19 times.
Iterating global reduction 3 with 19 rules applied. Total rules applied 386 place count 99 transition count 107
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 407 place count 80 transition count 105
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 409 place count 80 transition count 105
Applied a total of 409 rules in 93 ms. Remains 80 /287 variables (removed 207) and now considering 105/279 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 80/287 places, 105/279 transitions.
RANDOM walk for 40000 steps (1007 resets) in 715 ms. (55 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (124 resets) in 127 ms. (312 steps per ms) remains 1/2 properties
BEST_FIRST walk for 31203 steps (104 resets) in 92 ms. (335 steps per ms) remains 0/1 properties
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-02 21:32:12] [INFO ] Flatten gal took : 19 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 279 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Graph (trivial) has 214 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 281 transition count 195
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 157 place count 203 transition count 195
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 33 Pre rules applied. Total rules applied 157 place count 203 transition count 162
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 223 place count 170 transition count 162
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 256 place count 137 transition count 129
Iterating global reduction 2 with 33 rules applied. Total rules applied 289 place count 137 transition count 129
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 289 place count 137 transition count 118
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 311 place count 126 transition count 118
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 357 place count 103 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 358 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 359 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 48 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 361 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 365 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 371 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 373 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 373 place count 94 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 375 place count 93 transition count 85
Applied a total of 375 rules in 61 ms. Remains 93 /287 variables (removed 194) and now considering 85/279 (removed 194) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 93/287 places, 85/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 85 transitions.
RANDOM walk for 291 steps (6 resets) in 6 ms. (41 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 253 transition count 245
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 253 transition count 245
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 94 place count 227 transition count 219
Iterating global reduction 0 with 26 rules applied. Total rules applied 120 place count 227 transition count 219
Applied a total of 120 rules in 18 ms. Remains 227 /287 variables (removed 60) and now considering 219/279 (removed 60) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 227/287 places, 219/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 15 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 101 place count 223 transition count 215
Iterating global reduction 0 with 27 rules applied. Total rules applied 128 place count 223 transition count 215
Applied a total of 128 rules in 20 ms. Remains 223 /287 variables (removed 64) and now considering 215/279 (removed 64) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 223/287 places, 215/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 102 place count 222 transition count 214
Iterating global reduction 0 with 28 rules applied. Total rules applied 130 place count 222 transition count 214
Applied a total of 130 rules in 20 ms. Remains 222 /287 variables (removed 65) and now considering 214/279 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 222/287 places, 214/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 214 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 251 transition count 243
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 251 transition count 243
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 99 place count 224 transition count 216
Iterating global reduction 0 with 27 rules applied. Total rules applied 126 place count 224 transition count 216
Applied a total of 126 rules in 18 ms. Remains 224 /287 variables (removed 63) and now considering 216/279 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 224/287 places, 216/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 260 transition count 252
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 260 transition count 252
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 71 place count 243 transition count 235
Iterating global reduction 0 with 17 rules applied. Total rules applied 88 place count 243 transition count 235
Applied a total of 88 rules in 17 ms. Remains 243 /287 variables (removed 44) and now considering 235/279 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 243/287 places, 235/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 254 transition count 246
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 254 transition count 246
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 88 place count 232 transition count 224
Iterating global reduction 0 with 22 rules applied. Total rules applied 110 place count 232 transition count 224
Applied a total of 110 rules in 15 ms. Remains 232 /287 variables (removed 55) and now considering 224/279 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 232/287 places, 224/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 224 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 253 transition count 245
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 253 transition count 245
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 92 place count 229 transition count 221
Iterating global reduction 0 with 24 rules applied. Total rules applied 116 place count 229 transition count 221
Applied a total of 116 rules in 16 ms. Remains 229 /287 variables (removed 58) and now considering 221/279 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 229/287 places, 221/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Graph (trivial) has 212 edges and 287 vertex of which 6 / 287 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 281 transition count 195
Reduce places removed 78 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 203 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 159 place count 202 transition count 194
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 159 place count 202 transition count 162
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 223 place count 170 transition count 162
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 256 place count 137 transition count 129
Iterating global reduction 3 with 33 rules applied. Total rules applied 289 place count 137 transition count 129
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 289 place count 137 transition count 118
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 311 place count 126 transition count 118
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 357 place count 103 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 358 place count 102 transition count 94
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 46 edges and 101 vertex of which 5 / 101 are part of one of the 2 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 360 place count 98 transition count 94
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 364 place count 97 transition count 91
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 370 place count 94 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 372 place count 94 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 372 place count 94 transition count 85
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 374 place count 93 transition count 85
Applied a total of 374 rules in 44 ms. Remains 93 /287 variables (removed 194) and now considering 85/279 (removed 194) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 93/287 places, 85/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 5 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 85 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 100 place count 224 transition count 216
Iterating global reduction 0 with 26 rules applied. Total rules applied 126 place count 224 transition count 216
Applied a total of 126 rules in 18 ms. Remains 224 /287 variables (removed 63) and now considering 216/279 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 224/287 places, 216/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 251 transition count 243
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 251 transition count 243
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 97 place count 226 transition count 218
Iterating global reduction 0 with 25 rules applied. Total rules applied 122 place count 226 transition count 218
Applied a total of 122 rules in 18 ms. Remains 226 /287 variables (removed 61) and now considering 218/279 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 226/287 places, 218/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 101 place count 223 transition count 215
Iterating global reduction 0 with 27 rules applied. Total rules applied 128 place count 223 transition count 215
Applied a total of 128 rules in 19 ms. Remains 223 /287 variables (removed 64) and now considering 215/279 (removed 64) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 223/287 places, 215/279 transitions.
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:13] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:32:13] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 286 transition count 205
Reduce places removed 73 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 77 rules applied. Total rules applied 150 place count 213 transition count 201
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 154 place count 209 transition count 201
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 154 place count 209 transition count 168
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 220 place count 176 transition count 168
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 249 place count 147 transition count 139
Iterating global reduction 3 with 29 rules applied. Total rules applied 278 place count 147 transition count 139
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 278 place count 147 transition count 131
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 294 place count 139 transition count 131
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 344 place count 114 transition count 106
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 345 place count 114 transition count 106
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 346 place count 113 transition count 105
Applied a total of 346 rules in 39 ms. Remains 113 /287 variables (removed 174) and now considering 105/279 (removed 174) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 113/287 places, 105/279 transitions.
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 5 ms
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:32:14] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 252 transition count 244
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 252 transition count 244
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 96 place count 226 transition count 218
Iterating global reduction 0 with 26 rules applied. Total rules applied 122 place count 226 transition count 218
Applied a total of 122 rules in 19 ms. Remains 226 /287 variables (removed 61) and now considering 218/279 (removed 61) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 226/287 places, 218/279 transitions.
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:14] [INFO ] Input system was already deterministic with 218 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 250 transition count 242
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 250 transition count 242
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 100 place count 224 transition count 216
Iterating global reduction 0 with 26 rules applied. Total rules applied 126 place count 224 transition count 216
Applied a total of 126 rules in 19 ms. Remains 224 /287 variables (removed 63) and now considering 216/279 (removed 63) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 224/287 places, 216/279 transitions.
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 16 ms
[2024-06-02 21:32:14] [INFO ] Input system was already deterministic with 216 transitions.
Starting structural reductions in LTL mode, iteration 0 : 287/287 places, 279/279 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 255 transition count 247
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 255 transition count 247
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 88 place count 231 transition count 223
Iterating global reduction 0 with 24 rules applied. Total rules applied 112 place count 231 transition count 223
Applied a total of 112 rules in 18 ms. Remains 231 /287 variables (removed 56) and now considering 223/279 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 231/287 places, 223/279 transitions.
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:32:14] [INFO ] Input system was already deterministic with 223 transitions.
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:32:14] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:32:14] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-02 21:32:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 287 places, 279 transitions and 662 arcs took 5 ms.
Total runtime 82355 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-01
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-02
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-03
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-04
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-05
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-06
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-07
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-08
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-09
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-10
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-11
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-12
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-13
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-14
Could not compute solution for formula : MedleyA-PT-21-CTLFireability-2024-15

BK_STOP 1717363934770

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name MedleyA-PT-21-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/835/ctl_0_
ctl formula name MedleyA-PT-21-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/835/ctl_1_
ctl formula name MedleyA-PT-21-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/835/ctl_2_
ctl formula name MedleyA-PT-21-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/835/ctl_3_
ctl formula name MedleyA-PT-21-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/835/ctl_4_
ctl formula name MedleyA-PT-21-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/835/ctl_5_
ctl formula name MedleyA-PT-21-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/835/ctl_6_
ctl formula name MedleyA-PT-21-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/835/ctl_7_
ctl formula name MedleyA-PT-21-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/835/ctl_8_
ctl formula name MedleyA-PT-21-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/835/ctl_9_
ctl formula name MedleyA-PT-21-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/835/ctl_10_
ctl formula name MedleyA-PT-21-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/835/ctl_11_
ctl formula name MedleyA-PT-21-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/835/ctl_12_
ctl formula name MedleyA-PT-21-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/835/ctl_13_
ctl formula name MedleyA-PT-21-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/835/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-21"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is MedleyA-PT-21, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921400162"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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