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.r528-tall-171683761400586.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 ShieldPPPt-PT-004B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761400586
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 23 07:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 14:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 11 14:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 74K May 18 16:43 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 ShieldPPPt-PT-004B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPt-PT-004B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717255624189

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-004B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 15:27:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 15:27:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 15:27:05] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2024-06-01 15:27:05] [INFO ] Transformed 315 places.
[2024-06-01 15:27:05] [INFO ] Transformed 287 transitions.
[2024-06-01 15:27:05] [INFO ] Found NUPN structural information;
[2024-06-01 15:27:05] [INFO ] Parsed PT model containing 315 places and 287 transitions and 718 arcs in 171 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 137 out of 315 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 315/315 places, 287/287 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 294 transition count 266
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 294 transition count 266
Applied a total of 42 rules in 43 ms. Remains 294 /315 variables (removed 21) and now considering 266/287 (removed 21) transitions.
// Phase 1: matrix 266 rows 294 cols
[2024-06-01 15:27:05] [INFO ] Computed 45 invariants in 20 ms
[2024-06-01 15:27:05] [INFO ] Implicit Places using invariants in 326 ms returned []
[2024-06-01 15:27:05] [INFO ] Invariant cache hit.
[2024-06-01 15:27:06] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2024-06-01 15:27:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:09] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 30 ms to minimize.
[2024-06-01 15:27:09] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:27:09] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 11 ms to minimize.
[2024-06-01 15:27:09] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-06-01 15:27:09] [INFO ] Deduced a trap composed of 21 places in 155 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 24 places in 50 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 23 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 0 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 18 places in 22 ms of which 0 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 21 places in 20 ms of which 0 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 17 places in 19 ms of which 3 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:27:10] [INFO ] Deduced a trap composed of 22 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 2 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:27:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 22 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 22 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:27:12] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/85 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:27:14] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:27:14] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:27:14] [INFO ] Deduced a trap composed of 22 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:27:14] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:27:15] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 6/91 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:16] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2024-06-01 15:27:16] [INFO ] Deduced a trap composed of 27 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:27:16] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (OVERLAPS) 266/560 variables, 294/388 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:20] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:27:20] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2024-06-01 15:27:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 3/391 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:22] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:27:23] [INFO ] Deduced a trap composed of 23 places in 29 ms of which 1 ms to minimize.
[2024-06-01 15:27:23] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:27:23] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/560 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:28] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:27:29] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/560 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:35] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 0 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/560 variables, 1/398 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 560/560 variables, and 398 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 59/59 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/294 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 59/104 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:38] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:39] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2024-06-01 15:27:39] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-01 15:27:40] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 15:27:40] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 2 ms to minimize.
[2024-06-01 15:27:40] [INFO ] Deduced a trap composed of 22 places in 47 ms of which 1 ms to minimize.
[2024-06-01 15:27:40] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-06-01 15:27:40] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 7/112 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:42] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:45] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 2 ms to minimize.
[2024-06-01 15:27:45] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:27:46] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:27:50] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 265 unsolved
[2024-06-01 15:27:53] [INFO ] Deduced a trap composed of 21 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 10 (OVERLAPS) 266/560 variables, 294/413 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 265/678 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 560/560 variables, and 678 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 74/74 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60144ms
Starting structural reductions in LTL mode, iteration 1 : 294/315 places, 266/287 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60843 ms. Remains : 294/315 places, 266/287 transitions.
Support contains 137 out of 294 places after structural reductions.
[2024-06-01 15:28:06] [INFO ] Flatten gal took : 50 ms
[2024-06-01 15:28:06] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:28:06] [INFO ] Input system was already deterministic with 266 transitions.
RANDOM walk for 40000 steps (8 resets) in 1833 ms. (21 steps per ms) remains 3/94 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
[2024-06-01 15:28:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/134 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 18 places in 322 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 160/294 variables, 29/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 266/560 variables, 294/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/560 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/560 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 560/560 variables, and 345 constraints, problems are : Problem set: 0 solved, 2 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/134 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 160/294 variables, 29/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 22 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
[2024-06-01 15:28:08] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 1 ms to minimize.
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 266/560 variables, 294/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/560 variables, 2/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/560 variables, 2/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/560 variables, 2/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:09] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/560 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 560/560 variables, and 358 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1092 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, State Equation: 294/294 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 17/17 constraints]
After SMT, in 2054ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 174 ms.
Support contains 10 out of 294 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 294/294 places, 266/266 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 294 transition count 213
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 241 transition count 211
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 112 place count 240 transition count 208
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 115 place count 237 transition count 208
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 22 Pre rules applied. Total rules applied 115 place count 237 transition count 186
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 159 place count 215 transition count 186
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 173 place count 201 transition count 172
Iterating global reduction 4 with 14 rules applied. Total rules applied 187 place count 201 transition count 172
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 187 place count 201 transition count 163
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 205 place count 192 transition count 163
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 333 place count 128 transition count 99
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 351 place count 119 transition count 99
Partial Free-agglomeration rule applied 11 times.
Drop transitions (Partial Free agglomeration) removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 362 place count 119 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 363 place count 118 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 364 place count 117 transition count 98
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 364 place count 117 transition count 96
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 368 place count 115 transition count 96
Applied a total of 368 rules in 71 ms. Remains 115 /294 variables (removed 179) and now considering 96/266 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 115/294 places, 96/266 transitions.
RANDOM walk for 40000 steps (8 resets) in 597 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 615186 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 2
Probabilistic random walk after 615186 steps, saw 384065 distinct states, run finished after 3005 ms. (steps per millisecond=204 ) properties seen :0
// Phase 1: matrix 96 rows 115 cols
[2024-06-01 15:28:13] [INFO ] Computed 44 invariants in 1 ms
[2024-06-01 15:28:13] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/74 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 78/152 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 12/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 40/192 variables, 28/141 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/193 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/193 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/195 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/195 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 14/209 variables, 10/168 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/209 variables, 3/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/209 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/209 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 1/210 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/210 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/210 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 1/211 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/211 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/211 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 0/211 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 211/211 variables, and 176 constraints, problems are : Problem set: 0 solved, 2 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 115/115 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 21/74 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 78/152 variables, 74/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 40/192 variables, 28/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 12/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/192 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:13] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/192 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/193 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/193 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/193 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 2/195 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/195 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 14/209 variables, 10/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/209 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/209 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/209 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (OVERLAPS) 1/210 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/210 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/210 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 1/211 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/211 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/211 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:14] [INFO ] Deduced a trap composed of 8 places in 29 ms of which 1 ms to minimize.
At refinement iteration 34 (OVERLAPS) 0/211 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/211 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (OVERLAPS) 0/211 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 211/211 variables, and 186 constraints, problems are : Problem set: 0 solved, 2 unsolved in 636 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, State Equation: 115/115 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 10/10 constraints]
After SMT, in 966ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 10 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 115 /115 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 115/115 places, 96/96 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 115 /115 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2024-06-01 15:28:14] [INFO ] Invariant cache hit.
[2024-06-01 15:28:14] [INFO ] Implicit Places using invariants in 88 ms returned [94, 98]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 99 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 113/115 places, 96/96 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 111 transition count 94
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 111 transition count 94
Applied a total of 4 rules in 5 ms. Remains 111 /113 variables (removed 2) and now considering 94/96 (removed 2) transitions.
// Phase 1: matrix 94 rows 111 cols
[2024-06-01 15:28:14] [INFO ] Computed 42 invariants in 0 ms
[2024-06-01 15:28:14] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-01 15:28:14] [INFO ] Invariant cache hit.
[2024-06-01 15:28:14] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 15:28:14] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 111/115 places, 94/96 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 312 ms. Remains : 111/115 places, 94/96 transitions.
RANDOM walk for 40000 steps (8 resets) in 198 ms. (201 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 544996 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :0 out of 2
Probabilistic random walk after 544996 steps, saw 342547 distinct states, run finished after 3001 ms. (steps per millisecond=181 ) properties seen :0
[2024-06-01 15:28:17] [INFO ] Invariant cache hit.
[2024-06-01 15:28:17] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/74 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:17] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 77/151 variables, 74/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 11/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 38/189 variables, 26/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/189 variables, 11/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/189 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/189 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/190 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/190 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/192 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/192 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 13/205 variables, 10/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/205 variables, 4/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/205 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/205 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 167 constraints, problems are : Problem set: 0 solved, 2 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/53 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:17] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 21/74 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 77/151 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 11/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/151 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/151 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 38/189 variables, 26/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/189 variables, 11/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/189 variables, 2/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/189 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/189 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 7 places in 29 ms of which 0 ms to minimize.
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/189 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/189 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/190 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/190 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/190 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/190 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 2/192 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/192 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/192 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 13/205 variables, 10/174 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/205 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/205 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 15:28:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 29 (OVERLAPS) 0/205 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/205 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (OVERLAPS) 0/205 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 603 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 774ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 120 ms.
Support contains 10 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 94/94 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 111/111 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 94/94 transitions.
Applied a total of 0 rules in 4 ms. Remains 111 /111 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2024-06-01 15:28:18] [INFO ] Invariant cache hit.
[2024-06-01 15:28:18] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-06-01 15:28:18] [INFO ] Invariant cache hit.
[2024-06-01 15:28:19] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 15:28:19] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
[2024-06-01 15:28:19] [INFO ] Redundant transitions in 2 ms returned []
Running 88 sub problems to find dead transitions.
[2024-06-01 15:28:19] [INFO ] Invariant cache hit.
[2024-06-01 15:28:19] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 15:28:19] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 1 ms to minimize.
[2024-06-01 15:28:19] [INFO ] Deduced a trap composed of 6 places in 15 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 5/111 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 0 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 1 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 0 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 0 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 6 places in 19 ms of which 1 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 0 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 10 places in 23 ms of which 1 ms to minimize.
[2024-06-01 15:28:20] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 94/205 variables, 111/170 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 13/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/205 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 205/205 variables, and 183 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3245 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 8/26 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (OVERLAPS) 5/111 variables, 24/50 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 9/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 94/205 variables, 111/170 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 13/183 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 88/271 constraints. Problems are: Problem set: 0 solved, 88 unsolved
[2024-06-01 15:28:23] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/205 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (OVERLAPS) 0/205 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 205/205 variables, and 272 constraints, problems are : Problem set: 0 solved, 88 unsolved in 3080 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, State Equation: 111/111 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 18/18 constraints]
After SMT, in 6339ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 6340ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6800 ms. Remains : 111/111 places, 94/94 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 18 times.
Drop transitions (Partial Free agglomeration) removed 18 transitions
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 111 transition count 94
Applied a total of 18 rules in 13 ms. Remains 111 /111 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 111 cols
[2024-06-01 15:28:25] [INFO ] Computed 42 invariants in 1 ms
[2024-06-01 15:28:25] [INFO ] [Real]Absence check using 42 positive place invariants in 5 ms returned sat
[2024-06-01 15:28:25] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 15:28:25] [INFO ] [Nat]Absence check using 42 positive place invariants in 36 ms returned sat
[2024-06-01 15:28:25] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 15:28:25] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-06-01 15:28:25] [INFO ] After 28ms SMT Verify possible using 17 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 0 ms to minimize.
[2024-06-01 15:28:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 114 ms
TRAPS : Iteration 1
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-06-01 15:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
TRAPS : Iteration 2
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 0 ms to minimize.
[2024-06-01 15:28:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-06-01 15:28:25] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-06-01 15:28:26] [INFO ] Deduced a trap composed of 7 places in 32 ms of which 1 ms to minimize.
[2024-06-01 15:28:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 84 ms
TRAPS : Iteration 3
[2024-06-01 15:28:26] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 0 ms to minimize.
[2024-06-01 15:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 4
[2024-06-01 15:28:26] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 7 ms to minimize.
[2024-06-01 15:28:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
TRAPS : Iteration 5
[2024-06-01 15:28:26] [INFO ] After 517ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 15:28:26] [INFO ] After 680ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 833 ms.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 19 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 266 transitions.
Computed a total of 71 stabilizing places and 71 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 273 transition count 245
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 273 transition count 245
Applied a total of 42 rules in 5 ms. Remains 273 /294 variables (removed 21) and now considering 245/266 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 273/294 places, 245/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 17 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 11 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 271 transition count 243
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 269 transition count 241
Applied a total of 50 rules in 32 ms. Remains 269 /294 variables (removed 25) and now considering 241/266 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 269/294 places, 241/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 16 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 15 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 277 transition count 249
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 277 transition count 249
Applied a total of 34 rules in 5 ms. Remains 277 /294 variables (removed 17) and now considering 249/266 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 277/294 places, 249/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 20 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 13 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 25 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 270/294 places, 242/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 276 transition count 248
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 276 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 275 transition count 247
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 275 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 274 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 274 transition count 246
Applied a total of 40 rules in 10 ms. Remains 274 /294 variables (removed 20) and now considering 246/266 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 274/294 places, 246/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 9 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 293 transition count 212
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 108 place count 240 transition count 210
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 239 transition count 205
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 119 place count 234 transition count 205
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 21 Pre rules applied. Total rules applied 119 place count 234 transition count 184
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 161 place count 213 transition count 184
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 177 place count 197 transition count 168
Iterating global reduction 4 with 16 rules applied. Total rules applied 193 place count 197 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 193 place count 197 transition count 158
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 213 place count 187 transition count 158
Performed 54 Post agglomeration using F-continuation condition.Transition count delta: 54
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 321 place count 133 transition count 104
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 322 place count 133 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 324 place count 131 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 325 place count 130 transition count 102
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 325 place count 130 transition count 100
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 329 place count 128 transition count 100
Applied a total of 329 rules in 66 ms. Remains 128 /294 variables (removed 166) and now considering 100/266 (removed 166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 128/294 places, 100/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 14 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 9 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 270/294 places, 242/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 10 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 270/294 places, 242/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 10 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 270/294 places, 242/266 transitions.
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:26] [INFO ] Flatten gal took : 12 ms
[2024-06-01 15:28:26] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 293 transition count 206
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 234 transition count 204
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 233 transition count 204
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 121 place count 233 transition count 179
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 171 place count 208 transition count 179
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 189 place count 190 transition count 161
Iterating global reduction 3 with 18 rules applied. Total rules applied 207 place count 190 transition count 161
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 207 place count 190 transition count 148
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 233 place count 177 transition count 148
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 3 with 114 rules applied. Total rules applied 347 place count 120 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 349 place count 118 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 350 place count 117 transition count 89
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 350 place count 117 transition count 87
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 354 place count 115 transition count 87
Applied a total of 354 rules in 44 ms. Remains 115 /294 variables (removed 179) and now considering 87/266 (removed 179) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 115/294 places, 87/266 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 4 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Input system was already deterministic with 87 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 271 transition count 243
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 269 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 269 transition count 241
Applied a total of 50 rules in 10 ms. Remains 269 /294 variables (removed 25) and now considering 241/266 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 269/294 places, 241/266 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:28:27] [INFO ] Input system was already deterministic with 241 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 272 transition count 244
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 270 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 270 transition count 242
Applied a total of 48 rules in 19 ms. Remains 270 /294 variables (removed 24) and now considering 242/266 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 270/294 places, 242/266 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 277 transition count 249
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 277 transition count 249
Applied a total of 34 rules in 5 ms. Remains 277 /294 variables (removed 17) and now considering 249/266 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 277/294 places, 249/266 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 8 ms
[2024-06-01 15:28:27] [INFO ] Input system was already deterministic with 249 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 273 transition count 245
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 273 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 272 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 272 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 271 transition count 243
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 271 transition count 243
Applied a total of 46 rules in 9 ms. Remains 271 /294 variables (removed 23) and now considering 243/266 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 271/294 places, 243/266 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 274 transition count 246
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 274 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 273 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 273 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 272 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 272 transition count 244
Applied a total of 44 rules in 8 ms. Remains 272 /294 variables (removed 22) and now considering 244/266 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 272/294 places, 244/266 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 10 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Input system was already deterministic with 244 transitions.
Starting structural reductions in LTL mode, iteration 0 : 294/294 places, 266/266 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 274 transition count 246
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 274 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 273 transition count 245
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 273 transition count 245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 272 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 272 transition count 244
Applied a total of 44 rules in 19 ms. Remains 272 /294 variables (removed 22) and now considering 244/266 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 272/294 places, 244/266 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 6 ms
[2024-06-01 15:28:27] [INFO ] Input system was already deterministic with 244 transitions.
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Flatten gal took : 7 ms
[2024-06-01 15:28:27] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 15:28:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 294 places, 266 transitions and 676 arcs took 4 ms.
Total runtime 82131 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 : ShieldPPPt-PT-004B-CTLFireability-2024-00
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-01
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-02
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-03
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-04
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-05
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-06
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-07
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-08
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-09
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-10
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2024-11
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2023-12
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2023-13
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2023-14
Could not compute solution for formula : ShieldPPPt-PT-004B-CTLFireability-2023-15

BK_STOP 1717255707778

--------------------
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 ShieldPPPt-PT-004B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1033/ctl_0_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1033/ctl_1_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1033/ctl_2_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1033/ctl_3_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1033/ctl_4_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1033/ctl_5_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1033/ctl_6_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1033/ctl_7_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1033/ctl_8_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1033/ctl_9_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1033/ctl_10_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1033/ctl_11_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1033/ctl_12_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1033/ctl_13_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1033/ctl_14_
ctl formula name ShieldPPPt-PT-004B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1033/ctl_15_
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="ShieldPPPt-PT-004B"
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 ShieldPPPt-PT-004B, 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 r528-tall-171683761400586"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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