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.r069-tall-171620504800562.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 greatspnxred
Input is CloudDeployment-PT-3b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504800562
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 189K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 308K 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 CloudDeployment-PT-3b-CTLFireability-2024-00
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-01
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-02
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-03
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-04
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-05
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-06
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-07
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-08
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-09
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-10
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2024-11
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-3b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716465278055

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-3b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 11:54:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 11:54:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 11:54:39] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-23 11:54:39] [INFO ] Transformed 859 places.
[2024-05-23 11:54:39] [INFO ] Transformed 1152 transitions.
[2024-05-23 11:54:39] [INFO ] Found NUPN structural information;
[2024-05-23 11:54:39] [INFO ] Parsed PT model containing 859 places and 1152 transitions and 4030 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Support contains 112 out of 859 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 859/859 places, 1152/1152 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 856 transition count 1152
Discarding 187 places :
Symmetric choice reduction at 1 with 187 rule applications. Total rules 190 place count 669 transition count 965
Iterating global reduction 1 with 187 rules applied. Total rules applied 377 place count 669 transition count 965
Discarding 58 places :
Symmetric choice reduction at 1 with 58 rule applications. Total rules 435 place count 611 transition count 907
Iterating global reduction 1 with 58 rules applied. Total rules applied 493 place count 611 transition count 907
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 494 place count 611 transition count 906
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 500 place count 605 transition count 900
Iterating global reduction 2 with 6 rules applied. Total rules applied 506 place count 605 transition count 900
Applied a total of 506 rules in 189 ms. Remains 605 /859 variables (removed 254) and now considering 900/1152 (removed 252) transitions.
// Phase 1: matrix 900 rows 605 cols
[2024-05-23 11:54:39] [INFO ] Computed 10 invariants in 40 ms
[2024-05-23 11:54:40] [INFO ] Implicit Places using invariants in 354 ms returned []
[2024-05-23 11:54:40] [INFO ] Invariant cache hit.
[2024-05-23 11:54:40] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
Running 899 sub problems to find dead transitions.
[2024-05-23 11:54:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (OVERLAPS) 900/1504 variables, 604/614 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1504/1505 variables, and 614 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 604/605 constraints, PredecessorRefiner: 899/899 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 899 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/604 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/604 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 2 (OVERLAPS) 900/1504 variables, 604/614 constraints. Problems are: Problem set: 0 solved, 899 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1504 variables, 899/1513 constraints. Problems are: Problem set: 0 solved, 899 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1504/1505 variables, and 1513 constraints, problems are : Problem set: 0 solved, 899 unsolved in 30039 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 604/605 constraints, PredecessorRefiner: 899/899 constraints, Known Traps: 0/0 constraints]
After SMT, in 60876ms problems are : Problem set: 0 solved, 899 unsolved
Search for dead transitions found 0 dead transitions in 60958ms
Starting structural reductions in LTL mode, iteration 1 : 605/859 places, 900/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62023 ms. Remains : 605/859 places, 900/1152 transitions.
Support contains 112 out of 605 places after structural reductions.
[2024-05-23 11:55:41] [INFO ] Flatten gal took : 129 ms
[2024-05-23 11:55:41] [INFO ] Flatten gal took : 120 ms
[2024-05-23 11:55:42] [INFO ] Input system was already deterministic with 900 transitions.
Support contains 110 out of 605 places (down from 112) after GAL structural reductions.
RANDOM walk for 40000 steps (426 resets) in 2719 ms. (14 steps per ms) remains 41/79 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 40/40 properties
[2024-05-23 11:55:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 115/180 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 448/628 variables, 180/190 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/628 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp62 is UNSAT
At refinement iteration 6 (OVERLAPS) 350/978 variables, 152/342 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/978 variables, 0/342 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 275/1253 variables, 128/470 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1253 variables, 0/470 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 10 (OVERLAPS) 185/1438 variables, 99/569 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1438 variables, 0/569 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 12 (OVERLAPS) 55/1493 variables, 37/606 constraints. Problems are: Problem set: 3 solved, 37 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1493 variables, 0/606 constraints. Problems are: Problem set: 3 solved, 37 unsolved
Problem AtomicPropp35 is UNSAT
At refinement iteration 14 (OVERLAPS) 12/1505 variables, 9/615 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1505 variables, 0/615 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 16 (OVERLAPS) 0/1505 variables, 0/615 constraints. Problems are: Problem set: 4 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1505/1505 variables, and 615 constraints, problems are : Problem set: 4 solved, 36 unsolved in 5028 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 605/605 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 2 (OVERLAPS) 117/178 variables, 9/10 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 0/10 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 445/623 variables, 178/188 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/623 variables, 4/192 constraints. Problems are: Problem set: 4 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/623 variables, 0/192 constraints. Problems are: Problem set: 4 solved, 36 unsolved
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 7 (OVERLAPS) 351/974 variables, 152/344 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/974 variables, 30/374 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/974 variables, 0/374 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 279/1253 variables, 130/504 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1253 variables, 0/504 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 12 (OVERLAPS) 185/1438 variables, 99/603 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1438 variables, 0/603 constraints. Problems are: Problem set: 6 solved, 34 unsolved
At refinement iteration 14 (OVERLAPS) 55/1493 variables, 37/640 constraints. Problems are: Problem set: 6 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1493/1505 variables, and 640 constraints, problems are : Problem set: 6 solved, 34 unsolved in 5009 ms.
Refiners :[Generalized P Invariants (flows): 10/10 constraints, State Equation: 596/605 constraints, PredecessorRefiner: 34/40 constraints, Known Traps: 0/0 constraints]
After SMT, in 10108ms problems are : Problem set: 6 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 57 out of 605 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 536 edges and 605 vertex of which 127 / 605 are part of one of the 15 SCC in 6 ms
Free SCC test removed 112 places
Drop transitions (Empty/Sink Transition effects.) removed 142 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 143 transitions.
Graph (complete) has 1387 edges and 493 vertex of which 492 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 492 transition count 595
Reduce places removed 159 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 164 rules applied. Total rules applied 328 place count 333 transition count 590
Reduce places removed 1 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 12 rules applied. Total rules applied 340 place count 332 transition count 579
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 351 place count 321 transition count 579
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 43 Pre rules applied. Total rules applied 351 place count 321 transition count 536
Deduced a syphon composed of 43 places in 3 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 437 place count 278 transition count 536
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 447 place count 268 transition count 526
Iterating global reduction 4 with 10 rules applied. Total rules applied 457 place count 268 transition count 526
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 460 place count 268 transition count 523
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 460 place count 268 transition count 522
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 462 place count 267 transition count 522
Performed 65 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 65 places in 1 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 130 rules applied. Total rules applied 592 place count 202 transition count 455
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 593 place count 202 transition count 454
Performed 27 Post agglomeration using F-continuation condition with reduction of 12 identical transitions.
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 647 place count 175 transition count 544
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 6 with 17 rules applied. Total rules applied 664 place count 175 transition count 527
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 682 place count 175 transition count 509
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 684 place count 174 transition count 521
Free-agglomeration rule applied 13 times.
Iterating global reduction 7 with 13 rules applied. Total rules applied 697 place count 174 transition count 508
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 19 rules applied. Total rules applied 716 place count 161 transition count 502
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 719 place count 161 transition count 499
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 725 place count 161 transition count 499
Applied a total of 725 rules in 236 ms. Remains 161 /605 variables (removed 444) and now considering 499/900 (removed 401) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 161/605 places, 499/900 transitions.
RANDOM walk for 40000 steps (1032 resets) in 566 ms. (70 steps per ms) remains 18/34 properties
BEST_FIRST walk for 4003 steps (10 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 10 ms. (363 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 7 ms. (500 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
[2024-05-23 11:55:53] [INFO ] Flow matrix only has 451 transitions (discarded 48 similar events)
// Phase 1: matrix 451 rows 161 cols
[2024-05-23 11:55:53] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 11:55:53] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 122/160 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 451/611 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/612 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/612 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/612 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 612/612 variables, and 231 constraints, problems are : Problem set: 0 solved, 18 unsolved in 800 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 161/161 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 122/160 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 451/611 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/611 variables, 57/230 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/611 variables, 18/248 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/611 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/612 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/612 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/612 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 612/612 variables, and 249 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1998 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 161/161 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 2850ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 11 properties in 3218 ms.
Support contains 26 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 499/499 transitions.
Graph (trivial) has 97 edges and 161 vertex of which 26 / 161 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 145 transition count 464
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 137 transition count 464
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 17 place count 137 transition count 457
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 31 place count 130 transition count 457
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 128 transition count 452
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 128 transition count 452
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 47 place count 122 transition count 446
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 118 transition count 462
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 75 place count 118 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 54 transitions
Redundant transition composition rules discarded 54 transitions
Iterating global reduction 3 with 54 rules applied. Total rules applied 129 place count 118 transition count 388
Free-agglomeration rule applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 137 place count 118 transition count 380
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 18 rules applied. Total rules applied 155 place count 110 transition count 370
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 157 place count 110 transition count 368
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 158 place count 109 transition count 364
Iterating global reduction 4 with 1 rules applied. Total rules applied 159 place count 109 transition count 364
Applied a total of 159 rules in 62 ms. Remains 109 /161 variables (removed 52) and now considering 364/499 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 109/161 places, 364/499 transitions.
RANDOM walk for 40000 steps (807 resets) in 290 ms. (137 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (108 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (100 resets) in 43 ms. (909 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (71 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (97 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (105 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (96 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (67 resets) in 30 ms. (1290 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 1027544 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 7
Probabilistic random walk after 1027544 steps, saw 132926 distinct states, run finished after 3009 ms. (steps per millisecond=341 ) properties seen :0
[2024-05-23 11:56:03] [INFO ] Flow matrix only has 302 transitions (discarded 62 similar events)
// Phase 1: matrix 302 rows 109 cols
[2024-05-23 11:56:03] [INFO ] Computed 13 invariants in 4 ms
[2024-05-23 11:56:03] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 82/108 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 302/410 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 68/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/411 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/411 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/411 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 411/411 variables, and 190 constraints, problems are : Problem set: 0 solved, 7 unsolved in 300 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 109/109 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 82/108 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 302/410 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/410 variables, 68/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/410 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/410 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/411 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/411 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 411/411 variables, and 197 constraints, problems are : Problem set: 0 solved, 7 unsolved in 703 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 109/109 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 1040ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 3 properties in 1090 ms.
Support contains 21 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 364/364 transitions.
Graph (trivial) has 41 edges and 109 vertex of which 2 / 109 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.
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 0 with 1 rules applied. Total rules applied 2 place count 108 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 107 transition count 361
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 5 place count 106 transition count 360
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 105 transition count 367
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 105 transition count 366
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 3 with 16 rules applied. Total rules applied 24 place count 105 transition count 350
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 31 place count 105 transition count 343
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 47 place count 98 transition count 334
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 49 place count 96 transition count 326
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 96 transition count 326
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 53 place count 96 transition count 324
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 63 place count 96 transition count 314
Applied a total of 63 rules in 47 ms. Remains 96 /109 variables (removed 13) and now considering 314/364 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 96/109 places, 314/364 transitions.
RANDOM walk for 40000 steps (1457 resets) in 1401 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (192 resets) in 149 ms. (266 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (207 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (199 resets) in 48 ms. (816 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (175 resets) in 39 ms. (1000 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 1085122 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 4
Probabilistic random walk after 1085122 steps, saw 165443 distinct states, run finished after 3001 ms. (steps per millisecond=361 ) properties seen :0
[2024-05-23 11:56:09] [INFO ] Flow matrix only has 241 transitions (discarded 73 similar events)
// Phase 1: matrix 241 rows 96 cols
[2024-05-23 11:56:09] [INFO ] Computed 13 invariants in 3 ms
[2024-05-23 11:56:09] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 74/95 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 241/336 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/337 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/337 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/337 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 337/337 variables, and 181 constraints, problems are : Problem set: 0 solved, 4 unsolved in 179 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 96/96 constraints, ReadFeed: 72/72 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/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 74/95 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 241/336 variables, 95/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 72/180 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 4/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/336 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/337 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/337 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/337 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 337/337 variables, and 185 constraints, problems are : Problem set: 0 solved, 4 unsolved in 371 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 96/96 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 564ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 200 ms.
Support contains 12 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 314/314 transitions.
Graph (trivial) has 45 edges and 96 vertex of which 2 / 96 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 94 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 94 transition count 309
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 92 transition count 309
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 92 transition count 308
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 89 transition count 305
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 17 place count 89 transition count 302
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 88 transition count 298
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 88 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 4 with 18 rules applied. Total rules applied 37 place count 88 transition count 280
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 44 place count 88 transition count 273
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 19 rules applied. Total rules applied 63 place count 81 transition count 261
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 5 with 18 rules applied. Total rules applied 81 place count 81 transition count 243
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 82 place count 81 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 83 place count 80 transition count 242
Applied a total of 83 rules in 43 ms. Remains 80 /96 variables (removed 16) and now considering 242/314 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 80/96 places, 242/314 transitions.
RANDOM walk for 35245 steps (1324 resets) in 126 ms. (277 steps per ms) remains 0/1 properties
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 49 ms
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 48 ms
[2024-05-23 11:56:10] [INFO ] Input system was already deterministic with 900 transitions.
Support contains 100 out of 605 places (down from 101) after GAL structural reductions.
Computed a total of 102 stabilizing places and 278 stable transitions
Graph (complete) has 1535 edges and 605 vertex of which 587 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.10 ms
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 38 place count 567 transition count 806
Iterating global reduction 1 with 37 rules applied. Total rules applied 75 place count 567 transition count 806
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 78 place count 567 transition count 803
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 82 place count 563 transition count 799
Iterating global reduction 2 with 4 rules applied. Total rules applied 86 place count 563 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 563 transition count 797
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 562 transition count 796
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 562 transition count 796
Applied a total of 90 rules in 71 ms. Remains 562 /605 variables (removed 43) and now considering 796/900 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 562/605 places, 796/900 transitions.
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 29 ms
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 29 ms
[2024-05-23 11:56:10] [INFO ] Input system was already deterministic with 796 transitions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 569 transition count 808
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 569 transition count 808
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 569 transition count 805
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 563 transition count 799
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 563 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 563 transition count 797
Applied a total of 88 rules in 74 ms. Remains 563 /605 variables (removed 42) and now considering 797/900 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 563/605 places, 797/900 transitions.
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 30 ms
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 28 ms
[2024-05-23 11:56:10] [INFO ] Input system was already deterministic with 797 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 623 edges and 605 vertex of which 218 / 605 are part of one of the 24 SCC in 1 ms
Free SCC test removed 194 places
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 1277 edges and 411 vertex of which 393 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.3 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 169 transitions
Trivial Post-agglo rules discarded 169 transitions
Performed 169 trivial Post agglomeration. Transition count delta: 169
Iterating post reduction 0 with 169 rules applied. Total rules applied 171 place count 392 transition count 444
Reduce places removed 169 places and 0 transitions.
Iterating post reduction 1 with 169 rules applied. Total rules applied 340 place count 223 transition count 444
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 340 place count 223 transition count 416
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 396 place count 195 transition count 416
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 409 place count 182 transition count 403
Iterating global reduction 2 with 13 rules applied. Total rules applied 422 place count 182 transition count 403
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 425 place count 182 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 425 place count 182 transition count 397
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 431 place count 179 transition count 397
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 533 place count 128 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 534 place count 128 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 546 place count 128 transition count 332
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 552 place count 128 transition count 326
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 558 place count 122 transition count 326
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 564 place count 119 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 118 transition count 322
Applied a total of 565 rules in 59 ms. Remains 118 /605 variables (removed 487) and now considering 322/900 (removed 578) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 118/605 places, 322/900 transitions.
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 14 ms
[2024-05-23 11:56:10] [INFO ] Flatten gal took : 14 ms
[2024-05-23 11:56:10] [INFO ] Input system was already deterministic with 322 transitions.
RANDOM walk for 32644 steps (1965 resets) in 224 ms. (145 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 35 place count 570 transition count 809
Iterating global reduction 1 with 34 rules applied. Total rules applied 69 place count 570 transition count 809
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 570 transition count 806
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 564 transition count 800
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 564 transition count 800
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 86 place count 564 transition count 798
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 87 place count 563 transition count 797
Iterating global reduction 3 with 1 rules applied. Total rules applied 88 place count 563 transition count 797
Applied a total of 88 rules in 80 ms. Remains 563 /605 variables (removed 42) and now considering 797/900 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 563/605 places, 797/900 transitions.
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 28 ms
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 50 ms
[2024-05-23 11:56:11] [INFO ] Input system was already deterministic with 797 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 618 edges and 605 vertex of which 211 / 605 are part of one of the 23 SCC in 1 ms
Free SCC test removed 188 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Graph (complete) has 1283 edges and 417 vertex of which 399 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 398 transition count 448
Reduce places removed 171 places and 0 transitions.
Iterating post reduction 1 with 171 rules applied. Total rules applied 344 place count 227 transition count 448
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 344 place count 227 transition count 420
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 400 place count 199 transition count 420
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 413 place count 186 transition count 407
Iterating global reduction 2 with 13 rules applied. Total rules applied 426 place count 186 transition count 407
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 429 place count 186 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 429 place count 186 transition count 401
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 435 place count 183 transition count 401
Performed 50 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 535 place count 133 transition count 350
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 536 place count 133 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 547 place count 133 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 553 place count 133 transition count 332
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 559 place count 127 transition count 332
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 563 place count 125 transition count 330
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 564 place count 125 transition count 330
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 124 transition count 329
Applied a total of 565 rules in 88 ms. Remains 124 /605 variables (removed 481) and now considering 329/900 (removed 571) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 88 ms. Remains : 124/605 places, 329/900 transitions.
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 10 ms
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 11 ms
[2024-05-23 11:56:11] [INFO ] Input system was already deterministic with 329 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 624 edges and 605 vertex of which 218 / 605 are part of one of the 24 SCC in 1 ms
Free SCC test removed 194 places
Ensure Unique test removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 1277 edges and 411 vertex of which 393 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 392 transition count 442
Reduce places removed 171 places and 0 transitions.
Iterating post reduction 1 with 171 rules applied. Total rules applied 344 place count 221 transition count 442
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 344 place count 221 transition count 414
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 400 place count 193 transition count 414
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 412 place count 181 transition count 402
Iterating global reduction 2 with 12 rules applied. Total rules applied 424 place count 181 transition count 402
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 426 place count 181 transition count 400
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 426 place count 181 transition count 397
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 432 place count 178 transition count 397
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 3 with 102 rules applied. Total rules applied 534 place count 127 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 535 place count 127 transition count 344
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 547 place count 127 transition count 332
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 553 place count 127 transition count 326
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 559 place count 121 transition count 326
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 565 place count 118 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 566 place count 117 transition count 322
Applied a total of 566 rules in 55 ms. Remains 117 /605 variables (removed 488) and now considering 322/900 (removed 578) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 117/605 places, 322/900 transitions.
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 13 ms
[2024-05-23 11:56:11] [INFO ] Input system was already deterministic with 322 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 622 edges and 605 vertex of which 213 / 605 are part of one of the 24 SCC in 1 ms
Free SCC test removed 189 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Graph (complete) has 1285 edges and 416 vertex of which 398 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 397 transition count 448
Reduce places removed 171 places and 0 transitions.
Iterating post reduction 1 with 171 rules applied. Total rules applied 344 place count 226 transition count 448
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 344 place count 226 transition count 419
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 402 place count 197 transition count 419
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 415 place count 184 transition count 406
Iterating global reduction 2 with 13 rules applied. Total rules applied 428 place count 184 transition count 406
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 431 place count 184 transition count 403
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 431 place count 184 transition count 400
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 437 place count 181 transition count 400
Performed 52 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 541 place count 129 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 542 place count 129 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 554 place count 129 transition count 334
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 560 place count 129 transition count 328
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 566 place count 123 transition count 328
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 572 place count 120 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 573 place count 119 transition count 324
Applied a total of 573 rules in 63 ms. Remains 119 /605 variables (removed 486) and now considering 324/900 (removed 576) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 119/605 places, 324/900 transitions.
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 13 ms
[2024-05-23 11:56:11] [INFO ] Input system was already deterministic with 324 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 614 edges and 605 vertex of which 213 / 605 are part of one of the 24 SCC in 1 ms
Free SCC test removed 189 places
Ensure Unique test removed 215 transitions
Reduce isomorphic transitions removed 215 transitions.
Graph (complete) has 1285 edges and 416 vertex of which 398 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 397 transition count 451
Reduce places removed 168 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 170 rules applied. Total rules applied 340 place count 229 transition count 449
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 342 place count 227 transition count 449
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 342 place count 227 transition count 420
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 400 place count 198 transition count 420
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 412 place count 186 transition count 408
Iterating global reduction 3 with 12 rules applied. Total rules applied 424 place count 186 transition count 408
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 427 place count 186 transition count 405
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 427 place count 186 transition count 403
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 431 place count 184 transition count 403
Performed 53 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 53 places in 0 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 4 with 106 rules applied. Total rules applied 537 place count 131 transition count 349
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 549 place count 131 transition count 337
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 555 place count 131 transition count 331
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 561 place count 125 transition count 331
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 567 place count 122 transition count 328
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 568 place count 121 transition count 327
Applied a total of 568 rules in 80 ms. Remains 121 /605 variables (removed 484) and now considering 327/900 (removed 573) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 121/605 places, 327/900 transitions.
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 12 ms
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 13 ms
[2024-05-23 11:56:11] [INFO ] Input system was already deterministic with 327 transitions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 39 place count 566 transition count 805
Iterating global reduction 1 with 38 rules applied. Total rules applied 77 place count 566 transition count 805
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 566 transition count 802
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 85 place count 561 transition count 797
Iterating global reduction 2 with 5 rules applied. Total rules applied 90 place count 561 transition count 797
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 91 place count 561 transition count 796
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 92 place count 560 transition count 795
Iterating global reduction 3 with 1 rules applied. Total rules applied 93 place count 560 transition count 795
Applied a total of 93 rules in 74 ms. Remains 560 /605 variables (removed 45) and now considering 795/900 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 74 ms. Remains : 560/605 places, 795/900 transitions.
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 24 ms
[2024-05-23 11:56:11] [INFO ] Flatten gal took : 26 ms
[2024-05-23 11:56:11] [INFO ] Input system was already deterministic with 795 transitions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 568 transition count 807
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 568 transition count 807
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 76 place count 568 transition count 804
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 80 place count 564 transition count 800
Iterating global reduction 2 with 4 rules applied. Total rules applied 84 place count 564 transition count 800
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 564 transition count 799
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 563 transition count 798
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 563 transition count 798
Applied a total of 87 rules in 71 ms. Remains 563 /605 variables (removed 42) and now considering 798/900 (removed 102) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 563/605 places, 798/900 transitions.
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 24 ms
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 39 ms
[2024-05-23 11:56:12] [INFO ] Input system was already deterministic with 798 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 622 edges and 605 vertex of which 215 / 605 are part of one of the 24 SCC in 0 ms
Free SCC test removed 191 places
Ensure Unique test removed 217 transitions
Reduce isomorphic transitions removed 217 transitions.
Graph (complete) has 1281 edges and 414 vertex of which 396 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 395 transition count 447
Reduce places removed 170 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 171 rules applied. Total rules applied 343 place count 225 transition count 446
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 344 place count 224 transition count 446
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 344 place count 224 transition count 418
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 400 place count 196 transition count 418
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 413 place count 183 transition count 405
Iterating global reduction 3 with 13 rules applied. Total rules applied 426 place count 183 transition count 405
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 429 place count 183 transition count 402
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 429 place count 183 transition count 399
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 435 place count 180 transition count 399
Performed 51 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 4 with 102 rules applied. Total rules applied 537 place count 129 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 538 place count 129 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 550 place count 129 transition count 334
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 6 rules applied. Total rules applied 556 place count 129 transition count 328
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 562 place count 123 transition count 328
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 568 place count 120 transition count 325
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 569 place count 119 transition count 324
Applied a total of 569 rules in 79 ms. Remains 119 /605 variables (removed 486) and now considering 324/900 (removed 576) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 119/605 places, 324/900 transitions.
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 14 ms
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 13 ms
[2024-05-23 11:56:12] [INFO ] Input system was already deterministic with 324 transitions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 40 place count 565 transition count 804
Iterating global reduction 1 with 39 rules applied. Total rules applied 79 place count 565 transition count 804
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 82 place count 565 transition count 801
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 559 transition count 795
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 559 transition count 795
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 96 place count 559 transition count 793
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 97 place count 558 transition count 792
Iterating global reduction 3 with 1 rules applied. Total rules applied 98 place count 558 transition count 792
Applied a total of 98 rules in 56 ms. Remains 558 /605 variables (removed 47) and now considering 792/900 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 558/605 places, 792/900 transitions.
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 25 ms
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 25 ms
[2024-05-23 11:56:12] [INFO ] Input system was already deterministic with 792 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Graph (trivial) has 588 edges and 605 vertex of which 189 / 605 are part of one of the 20 SCC in 1 ms
Free SCC test removed 169 places
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Graph (complete) has 1318 edges and 436 vertex of which 418 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 65 output transitions
Drop transitions (Output transitions of discarded places.) removed 65 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 164 transitions
Trivial Post-agglo rules discarded 164 transitions
Performed 164 trivial Post agglomeration. Transition count delta: 164
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 418 transition count 477
Reduce places removed 164 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 176 rules applied. Total rules applied 342 place count 254 transition count 465
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 352 place count 244 transition count 465
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 352 place count 244 transition count 435
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 412 place count 214 transition count 435
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 425 place count 201 transition count 422
Iterating global reduction 3 with 13 rules applied. Total rules applied 438 place count 201 transition count 422
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 440 place count 201 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 440 place count 201 transition count 418
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 444 place count 199 transition count 418
Performed 54 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 54 places in 0 ms
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 4 with 108 rules applied. Total rules applied 552 place count 145 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 553 place count 145 transition count 362
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 563 place count 145 transition count 352
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 4 rules applied. Total rules applied 567 place count 145 transition count 348
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 571 place count 141 transition count 348
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 577 place count 138 transition count 345
Applied a total of 577 rules in 63 ms. Remains 138 /605 variables (removed 467) and now considering 345/900 (removed 555) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 138/605 places, 345/900 transitions.
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 12 ms
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 12 ms
[2024-05-23 11:56:12] [INFO ] Input system was already deterministic with 345 transitions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 569 transition count 808
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 569 transition count 808
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 569 transition count 805
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 563 transition count 799
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 563 transition count 799
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 88 place count 563 transition count 797
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 562 transition count 796
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 562 transition count 796
Applied a total of 90 rules in 49 ms. Remains 562 /605 variables (removed 43) and now considering 796/900 (removed 104) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 562/605 places, 796/900 transitions.
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 22 ms
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 23 ms
[2024-05-23 11:56:12] [INFO ] Input system was already deterministic with 796 transitions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 604 transition count 900
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 37 place count 568 transition count 807
Iterating global reduction 1 with 36 rules applied. Total rules applied 73 place count 568 transition count 807
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 568 transition count 805
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 81 place count 562 transition count 799
Iterating global reduction 2 with 6 rules applied. Total rules applied 87 place count 562 transition count 799
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 562 transition count 798
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 89 place count 561 transition count 797
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 561 transition count 797
Applied a total of 90 rules in 70 ms. Remains 561 /605 variables (removed 44) and now considering 797/900 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 561/605 places, 797/900 transitions.
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 37 ms
[2024-05-23 11:56:12] [INFO ] Flatten gal took : 26 ms
[2024-05-23 11:56:12] [INFO ] Input system was already deterministic with 797 transitions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 900/900 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 576 transition count 871
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 576 transition count 871
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 61 place count 576 transition count 868
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 570 transition count 862
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 570 transition count 862
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 75 place count 570 transition count 860
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 76 place count 569 transition count 859
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 569 transition count 859
Applied a total of 77 rules in 44 ms. Remains 569 /605 variables (removed 36) and now considering 859/900 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 569/605 places, 859/900 transitions.
[2024-05-23 11:56:13] [INFO ] Flatten gal took : 26 ms
[2024-05-23 11:56:13] [INFO ] Flatten gal took : 29 ms
[2024-05-23 11:56:13] [INFO ] Input system was already deterministic with 859 transitions.
[2024-05-23 11:56:13] [INFO ] Flatten gal took : 29 ms
[2024-05-23 11:56:13] [INFO ] Flatten gal took : 29 ms
[2024-05-23 11:56:13] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 22 ms.
[2024-05-23 11:56:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 605 places, 900 transitions and 3521 arcs took 10 ms.
Total runtime 94232 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CloudDeployment-PT-3b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 605
TRANSITIONS: 900
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.006s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.003s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 583
MODEL NAME: /home/mcc/execution/413/model
605 places, 900 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-09 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-10 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2024-11 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2023-12 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2023-13 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2023-14 CANNOT_COMPUTE
FORMULA CloudDeployment-PT-3b-CTLFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716467678398

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="CloudDeployment-PT-3b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is CloudDeployment-PT-3b, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620504800562"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-3b.tgz
mv CloudDeployment-PT-3b execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;