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.r553-tall-171734901300290.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 FireWire-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300290
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.1K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 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 9.3K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K 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 84K 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 FireWire-PT-16-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717356926079

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:35:27] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:35:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:35:27] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-02 19:35:27] [INFO ] Transformed 254 places.
[2024-06-02 19:35:27] [INFO ] Transformed 368 transitions.
[2024-06-02 19:35:27] [INFO ] Found NUPN structural information;
[2024-06-02 19:35:27] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 85 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 368
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 40 place count 214 transition count 331
Iterating global reduction 1 with 37 rules applied. Total rules applied 77 place count 214 transition count 331
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 85 place count 206 transition count 323
Iterating global reduction 1 with 8 rules applied. Total rules applied 93 place count 206 transition count 323
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 94 place count 205 transition count 322
Iterating global reduction 1 with 1 rules applied. Total rules applied 95 place count 205 transition count 322
Applied a total of 95 rules in 51 ms. Remains 205 /254 variables (removed 49) and now considering 322/368 (removed 46) transitions.
// Phase 1: matrix 322 rows 205 cols
[2024-06-02 19:35:27] [INFO ] Computed 4 invariants in 19 ms
[2024-06-02 19:35:27] [INFO ] Implicit Places using invariants in 306 ms returned []
[2024-06-02 19:35:27] [INFO ] Invariant cache hit.
[2024-06-02 19:35:28] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 321 sub problems to find dead transitions.
[2024-06-02 19:35:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 321 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 321 unsolved
[2024-06-02 19:35:30] [INFO ] Deduced a trap composed of 102 places in 97 ms of which 15 ms to minimize.
[2024-06-02 19:35:31] [INFO ] Deduced a trap composed of 99 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:35:31] [INFO ] Deduced a trap composed of 85 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:35:31] [INFO ] Deduced a trap composed of 28 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:35:31] [INFO ] Deduced a trap composed of 99 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:35:31] [INFO ] Deduced a trap composed of 61 places in 70 ms of which 2 ms to minimize.
[2024-06-02 19:35:31] [INFO ] Deduced a trap composed of 82 places in 47 ms of which 1 ms to minimize.
[2024-06-02 19:35:31] [INFO ] Deduced a trap composed of 107 places in 71 ms of which 2 ms to minimize.
[2024-06-02 19:35:32] [INFO ] Deduced a trap composed of 99 places in 224 ms of which 10 ms to minimize.
[2024-06-02 19:35:32] [INFO ] Deduced a trap composed of 71 places in 132 ms of which 1 ms to minimize.
[2024-06-02 19:35:32] [INFO ] Deduced a trap composed of 101 places in 263 ms of which 2 ms to minimize.
Problem TDEAD177 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD296 is UNSAT
[2024-06-02 19:35:33] [INFO ] Deduced a trap composed of 103 places in 69 ms of which 1 ms to minimize.
Problem TDEAD302 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 12/16 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 19:35:34] [INFO ] Deduced a trap composed of 89 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:35:34] [INFO ] Deduced a trap composed of 98 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 2/18 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 19:35:36] [INFO ] Deduced a trap composed of 85 places in 78 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 1/19 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 19:35:38] [INFO ] Deduced a trap composed of 102 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 1/20 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 0/20 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 322/527 variables, 205/225 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/527 variables, 0/225 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 19:35:46] [INFO ] Deduced a trap composed of 125 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:35:46] [INFO ] Deduced a trap composed of 75 places in 79 ms of which 2 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/527 variables, 2/227 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/527 variables, 0/227 constraints. Problems are: Problem set: 11 solved, 310 unsolved
[2024-06-02 19:35:52] [INFO ] Deduced a trap composed of 85 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:35:52] [INFO ] Deduced a trap composed of 82 places in 65 ms of which 2 ms to minimize.
[2024-06-02 19:35:52] [INFO ] Deduced a trap composed of 105 places in 75 ms of which 2 ms to minimize.
[2024-06-02 19:35:52] [INFO ] Deduced a trap composed of 106 places in 64 ms of which 2 ms to minimize.
[2024-06-02 19:35:52] [INFO ] Deduced a trap composed of 103 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:35:52] [INFO ] Deduced a trap composed of 105 places in 69 ms of which 4 ms to minimize.
[2024-06-02 19:35:53] [INFO ] Deduced a trap composed of 106 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:35:53] [INFO ] Deduced a trap composed of 103 places in 74 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/527 variables, 8/235 constraints. Problems are: Problem set: 11 solved, 310 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 12 (INCLUDED_ONLY) 0/527 variables, 0/235 constraints. Problems are: Problem set: 11 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 527/527 variables, and 235 constraints, problems are : Problem set: 11 solved, 310 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 321/321 constraints, Known Traps: 26/26 constraints]
Escalating to Integer solving :Problem set: 11 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/204 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 1 (OVERLAPS) 1/205 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 26/30 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/205 variables, 0/30 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 322/527 variables, 205/235 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/527 variables, 310/545 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/527 variables, 0/545 constraints. Problems are: Problem set: 11 solved, 310 unsolved
At refinement iteration 7 (OVERLAPS) 0/527 variables, 0/545 constraints. Problems are: Problem set: 11 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Int declared 527/527 variables, and 545 constraints, problems are : Problem set: 11 solved, 310 unsolved in 17797 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 310/321 constraints, Known Traps: 26/26 constraints]
After SMT, in 48001ms problems are : Problem set: 11 solved, 310 unsolved
Search for dead transitions found 11 dead transitions in 48025ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 205/254 places, 311/368 transitions.
Applied a total of 0 rules in 11 ms. Remains 205 /205 variables (removed 0) and now considering 311/311 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 48705 ms. Remains : 205/254 places, 311/368 transitions.
Support contains 85 out of 205 places after structural reductions.
[2024-06-02 19:36:16] [INFO ] Flatten gal took : 43 ms
[2024-06-02 19:36:16] [INFO ] Flatten gal took : 20 ms
[2024-06-02 19:36:16] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 82 out of 205 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (14 resets) in 1248 ms. (32 steps per ms) remains 47/62 properties
BEST_FIRST walk for 4000 steps (8 resets) in 53 ms. (74 steps per ms) remains 47/47 properties
BEST_FIRST walk for 4001 steps (10 resets) in 137 ms. (28 steps per ms) remains 45/47 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 47 ms. (83 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (10 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (11 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (12 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (11 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 43 ms. (90 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (11 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (10 resets) in 19 ms. (200 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 63 ms. (62 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (11 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (10 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 16 ms. (235 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (11 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (9 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (9 resets) in 17 ms. (222 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 18 ms. (210 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (10 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (11 resets) in 36 ms. (108 steps per ms) remains 45/45 properties
// Phase 1: matrix 311 rows 205 cols
[2024-06-02 19:36:17] [INFO ] Computed 4 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 1 (OVERLAPS) 120/187 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 41 unsolved
[2024-06-02 19:36:17] [INFO ] Deduced a trap composed of 88 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:36:17] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-06-02 19:36:18] [INFO ] Deduced a trap composed of 82 places in 51 ms of which 1 ms to minimize.
[2024-06-02 19:36:18] [INFO ] Deduced a trap composed of 79 places in 65 ms of which 1 ms to minimize.
Problem AtomicPropp13 is UNSAT
[2024-06-02 19:36:18] [INFO ] Deduced a trap composed of 112 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:36:18] [INFO ] Deduced a trap composed of 101 places in 82 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 6/10 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 293/480 variables, 187/197 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/197 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 10/490 variables, 5/202 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 0/202 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 12/502 variables, 5/207 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 0/207 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 10 (OVERLAPS) 10/512 variables, 5/212 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/512 variables, 0/212 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 12 (OVERLAPS) 4/516 variables, 3/215 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 0/215 constraints. Problems are: Problem set: 5 solved, 40 unsolved
At refinement iteration 14 (OVERLAPS) 0/516 variables, 0/215 constraints. Problems are: Problem set: 5 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 516/516 variables, and 215 constraints, problems are : Problem set: 5 solved, 40 unsolved in 3213 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 205/205 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 5 solved, 40 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 40 unsolved
Problem AtomicPropp40 is UNSAT
At refinement iteration 1 (OVERLAPS) 128/186 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 6/10 constraints. Problems are: Problem set: 6 solved, 39 unsolved
[2024-06-02 19:36:21] [INFO ] Deduced a trap composed of 113 places in 78 ms of which 2 ms to minimize.
[2024-06-02 19:36:21] [INFO ] Deduced a trap composed of 93 places in 61 ms of which 2 ms to minimize.
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 2/12 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 291/477 variables, 186/198 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 37/235 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/235 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 9/486 variables, 4/239 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/239 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 10/496 variables, 5/244 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/496 variables, 0/244 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 7/503 variables, 3/247 constraints. Problems are: Problem set: 8 solved, 37 unsolved
[2024-06-02 19:36:24] [INFO ] Deduced a trap composed of 60 places in 50 ms of which 4 ms to minimize.
[2024-06-02 19:36:24] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/503 variables, 2/249 constraints. Problems are: Problem set: 8 solved, 37 unsolved
[2024-06-02 19:36:25] [INFO ] Deduced a trap composed of 85 places in 55 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/503 variables, 1/250 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(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 1)
(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)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/516 variables, and 250 constraints, problems are : Problem set: 8 solved, 37 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/205 constraints, PredecessorRefiner: 37/45 constraints, Known Traps: 11/11 constraints]
After SMT, in 8253ms problems are : Problem set: 8 solved, 37 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 50 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 311/311 transitions.
Graph (trivial) has 111 edges and 205 vertex of which 14 / 205 are part of one of the 2 SCC in 3 ms
Free SCC test removed 12 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 193 transition count 267
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 165 transition count 265
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 164 transition count 260
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 70 place count 159 transition count 260
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 70 place count 159 transition count 252
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 86 place count 151 transition count 252
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 90 place count 147 transition count 248
Iterating global reduction 4 with 4 rules applied. Total rules applied 94 place count 147 transition count 248
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 96 place count 147 transition count 246
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 97 place count 146 transition count 246
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 97 place count 146 transition count 245
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 99 place count 145 transition count 245
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 135 place count 127 transition count 227
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 143 place count 123 transition count 239
Free-agglomeration rule applied 12 times with reduction of 3 identical transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 155 place count 123 transition count 224
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 21 rules applied. Total rules applied 176 place count 111 transition count 215
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 178 place count 111 transition count 213
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 182 place count 111 transition count 213
Applied a total of 182 rules in 68 ms. Remains 111 /205 variables (removed 94) and now considering 213/311 (removed 98) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 111/205 places, 213/311 transitions.
RANDOM walk for 40000 steps (13 resets) in 479 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (16 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 53 ms. (74 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 34 ms. (114 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 25 ms. (153 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (17 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (17 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 19 ms. (200 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 20 ms. (190 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 29 ms. (133 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (15 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 23 ms. (166 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 18 ms. (210 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 30 ms. (129 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (11 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 17 ms. (222 steps per ms) remains 37/37 properties
Probably explored full state space saw : 23012 states, properties seen :36
Probabilistic random walk after 95733 steps, saw 23012 distinct states, run finished after 349 ms. (steps per millisecond=274 ) properties seen :36
Explored full state space saw : 23012 states, properties seen :0
Exhaustive walk after 95733 steps, saw 23012 distinct states, run finished after 98 ms. (steps per millisecond=976 ) properties seen :0
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-06-02 19:36:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 19:36:26] [INFO ] Flatten gal took : 16 ms
FORMULA FireWire-PT-16-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 19:36:26] [INFO ] Flatten gal took : 15 ms
[2024-06-02 19:36:26] [INFO ] Input system was already deterministic with 311 transitions.
Support contains 59 out of 205 places (down from 61) after GAL structural reductions.
Computed a total of 23 stabilizing places and 25 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 172 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 172 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 263
Applied a total of 68 rules in 11 ms. Remains 172 /205 variables (removed 33) and now considering 263/311 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 172/205 places, 263/311 transitions.
[2024-06-02 19:36:26] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 285
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 285
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 173 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 173 transition count 274
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 173 transition count 273
Applied a total of 66 rules in 7 ms. Remains 173 /205 variables (removed 32) and now considering 273/311 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 173/205 places, 273/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 279
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 183 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 51 place count 177 transition count 269
Iterating global reduction 1 with 6 rules applied. Total rules applied 57 place count 177 transition count 269
Applied a total of 57 rules in 7 ms. Remains 177 /205 variables (removed 28) and now considering 269/311 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 177/205 places, 269/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 58 place count 174 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 63 place count 174 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 174 transition count 267
Applied a total of 64 rules in 8 ms. Remains 174 /205 variables (removed 31) and now considering 267/311 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 174/205 places, 267/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 11 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 278
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 278
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 47 place count 182 transition count 277
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 51 place count 178 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 55 place count 178 transition count 272
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 178 transition count 271
Applied a total of 56 rules in 8 ms. Remains 178 /205 variables (removed 27) and now considering 271/311 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 178/205 places, 271/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 271 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 279
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 279
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 45 place count 183 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 178 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 178 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 178 transition count 269
Applied a total of 56 rules in 7 ms. Remains 178 /205 variables (removed 27) and now considering 269/311 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 178/205 places, 269/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 269 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 172 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 172 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 263
Applied a total of 68 rules in 7 ms. Remains 172 /205 variables (removed 33) and now considering 263/311 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 172/205 places, 263/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 290
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 290
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 185 transition count 289
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 179 transition count 280
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 179 transition count 280
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 54 place count 179 transition count 279
Applied a total of 54 rules in 6 ms. Remains 179 /205 variables (removed 26) and now considering 279/311 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 179/205 places, 279/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 9 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 10 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 279 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Graph (trivial) has 170 edges and 205 vertex of which 18 / 205 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 189 transition count 248
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 143 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 141 transition count 244
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 99 place count 141 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 119 place count 131 transition count 234
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 131 place count 119 transition count 212
Iterating global reduction 3 with 12 rules applied. Total rules applied 143 place count 119 transition count 212
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 145 place count 119 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 146 place count 118 transition count 210
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 146 place count 118 transition count 207
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 152 place count 115 transition count 207
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 154 place count 113 transition count 202
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 113 transition count 202
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 178 place count 102 transition count 191
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 101 transition count 181
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 101 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 101 transition count 180
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 100 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 99 transition count 178
Applied a total of 184 rules in 38 ms. Remains 99 /205 variables (removed 106) and now considering 178/311 (removed 133) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 99/205 places, 178/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 178 transitions.
RANDOM walk for 40000 steps (3979 resets) in 303 ms. (131 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1246 resets) in 152 ms. (261 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 35151 steps, run visited all 1 properties in 52 ms. (steps per millisecond=675 )
Probabilistic random walk after 35151 steps, saw 9685 distinct states, run finished after 55 ms. (steps per millisecond=639 ) properties seen :1
FORMULA FireWire-PT-16-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 173 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 173 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 173 transition count 264
Applied a total of 66 rules in 9 ms. Remains 173 /205 variables (removed 32) and now considering 264/311 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 173/205 places, 264/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 56 place count 175 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 61 place count 175 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 175 transition count 267
Applied a total of 62 rules in 8 ms. Remains 175 /205 variables (removed 30) and now considering 267/311 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 175/205 places, 267/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 174 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 174 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 64 place count 174 transition count 265
Applied a total of 64 rules in 7 ms. Remains 174 /205 variables (removed 31) and now considering 265/311 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 174/205 places, 265/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 179 transition count 275
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 179 transition count 275
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 179 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 60 place count 172 transition count 264
Iterating global reduction 1 with 7 rules applied. Total rules applied 67 place count 172 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 172 transition count 263
Applied a total of 68 rules in 7 ms. Remains 172 /205 variables (removed 33) and now considering 263/311 (removed 48) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 172/205 places, 263/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 276
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 180 transition count 275
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 58 place count 173 transition count 265
Iterating global reduction 1 with 7 rules applied. Total rules applied 65 place count 173 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 66 place count 173 transition count 264
Applied a total of 66 rules in 6 ms. Remains 173 /205 variables (removed 32) and now considering 264/311 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 173/205 places, 264/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 8 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 311/311 transitions.
Graph (trivial) has 171 edges and 205 vertex of which 18 / 205 are part of one of the 3 SCC in 1 ms
Free SCC test removed 15 places
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 189 transition count 248
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 97 place count 143 transition count 244
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 99 place count 141 transition count 244
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 99 place count 141 transition count 234
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 119 place count 131 transition count 234
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 130 place count 120 transition count 214
Iterating global reduction 3 with 11 rules applied. Total rules applied 141 place count 120 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 143 place count 120 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 144 place count 119 transition count 212
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 144 place count 119 transition count 208
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 152 place count 115 transition count 208
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 154 place count 113 transition count 203
Iterating global reduction 5 with 2 rules applied. Total rules applied 156 place count 113 transition count 203
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 178 place count 102 transition count 192
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 179 place count 101 transition count 182
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 101 transition count 182
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 181 place count 101 transition count 181
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 183 place count 100 transition count 180
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 99 transition count 179
Applied a total of 184 rules in 38 ms. Remains 99 /205 variables (removed 106) and now considering 179/311 (removed 132) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 38 ms. Remains : 99/205 places, 179/311 transitions.
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 7 ms
[2024-06-02 19:36:27] [INFO ] Flatten gal took : 6 ms
[2024-06-02 19:36:27] [INFO ] Input system was already deterministic with 179 transitions.
RANDOM walk for 40000 steps (3912 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1257 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 4000 steps, run visited all 1 properties in 8 ms. (steps per millisecond=500 )
Probabilistic random walk after 4000 steps, saw 1334 distinct states, run finished after 9 ms. (steps per millisecond=444 ) properties seen :1
FORMULA FireWire-PT-16-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:36:28] [INFO ] Flatten gal took : 28 ms
[2024-06-02 19:36:28] [INFO ] Flatten gal took : 12 ms
[2024-06-02 19:36:28] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2024-06-02 19:36:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 311 transitions and 890 arcs took 3 ms.
Total runtime 60778 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 : FireWire-PT-16-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-01
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-03
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-06
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-16-CTLFireability-2024-14

BK_STOP 1717356988493

--------------------
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 FireWire-PT-16-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/635/ctl_0_
ctl formula name FireWire-PT-16-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/635/ctl_1_
ctl formula name FireWire-PT-16-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/635/ctl_2_
ctl formula name FireWire-PT-16-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/635/ctl_3_
ctl formula name FireWire-PT-16-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/635/ctl_4_
ctl formula name FireWire-PT-16-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/635/ctl_5_
ctl formula name FireWire-PT-16-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/635/ctl_6_
ctl formula name FireWire-PT-16-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/635/ctl_7_
ctl formula name FireWire-PT-16-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/635/ctl_8_
ctl formula name FireWire-PT-16-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/635/ctl_9_
ctl formula name FireWire-PT-16-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/635/ctl_10_
ctl formula name FireWire-PT-16-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/635/ctl_11_
ctl formula name FireWire-PT-16-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/635/ctl_12_
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="FireWire-PT-16"
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 FireWire-PT-16, 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 r553-tall-171734901300290"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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