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.r480-tall-171624189800690.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 DES-PT-20b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189800690
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 144K Apr 12 08:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 08:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 08:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 91K May 18 16:42 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 DES-PT-20b-CTLFireability-2024-00
FORMULA_NAME DES-PT-20b-CTLFireability-2024-01
FORMULA_NAME DES-PT-20b-CTLFireability-2024-02
FORMULA_NAME DES-PT-20b-CTLFireability-2024-03
FORMULA_NAME DES-PT-20b-CTLFireability-2024-04
FORMULA_NAME DES-PT-20b-CTLFireability-2024-05
FORMULA_NAME DES-PT-20b-CTLFireability-2024-06
FORMULA_NAME DES-PT-20b-CTLFireability-2024-07
FORMULA_NAME DES-PT-20b-CTLFireability-2024-08
FORMULA_NAME DES-PT-20b-CTLFireability-2024-09
FORMULA_NAME DES-PT-20b-CTLFireability-2024-10
FORMULA_NAME DES-PT-20b-CTLFireability-2024-11
FORMULA_NAME DES-PT-20b-CTLFireability-2023-12
FORMULA_NAME DES-PT-20b-CTLFireability-2023-13
FORMULA_NAME DES-PT-20b-CTLFireability-2023-14
FORMULA_NAME DES-PT-20b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717193885927

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:18:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:18:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:18:07] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-05-31 22:18:07] [INFO ] Transformed 360 places.
[2024-05-31 22:18:07] [INFO ] Transformed 311 transitions.
[2024-05-31 22:18:07] [INFO ] Found NUPN structural information;
[2024-05-31 22:18:07] [INFO ] Parsed PT model containing 360 places and 311 transitions and 987 arcs in 219 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 115 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 311/311 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 357 transition count 311
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 337 transition count 291
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 337 transition count 291
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 55 place count 325 transition count 279
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 325 transition count 279
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 76 place count 325 transition count 270
Applied a total of 76 rules in 79 ms. Remains 325 /360 variables (removed 35) and now considering 270/311 (removed 41) transitions.
// Phase 1: matrix 270 rows 325 cols
[2024-05-31 22:18:07] [INFO ] Computed 62 invariants in 39 ms
[2024-05-31 22:18:08] [INFO ] Implicit Places using invariants in 419 ms returned []
[2024-05-31 22:18:08] [INFO ] Invariant cache hit.
[2024-05-31 22:18:08] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 745 ms to find 0 implicit places.
Running 269 sub problems to find dead transitions.
[2024-05-31 22:18:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (OVERLAPS) 1/325 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 269 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 5 (OVERLAPS) 270/595 variables, 325/387 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:13] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 32 ms to minimize.
[2024-05-31 22:18:13] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 3 ms to minimize.
[2024-05-31 22:18:13] [INFO ] Deduced a trap composed of 32 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:18:14] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 2 ms to minimize.
[2024-05-31 22:18:14] [INFO ] Deduced a trap composed of 24 places in 76 ms of which 1 ms to minimize.
[2024-05-31 22:18:14] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 2 ms to minimize.
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 2 ms to minimize.
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 57 places in 87 ms of which 2 ms to minimize.
[2024-05-31 22:18:16] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 9/396 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:19] [INFO ] Deduced a trap composed of 32 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:20] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2024-05-31 22:18:21] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:18:22] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 0 ms to minimize.
[2024-05-31 22:18:22] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-31 22:18:22] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-31 22:18:22] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:18:22] [INFO ] Deduced a trap composed of 41 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:18:22] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2024-05-31 22:18:23] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 9/406 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-31 22:18:27] [INFO ] Deduced a trap composed of 23 places in 75 ms of which 1 ms to minimize.
[2024-05-31 22:18:28] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/595 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:30] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:18:30] [INFO ] Deduced a trap composed of 18 places in 46 ms of which 0 ms to minimize.
[2024-05-31 22:18:30] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:31] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:18:31] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:18:31] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:18:31] [INFO ] Deduced a trap composed of 22 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:18:31] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 3 ms to minimize.
[2024-05-31 22:18:31] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
[2024-05-31 22:18:31] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:18:32] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/595 variables, 11/425 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:35] [INFO ] Deduced a trap composed of 31 places in 68 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 1 ms to minimize.
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-05-31 22:18:38] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 595/595 variables, and 429 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 269 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/324 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/324 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 2 (OVERLAPS) 1/325 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/325 variables, 42/104 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:40] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:18:40] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:18:40] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2024-05-31 22:18:41] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:18:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:18:41] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-31 22:18:41] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2024-05-31 22:18:41] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-31 22:18:42] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 9/113 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:44] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:18:44] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:44] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:18:45] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
[2024-05-31 22:18:45] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
[2024-05-31 22:18:46] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:48] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/325 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 11 (OVERLAPS) 270/595 variables, 325/447 constraints. Problems are: Problem set: 0 solved, 269 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/595 variables, 269/716 constraints. Problems are: Problem set: 0 solved, 269 unsolved
[2024-05-31 22:18:59] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 717 constraints, problems are : Problem set: 0 solved, 269 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 269/269 constraints, Known Traps: 61/61 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 269 unsolved
Search for dead transitions found 0 dead transitions in 60171ms
Starting structural reductions in LTL mode, iteration 1 : 325/360 places, 270/311 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61016 ms. Remains : 325/360 places, 270/311 transitions.
Support contains 115 out of 325 places after structural reductions.
[2024-05-31 22:19:08] [INFO ] Flatten gal took : 50 ms
[2024-05-31 22:19:08] [INFO ] Flatten gal took : 20 ms
[2024-05-31 22:19:08] [INFO ] Input system was already deterministic with 270 transitions.
Support contains 109 out of 325 places (down from 115) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 65 to 64
RANDOM walk for 40000 steps (338 resets) in 1853 ms. (21 steps per ms) remains 13/64 properties
BEST_FIRST walk for 40004 steps (44 resets) in 260 ms. (153 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 216 ms. (184 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (51 resets) in 86 ms. (459 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (49 resets) in 121 ms. (327 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 98 ms. (404 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (51 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (60 resets) in 95 ms. (416 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 97 ms. (408 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (48 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (54 resets) in 116 ms. (341 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (57 resets) in 110 ms. (360 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (58 resets) in 288 ms. (138 steps per ms) remains 12/12 properties
[2024-05-31 22:19:10] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 71/100 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 86/186 variables, 16/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 118/304 variables, 27/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/304 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 6/310 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp56 is UNSAT
At refinement iteration 9 (OVERLAPS) 257/567 variables, 310/372 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-31 22:19:10] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:19:10] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/374 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-31 22:19:10] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/375 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/375 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 18/585 variables, 10/385 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/585 variables, 0/385 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 6/591 variables, 3/388 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-31 22:19:11] [INFO ] Deduced a trap composed of 14 places in 73 ms of which 3 ms to minimize.
[2024-05-31 22:19:11] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/591 variables, 2/390 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/591 variables, 0/390 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 2/593 variables, 1/391 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/593 variables, 0/391 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 20 (OVERLAPS) 2/595 variables, 1/392 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/595 variables, 0/392 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/595 variables, 0/392 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 392 constraints, problems are : Problem set: 2 solved, 10 unsolved in 2688 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 325/325 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 68/92 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 90/182 variables, 18/33 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/33 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 121/303 variables, 27/60 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/60 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 6/309 variables, 2/62 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/309 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 257/566 variables, 309/371 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/566 variables, 10/381 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-31 22:19:13] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:13] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-05-31 22:19:13] [INFO ] Deduced a trap composed of 14 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:19:13] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/566 variables, 4/385 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/566 variables, 0/385 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 19/585 variables, 11/396 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/585 variables, 5/401 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-31 22:19:15] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/585 variables, 1/402 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-31 22:19:15] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/585 variables, 1/403 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/585 variables, 0/403 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 6/591 variables, 3/406 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/591 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 10 unsolved
SMT process timed out in 7709ms, After SMT, problems are : Problem set: 2 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 24 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 323 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 323 transition count 250
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 307 transition count 250
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 307 transition count 240
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 297 transition count 240
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 61 place count 291 transition count 234
Iterating global reduction 2 with 6 rules applied. Total rules applied 67 place count 291 transition count 234
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 70 place count 291 transition count 231
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 290 transition count 230
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 288 transition count 228
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 288 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 288 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 288 transition count 225
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 80 place count 287 transition count 225
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 208 place count 223 transition count 161
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 212 place count 221 transition count 163
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 213 place count 221 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 214 place count 220 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 215 place count 219 transition count 161
Applied a total of 215 rules in 91 ms. Remains 219 /325 variables (removed 106) and now considering 161/270 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 219/325 places, 161/270 transitions.
RANDOM walk for 40000 steps (949 resets) in 520 ms. (76 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (201 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (165 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (181 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (183 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (175 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (184 resets) in 112 ms. (354 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (175 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (169 resets) in 103 ms. (384 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (192 resets) in 111 ms. (357 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (170 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 887817 steps, run timeout after 3001 ms. (steps per millisecond=295 ) properties seen :0 out of 10
Probabilistic random walk after 887817 steps, saw 116439 distinct states, run finished after 3004 ms. (steps per millisecond=295 ) properties seen :0
// Phase 1: matrix 161 rows 219 cols
[2024-05-31 22:19:21] [INFO ] Computed 64 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 38/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 57/119 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 100/219 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 161/380 variables, 219/283 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 283 constraints, problems are : Problem set: 0 solved, 10 unsolved in 476 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 38/62 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 57/119 variables, 21/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 100/219 variables, 28/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 161/380 variables, 219/283 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 10/293 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 0 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-31 22:19:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 0 ms to minimize.
[2024-05-31 22:19:23] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 1 ms to minimize.
[2024-05-31 22:19:23] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 7/300 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:19:23] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:19:23] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 1 ms to minimize.
[2024-05-31 22:19:23] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:19:23] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-31 22:19:24] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/380 variables, 6/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-31 22:19:25] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/380 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/380 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/380 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 380/380 variables, and 307 constraints, problems are : Problem set: 0 solved, 10 unsolved in 5599 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 14/14 constraints]
After SMT, in 6091ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 12566 ms.
Support contains 24 out of 219 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 161/161 transitions.
Applied a total of 0 rules in 7 ms. Remains 219 /219 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 219/219 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 219/219 places, 161/161 transitions.
Applied a total of 0 rules in 6 ms. Remains 219 /219 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-05-31 22:19:40] [INFO ] Invariant cache hit.
[2024-05-31 22:19:40] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-31 22:19:40] [INFO ] Invariant cache hit.
[2024-05-31 22:19:40] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-05-31 22:19:40] [INFO ] Redundant transitions in 5 ms returned []
Running 157 sub problems to find dead transitions.
[2024-05-31 22:19:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 4/219 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 157 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (OVERLAPS) 161/380 variables, 219/283 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 22:19:42] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 22:19:44] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/380 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 22:19:46] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:19:47] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 0 ms to minimize.
[2024-05-31 22:19:47] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/380 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 22:19:48] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/380 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/380 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 13 (OVERLAPS) 0/380 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 157 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 289 constraints, problems are : Problem set: 0 solved, 157 unsolved in 10450 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 157 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 2 (OVERLAPS) 4/219 variables, 36/49 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/219 variables, 15/64 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/219 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 6 (OVERLAPS) 161/380 variables, 219/289 constraints. Problems are: Problem set: 0 solved, 157 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/380 variables, 157/446 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 22:19:55] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:19:55] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-31 22:19:55] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 0 ms to minimize.
[2024-05-31 22:19:55] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:19:55] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-31 22:19:56] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 1 ms to minimize.
[2024-05-31 22:19:59] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 12/458 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 22:20:08] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2024-05-31 22:20:12] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-05-31 22:20:12] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
[2024-05-31 22:20:12] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/380 variables, 4/462 constraints. Problems are: Problem set: 0 solved, 157 unsolved
[2024-05-31 22:20:20] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 463 constraints, problems are : Problem set: 0 solved, 157 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 219/219 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 23/23 constraints]
After SMT, in 40509ms problems are : Problem set: 0 solved, 157 unsolved
Search for dead transitions found 0 dead transitions in 40512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40906 ms. Remains : 219/219 places, 161/161 transitions.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 15 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 16 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 270 transitions.
Computed a total of 138 stabilizing places and 130 stable transitions
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 316 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 316 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 316 transition count 257
Applied a total of 22 rules in 13 ms. Remains 316 /325 variables (removed 9) and now considering 257/270 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 316/325 places, 257/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 13 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 14 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 317 transition count 261
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 317 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 317 transition count 260
Applied a total of 18 rules in 25 ms. Remains 317 /325 variables (removed 8) and now considering 260/270 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 317/325 places, 260/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 320 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 320 transition count 265
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 320 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 318 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 318 transition count 259
Applied a total of 18 rules in 25 ms. Remains 318 /325 variables (removed 7) and now considering 259/270 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 318/325 places, 259/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 259 transitions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 320 transition count 265
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 320 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 320 transition count 264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 318 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 318 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 318 transition count 260
Applied a total of 17 rules in 24 ms. Remains 318 /325 variables (removed 7) and now considering 260/270 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 318/325 places, 260/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 12 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 318 transition count 249
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 301 transition count 249
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 301 transition count 237
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 289 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 284 transition count 232
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 82 place count 280 transition count 223
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 222 place count 210 transition count 153
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 226 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 227 place count 207 transition count 151
Applied a total of 227 rules in 104 ms. Remains 207 /325 variables (removed 118) and now considering 151/270 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 104 ms. Remains : 207/325 places, 151/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 151 transitions.
RANDOM walk for 405 steps (14 resets) in 8 ms. (45 steps per ms) remains 0/1 properties
FORMULA DES-PT-20b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 316 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 316 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 316 transition count 257
Applied a total of 22 rules in 25 ms. Remains 316 /325 variables (removed 9) and now considering 257/270 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 316/325 places, 257/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 318 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 316 transition count 260
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 316 transition count 260
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 316 transition count 258
Applied a total of 21 rules in 16 ms. Remains 316 /325 variables (removed 9) and now considering 258/270 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 316/325 places, 258/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 262
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 314 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 314 transition count 254
Applied a total of 27 rules in 18 ms. Remains 314 /325 variables (removed 11) and now considering 254/270 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 314/325 places, 254/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 318 transition count 249
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 301 transition count 249
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 301 transition count 239
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 291 transition count 239
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 59 place count 287 transition count 235
Iterating global reduction 2 with 4 rules applied. Total rules applied 63 place count 287 transition count 235
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 66 place count 287 transition count 232
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 68 place count 286 transition count 231
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 69 place count 285 transition count 230
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 285 transition count 230
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 285 transition count 229
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 205 place count 218 transition count 162
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 216 transition count 160
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 208 place count 215 transition count 160
Applied a total of 208 rules in 48 ms. Remains 215 /325 variables (removed 110) and now considering 160/270 (removed 110) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 215/325 places, 160/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 318 transition count 249
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 301 transition count 249
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 301 transition count 237
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 289 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 284 transition count 232
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
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 82 place count 280 transition count 223
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 222 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 207 transition count 151
Applied a total of 225 rules in 48 ms. Remains 207 /325 variables (removed 118) and now considering 151/270 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 207/325 places, 151/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 318 transition count 263
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 318 transition count 263
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 318 transition count 261
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 316 transition count 259
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 316 transition count 259
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 316 transition count 257
Applied a total of 22 rules in 18 ms. Remains 316 /325 variables (removed 9) and now considering 257/270 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 316/325 places, 257/270 transitions.
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:20:21] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:20:21] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 319 transition count 249
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 301 transition count 249
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 301 transition count 238
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 59 place count 290 transition count 238
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 285 transition count 233
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 285 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 72 place count 285 transition count 230
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 284 transition count 229
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 282 transition count 227
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 282 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 282 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 282 transition count 224
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 82 place count 281 transition count 224
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 222 place count 211 transition count 154
Applied a total of 222 rules in 37 ms. Remains 211 /325 variables (removed 114) and now considering 154/270 (removed 116) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 37 ms. Remains : 211/325 places, 154/270 transitions.
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:22] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 318 transition count 251
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 303 transition count 250
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 33 place count 302 transition count 250
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 33 place count 302 transition count 242
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 49 place count 294 transition count 242
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 54 place count 289 transition count 237
Iterating global reduction 3 with 5 rules applied. Total rules applied 59 place count 289 transition count 237
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 62 place count 289 transition count 234
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 64 place count 288 transition count 233
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 66 place count 286 transition count 231
Iterating global reduction 5 with 2 rules applied. Total rules applied 68 place count 286 transition count 231
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 70 place count 286 transition count 229
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 6 with 124 rules applied. Total rules applied 194 place count 224 transition count 167
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 222 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 197 place count 221 transition count 165
Applied a total of 197 rules in 42 ms. Remains 221 /325 variables (removed 104) and now considering 165/270 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 221/325 places, 165/270 transitions.
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:22] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 318 transition count 249
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 301 transition count 249
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 35 place count 301 transition count 238
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 57 place count 290 transition count 238
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 285 transition count 233
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 285 transition count 233
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 70 place count 285 transition count 230
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 72 place count 284 transition count 229
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 74 place count 282 transition count 227
Iterating global reduction 4 with 2 rules applied. Total rules applied 76 place count 282 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 78 place count 282 transition count 225
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 78 place count 282 transition count 224
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 80 place count 281 transition count 224
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 5 with 142 rules applied. Total rules applied 222 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 207 transition count 151
Applied a total of 225 rules in 39 ms. Remains 207 /325 variables (removed 118) and now considering 151/270 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 207/325 places, 151/270 transitions.
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:20:22] [INFO ] Input system was already deterministic with 151 transitions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 317 transition count 262
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 317 transition count 262
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 317 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 314 transition count 257
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 314 transition count 257
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 314 transition count 254
Applied a total of 27 rules in 13 ms. Remains 314 /325 variables (removed 11) and now considering 254/270 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 314/325 places, 254/270 transitions.
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:20:22] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 325/325 places, 270/270 transitions.
Graph (complete) has 672 edges and 325 vertex of which 319 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 318 transition count 248
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 300 transition count 248
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 300 transition count 237
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 59 place count 289 transition count 237
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 64 place count 284 transition count 232
Iterating global reduction 2 with 5 rules applied. Total rules applied 69 place count 284 transition count 232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 2 with 3 rules applied. Total rules applied 72 place count 284 transition count 229
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 283 transition count 228
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 76 place count 281 transition count 226
Iterating global reduction 4 with 2 rules applied. Total rules applied 78 place count 281 transition count 226
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 80 place count 281 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 80 place count 281 transition count 223
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 82 place count 280 transition count 223
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 5 with 140 rules applied. Total rules applied 222 place count 210 transition count 153
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 208 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 225 place count 207 transition count 151
Applied a total of 225 rules in 36 ms. Remains 207 /325 variables (removed 118) and now considering 151/270 (removed 119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 207/325 places, 151/270 transitions.
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:20:22] [INFO ] Input system was already deterministic with 151 transitions.
RANDOM walk for 655 steps (17 resets) in 8 ms. (72 steps per ms) remains 0/1 properties
FORMULA DES-PT-20b-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:20:22] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:20:22] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 22:20:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 325 places, 270 transitions and 883 arcs took 3 ms.
Total runtime 135110 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 : DES-PT-20b-CTLFireability-2024-00
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-01
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-02
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-03
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-05
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-06
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-07
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-08
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-09
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-10
Could not compute solution for formula : DES-PT-20b-CTLFireability-2024-11
Could not compute solution for formula : DES-PT-20b-CTLFireability-2023-12
Could not compute solution for formula : DES-PT-20b-CTLFireability-2023-13
Could not compute solution for formula : DES-PT-20b-CTLFireability-2023-14

BK_STOP 1717194022703

--------------------
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 DES-PT-20b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/882/ctl_0_
ctl formula name DES-PT-20b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/882/ctl_1_
ctl formula name DES-PT-20b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/882/ctl_2_
ctl formula name DES-PT-20b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/882/ctl_3_
ctl formula name DES-PT-20b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/882/ctl_4_
ctl formula name DES-PT-20b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/882/ctl_5_
ctl formula name DES-PT-20b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/882/ctl_6_
ctl formula name DES-PT-20b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/882/ctl_7_
ctl formula name DES-PT-20b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/882/ctl_8_
ctl formula name DES-PT-20b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/882/ctl_9_
ctl formula name DES-PT-20b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/882/ctl_10_
ctl formula name DES-PT-20b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/882/ctl_11_
ctl formula name DES-PT-20b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/882/ctl_12_
ctl formula name DES-PT-20b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/882/ctl_13_
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="DES-PT-20b"
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 DES-PT-20b, 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 r480-tall-171624189800690"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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