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.r468-smll-171620167400289.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 AutonomousCar-PT-05b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400289
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 159K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717211944847

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:19:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 03:19:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:19:07] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2024-06-01 03:19:07] [INFO ] Transformed 255 places.
[2024-06-01 03:19:08] [INFO ] Transformed 490 transitions.
[2024-06-01 03:19:08] [INFO ] Found NUPN structural information;
[2024-06-01 03:19:08] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 470 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 162 ms.
Support contains 109 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 241 transition count 476
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 241 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 240 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 240 transition count 475
Applied a total of 30 rules in 242 ms. Remains 240 /255 variables (removed 15) and now considering 475/490 (removed 15) transitions.
// Phase 1: matrix 475 rows 240 cols
[2024-06-01 03:19:08] [INFO ] Computed 10 invariants in 28 ms
[2024-06-01 03:19:09] [INFO ] Implicit Places using invariants in 568 ms returned []
[2024-06-01 03:19:09] [INFO ] Invariant cache hit.
[2024-06-01 03:19:10] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1364 ms to find 0 implicit places.
Running 474 sub problems to find dead transitions.
[2024-06-01 03:19:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-01 03:19:20] [INFO ] Deduced a trap composed of 19 places in 358 ms of which 49 ms to minimize.
[2024-06-01 03:19:20] [INFO ] Deduced a trap composed of 29 places in 353 ms of which 5 ms to minimize.
[2024-06-01 03:19:20] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 3 ms to minimize.
[2024-06-01 03:19:21] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 4 ms to minimize.
[2024-06-01 03:19:21] [INFO ] Deduced a trap composed of 24 places in 222 ms of which 3 ms to minimize.
[2024-06-01 03:19:21] [INFO ] Deduced a trap composed of 27 places in 245 ms of which 5 ms to minimize.
[2024-06-01 03:19:22] [INFO ] Deduced a trap composed of 43 places in 262 ms of which 4 ms to minimize.
[2024-06-01 03:19:22] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 3 ms to minimize.
[2024-06-01 03:19:22] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 2 ms to minimize.
[2024-06-01 03:19:22] [INFO ] Deduced a trap composed of 37 places in 227 ms of which 3 ms to minimize.
[2024-06-01 03:19:23] [INFO ] Deduced a trap composed of 41 places in 219 ms of which 2 ms to minimize.
[2024-06-01 03:19:23] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:19:23] [INFO ] Deduced a trap composed of 44 places in 249 ms of which 3 ms to minimize.
[2024-06-01 03:19:23] [INFO ] Deduced a trap composed of 44 places in 293 ms of which 3 ms to minimize.
[2024-06-01 03:19:24] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 2 ms to minimize.
[2024-06-01 03:19:24] [INFO ] Deduced a trap composed of 33 places in 213 ms of which 5 ms to minimize.
[2024-06-01 03:19:24] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 4 ms to minimize.
[2024-06-01 03:19:25] [INFO ] Deduced a trap composed of 35 places in 241 ms of which 4 ms to minimize.
[2024-06-01 03:19:25] [INFO ] Deduced a trap composed of 36 places in 226 ms of which 3 ms to minimize.
[2024-06-01 03:19:25] [INFO ] Deduced a trap composed of 35 places in 192 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-01 03:19:26] [INFO ] Deduced a trap composed of 24 places in 291 ms of which 4 ms to minimize.
[2024-06-01 03:19:26] [INFO ] Deduced a trap composed of 21 places in 199 ms of which 4 ms to minimize.
[2024-06-01 03:19:26] [INFO ] Deduced a trap composed of 30 places in 281 ms of which 4 ms to minimize.
[2024-06-01 03:19:27] [INFO ] Deduced a trap composed of 43 places in 286 ms of which 3 ms to minimize.
[2024-06-01 03:19:27] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 4 ms to minimize.
[2024-06-01 03:19:27] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 4 ms to minimize.
[2024-06-01 03:19:28] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 4 ms to minimize.
[2024-06-01 03:19:28] [INFO ] Deduced a trap composed of 41 places in 209 ms of which 3 ms to minimize.
[2024-06-01 03:19:29] [INFO ] Deduced a trap composed of 41 places in 212 ms of which 4 ms to minimize.
[2024-06-01 03:19:29] [INFO ] Deduced a trap composed of 44 places in 168 ms of which 3 ms to minimize.
[2024-06-01 03:19:30] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 2 ms to minimize.
[2024-06-01 03:19:30] [INFO ] Deduced a trap composed of 42 places in 132 ms of which 4 ms to minimize.
[2024-06-01 03:19:30] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 3 ms to minimize.
[2024-06-01 03:19:30] [INFO ] Deduced a trap composed of 41 places in 130 ms of which 3 ms to minimize.
[2024-06-01 03:19:30] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 6 ms to minimize.
[2024-06-01 03:19:31] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 3 ms to minimize.
[2024-06-01 03:19:31] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2024-06-01 03:19:31] [INFO ] Deduced a trap composed of 46 places in 141 ms of which 3 ms to minimize.
[2024-06-01 03:19:31] [INFO ] Deduced a trap composed of 44 places in 130 ms of which 3 ms to minimize.
[2024-06-01 03:19:32] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-01 03:19:38] [INFO ] Deduced a trap composed of 27 places in 298 ms of which 4 ms to minimize.
[2024-06-01 03:19:38] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 3 ms to minimize.
[2024-06-01 03:19:38] [INFO ] Deduced a trap composed of 20 places in 274 ms of which 4 ms to minimize.
[2024-06-01 03:19:39] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 3 ms to minimize.
[2024-06-01 03:19:39] [INFO ] Deduced a trap composed of 24 places in 261 ms of which 3 ms to minimize.
[2024-06-01 03:19:39] [INFO ] Deduced a trap composed of 22 places in 250 ms of which 3 ms to minimize.
[2024-06-01 03:19:40] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 3 ms to minimize.
[2024-06-01 03:19:40] [INFO ] Deduced a trap composed of 12 places in 225 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 1.0)
(s95 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/715 variables, and 58 constraints, problems are : Problem set: 0 solved, 474 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/240 constraints, PredecessorRefiner: 474/474 constraints, Known Traps: 48/48 constraints]
Escalating to Integer solving :Problem set: 0 solved, 474 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 48/58 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-01 03:19:47] [INFO ] Deduced a trap composed of 61 places in 278 ms of which 7 ms to minimize.
[2024-06-01 03:19:48] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 4 ms to minimize.
[2024-06-01 03:19:48] [INFO ] Deduced a trap composed of 40 places in 261 ms of which 5 ms to minimize.
[2024-06-01 03:19:49] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 3 ms to minimize.
[2024-06-01 03:19:49] [INFO ] Deduced a trap composed of 34 places in 281 ms of which 4 ms to minimize.
[2024-06-01 03:19:50] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 3 ms to minimize.
[2024-06-01 03:19:50] [INFO ] Deduced a trap composed of 37 places in 258 ms of which 4 ms to minimize.
[2024-06-01 03:19:50] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 5 ms to minimize.
[2024-06-01 03:19:51] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-01 03:19:55] [INFO ] Deduced a trap composed of 46 places in 255 ms of which 4 ms to minimize.
[2024-06-01 03:19:56] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 3 ms to minimize.
[2024-06-01 03:19:56] [INFO ] Deduced a trap composed of 43 places in 118 ms of which 2 ms to minimize.
[2024-06-01 03:19:56] [INFO ] Deduced a trap composed of 33 places in 217 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 4/71 constraints. Problems are: Problem set: 0 solved, 474 unsolved
[2024-06-01 03:20:03] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 474 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 474 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD432 is UNSAT
At refinement iteration 7 (OVERLAPS) 475/715 variables, 240/312 constraints. Problems are: Problem set: 2 solved, 472 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 715/715 variables, and 784 constraints, problems are : Problem set: 2 solved, 472 unsolved in 30225 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 472/474 constraints, Known Traps: 62/62 constraints]
After SMT, in 62311ms problems are : Problem set: 2 solved, 472 unsolved
Search for dead transitions found 2 dead transitions in 62408ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 240/255 places, 473/490 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 473
Applied a total of 1 rules in 41 ms. Remains 239 /240 variables (removed 1) and now considering 473/473 (removed 0) transitions.
// Phase 1: matrix 473 rows 239 cols
[2024-06-01 03:20:12] [INFO ] Computed 10 invariants in 8 ms
[2024-06-01 03:20:12] [INFO ] Implicit Places using invariants in 179 ms returned []
[2024-06-01 03:20:12] [INFO ] Invariant cache hit.
[2024-06-01 03:20:13] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/255 places, 473/490 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64787 ms. Remains : 239/255 places, 473/490 transitions.
Support contains 109 out of 239 places after structural reductions.
[2024-06-01 03:20:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 03:20:13] [INFO ] Flatten gal took : 161 ms
FORMULA AutonomousCar-PT-05b-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 03:20:13] [INFO ] Flatten gal took : 82 ms
[2024-06-01 03:20:14] [INFO ] Input system was already deterministic with 473 transitions.
Support contains 101 out of 239 places (down from 109) after GAL structural reductions.
RANDOM walk for 40000 steps (65 resets) in 2402 ms. (16 steps per ms) remains 8/71 properties
BEST_FIRST walk for 40001 steps (35 resets) in 537 ms. (74 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40002 steps (43 resets) in 173 ms. (229 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (26 resets) in 117 ms. (338 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (47 resets) in 152 ms. (261 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (75 resets) in 73 ms. (540 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (43 resets) in 517 ms. (77 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (60 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (79 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
[2024-06-01 03:20:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 194/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 27/239 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 473/712 variables, 239/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/712 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/712 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 712/712 variables, and 249 constraints, problems are : Problem set: 0 solved, 5 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 194/212 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 03:20:16] [INFO ] Deduced a trap composed of 10 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:20:16] [INFO ] Deduced a trap composed of 14 places in 156 ms of which 3 ms to minimize.
[2024-06-01 03:20:16] [INFO ] Deduced a trap composed of 12 places in 215 ms of which 3 ms to minimize.
[2024-06-01 03:20:17] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 3 ms to minimize.
[2024-06-01 03:20:17] [INFO ] Deduced a trap composed of 23 places in 274 ms of which 3 ms to minimize.
[2024-06-01 03:20:17] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 27/239 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 473/712 variables, 239/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/712 variables, 5/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 03:20:18] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-06-01 03:20:18] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/712 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 03:20:19] [INFO ] Deduced a trap composed of 33 places in 257 ms of which 4 ms to minimize.
[2024-06-01 03:20:19] [INFO ] Deduced a trap composed of 45 places in 254 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/712 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 712/712 variables, and 264 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3713 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 4153ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4050 ms.
Support contains 18 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 473/473 transitions.
Graph (trivial) has 195 edges and 239 vertex of which 2 / 239 are part of one of the 1 SCC in 5 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 742 edges and 238 vertex of which 235 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 82 place count 235 transition count 389
Reduce places removed 80 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 103 rules applied. Total rules applied 185 place count 155 transition count 366
Reduce places removed 11 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 18 rules applied. Total rules applied 203 place count 144 transition count 359
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 210 place count 137 transition count 359
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 210 place count 137 transition count 354
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 220 place count 132 transition count 354
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 238 place count 114 transition count 336
Iterating global reduction 4 with 18 rules applied. Total rules applied 256 place count 114 transition count 336
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 102 rules applied. Total rules applied 358 place count 114 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 113 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 359 place count 113 transition count 232
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 363 place count 111 transition count 232
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 367 place count 107 transition count 216
Iterating global reduction 6 with 4 rules applied. Total rules applied 371 place count 107 transition count 216
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 6 with 66 rules applied. Total rules applied 437 place count 74 transition count 183
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 444 place count 67 transition count 143
Iterating global reduction 6 with 7 rules applied. Total rules applied 451 place count 67 transition count 143
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 452 place count 67 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 453 place count 67 transition count 141
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 459 place count 67 transition count 135
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 465 place count 61 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 467 place count 61 transition count 133
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 468 place count 61 transition count 133
Applied a total of 468 rules in 166 ms. Remains 61 /239 variables (removed 178) and now considering 133/473 (removed 340) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 61/239 places, 133/473 transitions.
RANDOM walk for 40000 steps (847 resets) in 358 ms. (111 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (401 resets) in 110 ms. (360 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (319 resets) in 141 ms. (281 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (421 resets) in 178 ms. (223 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (253 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
// Phase 1: matrix 133 rows 61 cols
[2024-06-01 03:20:24] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 03:20:24] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/58 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 133/191 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 52/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/194 variables, 3/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 122 constraints, problems are : Problem set: 0 solved, 4 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 38/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 4/58 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 133/191 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 52/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 3/194 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 2/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/194 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 126 constraints, problems are : Problem set: 0 solved, 4 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 61/61 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 542ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 842 ms.
Support contains 16 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 133/133 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 61 transition count 132
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 60 transition count 132
Applied a total of 2 rules in 10 ms. Remains 60 /61 variables (removed 1) and now considering 132/133 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 60/61 places, 132/133 transitions.
RANDOM walk for 40000 steps (265 resets) in 155 ms. (256 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (413 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (348 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (426 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (188 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1101547 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :2 out of 4
Probabilistic random walk after 1101547 steps, saw 168148 distinct states, run finished after 3016 ms. (steps per millisecond=365 ) properties seen :2
// Phase 1: matrix 132 rows 60 cols
[2024-06-01 03:20:29] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 03:20:29] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/57 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 132/189 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 52/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/192 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/192 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 34/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/57 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 132/189 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 52/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 3/192 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/192 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 60/60 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 297ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 185 ms.
Support contains 9 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 132/132 transitions.
Graph (trivial) has 28 edges and 60 vertex of which 2 / 60 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 340 edges and 59 vertex of which 58 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 58 transition count 125
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 53 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 53 transition count 124
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 52 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 52 transition count 123
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 52 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 21 place count 49 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 49 transition count 118
Applied a total of 23 rules in 48 ms. Remains 49 /60 variables (removed 11) and now considering 118/132 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 49/60 places, 118/132 transitions.
RANDOM walk for 40000 steps (1649 resets) in 248 ms. (160 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (491 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
// Phase 1: matrix 118 rows 49 cols
[2024-06-01 03:20:29] [INFO ] Computed 8 invariants in 3 ms
[2024-06-01 03:20:29] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/159 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 52/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/167 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/167 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 167/167 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/42 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 117/159 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 52/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/167 variables, 7/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/167 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/167 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 167/167 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 49/49 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 314ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 5 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 118/118 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 49 transition count 115
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 47 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 46 transition count 114
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 46 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 45 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 44 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 43 transition count 112
Applied a total of 11 rules in 21 ms. Remains 43 /49 variables (removed 6) and now considering 112/118 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 43/49 places, 112/118 transitions.
RANDOM walk for 40000 steps (1116 resets) in 120 ms. (330 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (545 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 35769 steps, run visited all 1 properties in 42 ms. (steps per millisecond=851 )
Probabilistic random walk after 35769 steps, saw 6964 distinct states, run finished after 48 ms. (steps per millisecond=745 ) properties seen :1
[2024-06-01 03:20:30] [INFO ] Flatten gal took : 67 ms
[2024-06-01 03:20:30] [INFO ] Flatten gal took : 65 ms
[2024-06-01 03:20:30] [INFO ] Input system was already deterministic with 473 transitions.
Computed a total of 45 stabilizing places and 45 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 215 transition count 449
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 215 transition count 449
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 148 place count 215 transition count 349
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 152 place count 211 transition count 345
Iterating global reduction 1 with 4 rules applied. Total rules applied 156 place count 211 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 210 transition count 344
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 210 transition count 344
Applied a total of 158 rules in 31 ms. Remains 210 /239 variables (removed 29) and now considering 344/473 (removed 129) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 210/239 places, 344/473 transitions.
[2024-06-01 03:20:30] [INFO ] Flatten gal took : 36 ms
[2024-06-01 03:20:30] [INFO ] Flatten gal took : 33 ms
[2024-06-01 03:20:30] [INFO ] Input system was already deterministic with 344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 218 transition count 452
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 218 transition count 452
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 142 place count 218 transition count 352
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 216 transition count 350
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 216 transition count 350
Applied a total of 146 rules in 21 ms. Remains 216 /239 variables (removed 23) and now considering 350/473 (removed 123) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 216/239 places, 350/473 transitions.
[2024-06-01 03:20:30] [INFO ] Flatten gal took : 31 ms
[2024-06-01 03:20:30] [INFO ] Flatten gal took : 32 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 350 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Graph (trivial) has 198 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 87 transitions
Trivial Post-agglo rules discarded 87 transitions
Performed 87 trivial Post agglomeration. Transition count delta: 87
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 236 transition count 383
Reduce places removed 87 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 109 rules applied. Total rules applied 197 place count 149 transition count 361
Reduce places removed 12 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 19 rules applied. Total rules applied 216 place count 137 transition count 354
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 11 rules applied. Total rules applied 227 place count 130 transition count 350
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 229 place count 128 transition count 350
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 229 place count 128 transition count 344
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 241 place count 122 transition count 344
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 257 place count 106 transition count 328
Iterating global reduction 5 with 16 rules applied. Total rules applied 273 place count 106 transition count 328
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Iterating post reduction 5 with 101 rules applied. Total rules applied 374 place count 106 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 374 place count 106 transition count 226
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 376 place count 105 transition count 226
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 379 place count 102 transition count 215
Iterating global reduction 6 with 3 rules applied. Total rules applied 382 place count 102 transition count 215
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 6 with 2 rules applied. Total rules applied 384 place count 102 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 385 place count 101 transition count 213
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 8 with 50 rules applied. Total rules applied 435 place count 76 transition count 188
Discarding 4 places :
Symmetric choice reduction at 8 with 4 rule applications. Total rules 439 place count 72 transition count 165
Iterating global reduction 8 with 4 rules applied. Total rules applied 443 place count 72 transition count 165
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 444 place count 72 transition count 164
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 447 place count 72 transition count 164
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 449 place count 70 transition count 162
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 450 place count 69 transition count 162
Applied a total of 450 rules in 126 ms. Remains 69 /239 variables (removed 170) and now considering 162/473 (removed 311) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 126 ms. Remains : 69/239 places, 162/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Graph (trivial) has 227 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 236 transition count 366
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 138 rules applied. Total rules applied 243 place count 132 transition count 332
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 263 place count 112 transition count 332
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 263 place count 112 transition count 327
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 273 place count 107 transition count 327
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 289 place count 91 transition count 311
Iterating global reduction 3 with 16 rules applied. Total rules applied 305 place count 91 transition count 311
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 305 place count 91 transition count 310
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 307 place count 90 transition count 310
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 311 place count 86 transition count 279
Iterating global reduction 3 with 4 rules applied. Total rules applied 315 place count 86 transition count 279
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 3 with 6 rules applied. Total rules applied 321 place count 86 transition count 273
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 324 place count 83 transition count 273
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 380 place count 55 transition count 245
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 387 place count 48 transition count 170
Iterating global reduction 5 with 7 rules applied. Total rules applied 394 place count 48 transition count 170
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 398 place count 48 transition count 166
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 400 place count 46 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 401 place count 46 transition count 165
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 403 place count 44 transition count 163
Applied a total of 403 rules in 65 ms. Remains 44 /239 variables (removed 195) and now considering 163/473 (removed 310) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 66 ms. Remains : 44/239 places, 163/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 12 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Graph (trivial) has 226 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 103 place count 236 transition count 368
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 1 with 136 rules applied. Total rules applied 239 place count 134 transition count 334
Reduce places removed 20 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 21 rules applied. Total rules applied 260 place count 114 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 261 place count 113 transition count 333
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 261 place count 113 transition count 328
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 271 place count 108 transition count 328
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 288 place count 91 transition count 311
Iterating global reduction 4 with 17 rules applied. Total rules applied 305 place count 91 transition count 311
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 405 place count 91 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 405 place count 91 transition count 209
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 409 place count 89 transition count 209
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 413 place count 85 transition count 193
Iterating global reduction 5 with 4 rules applied. Total rules applied 417 place count 85 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 423 place count 85 transition count 187
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 426 place count 82 transition count 187
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 480 place count 55 transition count 160
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 487 place count 48 transition count 120
Iterating global reduction 7 with 7 rules applied. Total rules applied 494 place count 48 transition count 120
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 498 place count 48 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 500 place count 46 transition count 116
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 501 place count 46 transition count 116
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 503 place count 44 transition count 114
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 504 place count 43 transition count 114
Applied a total of 504 rules in 46 ms. Remains 43 /239 variables (removed 196) and now considering 114/473 (removed 359) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 43/239 places, 114/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 212 transition count 446
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 212 transition count 446
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 154 place count 212 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 207 transition count 341
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 206 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 206 transition count 340
Applied a total of 166 rules in 18 ms. Remains 206 /239 variables (removed 33) and now considering 340/473 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 206/239 places, 340/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 216 transition count 450
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 216 transition count 450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 146 place count 216 transition count 350
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 213 transition count 347
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 213 transition count 347
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 212 transition count 346
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 212 transition count 346
Applied a total of 154 rules in 16 ms. Remains 212 /239 variables (removed 27) and now considering 346/473 (removed 127) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 212/239 places, 346/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 346 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 214 transition count 448
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 214 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 150 place count 214 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 155 place count 209 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 160 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 161 place count 208 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 162 place count 208 transition count 342
Applied a total of 162 rules in 17 ms. Remains 208 /239 variables (removed 31) and now considering 342/473 (removed 131) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 208/239 places, 342/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 342 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Graph (trivial) has 225 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 102 place count 236 transition count 369
Reduce places removed 101 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 133 rules applied. Total rules applied 235 place count 135 transition count 337
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 20 rules applied. Total rules applied 255 place count 116 transition count 336
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 256 place count 115 transition count 336
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 256 place count 115 transition count 329
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 270 place count 108 transition count 329
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 286 place count 92 transition count 313
Iterating global reduction 4 with 16 rules applied. Total rules applied 302 place count 92 transition count 313
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 402 place count 92 transition count 213
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 402 place count 92 transition count 212
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 404 place count 91 transition count 212
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 408 place count 87 transition count 196
Iterating global reduction 5 with 4 rules applied. Total rules applied 412 place count 87 transition count 196
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 6 rules applied. Total rules applied 418 place count 87 transition count 190
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 421 place count 84 transition count 190
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 473 place count 58 transition count 164
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 480 place count 51 transition count 124
Iterating global reduction 7 with 7 rules applied. Total rules applied 487 place count 51 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 491 place count 51 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 493 place count 49 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 494 place count 49 transition count 119
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 496 place count 47 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 497 place count 46 transition count 117
Applied a total of 497 rules in 44 ms. Remains 46 /239 variables (removed 193) and now considering 117/473 (removed 356) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 46/239 places, 117/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 10 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Graph (trivial) has 207 edges and 239 vertex of which 2 / 239 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 91 transitions
Trivial Post-agglo rules discarded 91 transitions
Performed 91 trivial Post agglomeration. Transition count delta: 91
Iterating post reduction 0 with 91 rules applied. Total rules applied 92 place count 237 transition count 380
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 117 rules applied. Total rules applied 209 place count 146 transition count 354
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 225 place count 132 transition count 352
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 227 place count 130 transition count 352
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 227 place count 130 transition count 344
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 243 place count 122 transition count 344
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 260 place count 105 transition count 327
Iterating global reduction 4 with 17 rules applied. Total rules applied 277 place count 105 transition count 327
Ensure Unique test removed 101 transitions
Reduce isomorphic transitions removed 101 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 102 rules applied. Total rules applied 379 place count 105 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 380 place count 104 transition count 225
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 380 place count 104 transition count 223
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 384 place count 102 transition count 223
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 388 place count 98 transition count 207
Iterating global reduction 6 with 4 rules applied. Total rules applied 392 place count 98 transition count 207
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 6 with 2 rules applied. Total rules applied 394 place count 98 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 395 place count 97 transition count 205
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 8 with 46 rules applied. Total rules applied 441 place count 74 transition count 182
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 447 place count 68 transition count 148
Iterating global reduction 8 with 6 rules applied. Total rules applied 453 place count 68 transition count 148
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 457 place count 68 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 459 place count 66 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 460 place count 66 transition count 143
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 10 with 1 rules applied. Total rules applied 461 place count 66 transition count 142
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 462 place count 65 transition count 142
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 464 place count 65 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 466 place count 63 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 467 place count 62 transition count 140
Applied a total of 467 rules in 51 ms. Remains 62 /239 variables (removed 177) and now considering 140/473 (removed 333) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 62/239 places, 140/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 8 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 7 ms
[2024-06-01 03:20:31] [INFO ] Input system was already deterministic with 140 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 218 transition count 452
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 218 transition count 452
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 215 transition count 449
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 215 transition count 449
Applied a total of 48 rules in 13 ms. Remains 215 /239 variables (removed 24) and now considering 449/473 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 215/239 places, 449/473 transitions.
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:20:31] [INFO ] Flatten gal took : 22 ms
[2024-06-01 03:20:32] [INFO ] Input system was already deterministic with 449 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Graph (trivial) has 183 edges and 239 vertex of which 4 / 239 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 237 transition count 395
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 92 rules applied. Total rules applied 169 place count 161 transition count 379
Reduce places removed 7 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 18 rules applied. Total rules applied 187 place count 154 transition count 368
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 13 rules applied. Total rules applied 200 place count 143 transition count 366
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 201 place count 142 transition count 366
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 201 place count 142 transition count 359
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 215 place count 135 transition count 359
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 229 place count 121 transition count 345
Iterating global reduction 5 with 14 rules applied. Total rules applied 243 place count 121 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 245 place count 121 transition count 343
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 246 place count 120 transition count 343
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 246 place count 120 transition count 342
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 248 place count 119 transition count 342
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 249 place count 118 transition count 341
Iterating global reduction 7 with 1 rules applied. Total rules applied 250 place count 118 transition count 341
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 308 place count 89 transition count 312
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 314 place count 83 transition count 248
Iterating global reduction 7 with 6 rules applied. Total rules applied 320 place count 83 transition count 248
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 326 place count 83 transition count 248
Applied a total of 326 rules in 43 ms. Remains 83 /239 variables (removed 156) and now considering 248/473 (removed 225) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 83/239 places, 248/473 transitions.
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 17 ms
[2024-06-01 03:20:32] [INFO ] Input system was already deterministic with 248 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 212 transition count 446
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 212 transition count 446
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 154 place count 212 transition count 346
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 159 place count 207 transition count 341
Iterating global reduction 1 with 5 rules applied. Total rules applied 164 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 165 place count 206 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 166 place count 206 transition count 340
Applied a total of 166 rules in 16 ms. Remains 206 /239 variables (removed 33) and now considering 340/473 (removed 133) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 206/239 places, 340/473 transitions.
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:20:32] [INFO ] Input system was already deterministic with 340 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 213 transition count 447
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 213 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 152 place count 213 transition count 347
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 208 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 207 transition count 341
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 207 transition count 341
Applied a total of 164 rules in 17 ms. Remains 207 /239 variables (removed 32) and now considering 341/473 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 207/239 places, 341/473 transitions.
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:20:32] [INFO ] Input system was already deterministic with 341 transitions.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 473/473 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 213 transition count 447
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 213 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 152 place count 213 transition count 347
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 157 place count 208 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 162 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 163 place count 207 transition count 341
Iterating global reduction 1 with 1 rules applied. Total rules applied 164 place count 207 transition count 341
Applied a total of 164 rules in 17 ms. Remains 207 /239 variables (removed 32) and now considering 341/473 (removed 132) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 207/239 places, 341/473 transitions.
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:20:32] [INFO ] Input system was already deterministic with 341 transitions.
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 19 ms
[2024-06-01 03:20:32] [INFO ] Flatten gal took : 21 ms
[2024-06-01 03:20:32] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 5 ms.
[2024-06-01 03:20:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 239 places, 473 transitions and 2491 arcs took 6 ms.
Total runtime 85051 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 : AutonomousCar-PT-05b-CTLCardinality-2024-00
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-01
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-02
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-03
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-04
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-05
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-06
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-08
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-09
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-10
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2024-11
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2023-12
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2023-13
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2023-14
Could not compute solution for formula : AutonomousCar-PT-05b-CTLCardinality-2023-15

BK_STOP 1717212033179

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/767/ctl_0_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/767/ctl_1_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/767/ctl_2_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/767/ctl_3_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/767/ctl_4_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/767/ctl_5_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/767/ctl_6_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/767/ctl_7_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/767/ctl_8_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/767/ctl_9_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/767/ctl_10_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/767/ctl_11_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/767/ctl_12_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/767/ctl_13_
ctl formula name AutonomousCar-PT-05b-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/767/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-05b"
export BK_EXAMINATION="CTLCardinality"
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 AutonomousCar-PT-05b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167400289"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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