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.r476-tall-171620506200578.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CloudDeployment-PT-4b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r476-tall-171620506200578
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K 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.8K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Apr 11 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 11 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:34 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 591K 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-4b-CTLFireability-2024-00
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-01
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-02
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-03
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-04
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-05
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-06
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-07
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-08
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-09
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-10
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2024-11
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-12
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-13
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-14
FORMULA_NAME CloudDeployment-PT-4b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717208442141

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-4b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 02:20:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 02:20:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 02:20:43] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-06-01 02:20:43] [INFO ] Transformed 1182 places.
[2024-06-01 02:20:43] [INFO ] Transformed 1824 transitions.
[2024-06-01 02:20:43] [INFO ] Found NUPN structural information;
[2024-06-01 02:20:43] [INFO ] Parsed PT model containing 1182 places and 1824 transitions and 8741 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 104 out of 1182 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1182/1182 places, 1824/1824 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1178 transition count 1824
Discarding 282 places :
Symmetric choice reduction at 1 with 282 rule applications. Total rules 286 place count 896 transition count 1542
Iterating global reduction 1 with 282 rules applied. Total rules applied 568 place count 896 transition count 1542
Discarding 105 places :
Symmetric choice reduction at 1 with 105 rule applications. Total rules 673 place count 791 transition count 1437
Iterating global reduction 1 with 105 rules applied. Total rules applied 778 place count 791 transition count 1437
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 788 place count 791 transition count 1427
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 799 place count 780 transition count 1416
Iterating global reduction 2 with 11 rules applied. Total rules applied 810 place count 780 transition count 1416
Applied a total of 810 rules in 254 ms. Remains 780 /1182 variables (removed 402) and now considering 1416/1824 (removed 408) transitions.
// Phase 1: matrix 1416 rows 780 cols
[2024-06-01 02:20:43] [INFO ] Computed 13 invariants in 32 ms
[2024-06-01 02:20:44] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-06-01 02:20:44] [INFO ] Invariant cache hit.
[2024-06-01 02:20:45] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
Running 1415 sub problems to find dead transitions.
[2024-06-01 02:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 779/2196 variables, and 13 constraints, problems are : Problem set: 0 solved, 1415 unsolved in 30052 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/780 constraints, PredecessorRefiner: 1415/1415 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1415 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/779 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/779 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
At refinement iteration 2 (OVERLAPS) 1416/2195 variables, 779/792 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2195 variables, 1415/2207 constraints. Problems are: Problem set: 0 solved, 1415 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2195/2196 variables, and 2207 constraints, problems are : Problem set: 0 solved, 1415 unsolved in 30053 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 779/780 constraints, PredecessorRefiner: 1415/1415 constraints, Known Traps: 0/0 constraints]
After SMT, in 63188ms problems are : Problem set: 0 solved, 1415 unsolved
Search for dead transitions found 0 dead transitions in 63251ms
Starting structural reductions in LTL mode, iteration 1 : 780/1182 places, 1416/1824 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64938 ms. Remains : 780/1182 places, 1416/1824 transitions.
Support contains 104 out of 780 places after structural reductions.
[2024-06-01 02:21:49] [INFO ] Flatten gal took : 264 ms
[2024-06-01 02:21:49] [INFO ] Flatten gal took : 111 ms
[2024-06-01 02:21:49] [INFO ] Input system was already deterministic with 1416 transitions.
RANDOM walk for 40000 steps (311 resets) in 3710 ms. (10 steps per ms) remains 34/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 34/34 properties
[2024-06-01 02:21:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 140/208 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 802/1010 variables, 208/221 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1010 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 6 (OVERLAPS) 476/1486 variables, 202/423 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1486 variables, 0/423 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 8 (OVERLAPS) 371/1857 variables, 175/598 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1857 variables, 0/598 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 257/2114 variables, 137/735 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2114 variables, 0/735 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 69/2183 variables, 49/784 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2183 variables, 0/784 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 12/2195 variables, 8/792 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2195 variables, 0/792 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 16 (OVERLAPS) 1/2196 variables, 1/793 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2196 variables, 0/793 constraints. Problems are: Problem set: 10 solved, 24 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2196/2196 variables, and 793 constraints, problems are : Problem set: 10 solved, 24 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 780/780 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 150/206 variables, 12/13 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/13 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 4 (OVERLAPS) 800/1006 variables, 206/219 constraints. Problems are: Problem set: 10 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1006 variables, 0/219 constraints. Problems are: Problem set: 10 solved, 24 unsolved
Problem AtomicPropp42 is UNSAT
At refinement iteration 6 (OVERLAPS) 473/1479 variables, 201/420 constraints. Problems are: Problem set: 11 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1479 variables, 23/443 constraints. Problems are: Problem set: 11 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1479 variables, 0/443 constraints. Problems are: Problem set: 11 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 368/1847 variables, 174/617 constraints. Problems are: Problem set: 11 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1847 variables, 0/617 constraints. Problems are: Problem set: 11 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 257/2104 variables, 136/753 constraints. Problems are: Problem set: 11 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2104 variables, 0/753 constraints. Problems are: Problem set: 11 solved, 23 unsolved
At refinement iteration 13 (OVERLAPS) 77/2181 variables, 53/806 constraints. Problems are: Problem set: 11 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2181/2196 variables, and 806 constraints, problems are : Problem set: 11 solved, 23 unsolved in 5007 ms.
Refiners :[Generalized P Invariants (flows): 13/13 constraints, State Equation: 770/780 constraints, PredecessorRefiner: 23/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 10237ms problems are : Problem set: 11 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 780 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 705 edges and 780 vertex of which 194 / 780 are part of one of the 22 SCC in 9 ms
Free SCC test removed 172 places
Drop transitions (Empty/Sink Transition effects.) removed 220 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 1944 edges and 608 vertex of which 605 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 204 transitions
Trivial Post-agglo rules discarded 204 transitions
Performed 204 trivial Post agglomeration. Transition count delta: 204
Iterating post reduction 0 with 206 rules applied. Total rules applied 208 place count 605 transition count 989
Reduce places removed 204 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Iterating post reduction 1 with 229 rules applied. Total rules applied 437 place count 401 transition count 964
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 460 place count 379 transition count 963
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 460 place count 379 transition count 907
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 3 with 112 rules applied. Total rules applied 572 place count 323 transition count 907
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 578 place count 317 transition count 901
Iterating global reduction 3 with 6 rules applied. Total rules applied 584 place count 317 transition count 901
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 584 place count 317 transition count 900
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 586 place count 316 transition count 900
Performed 77 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 740 place count 239 transition count 822
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 741 place count 239 transition count 821
Performed 32 Post agglomeration using F-continuation condition with reduction of 24 identical transitions.
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 4 with 64 rules applied. Total rules applied 805 place count 207 transition count 1006
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 820 place count 207 transition count 991
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 822 place count 206 transition count 1005
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 825 place count 206 transition count 1002
Drop transitions (Redundant composition of simpler transitions.) removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 6 with 48 rules applied. Total rules applied 873 place count 206 transition count 954
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 875 place count 205 transition count 953
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 897 place count 205 transition count 931
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 939 place count 183 transition count 911
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 942 place count 183 transition count 908
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 950 place count 183 transition count 908
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 957 place count 183 transition count 901
Applied a total of 957 rules in 283 ms. Remains 183 /780 variables (removed 597) and now considering 901/1416 (removed 515) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 284 ms. Remains : 183/780 places, 901/1416 transitions.
RANDOM walk for 40000 steps (735 resets) in 1039 ms. (38 steps per ms) remains 10/23 properties
BEST_FIRST walk for 40004 steps (45 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (64 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 101 ms. (392 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (50 resets) in 99 ms. (400 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (67 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (48 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (68 resets) in 102 ms. (388 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (46 resets) in 92 ms. (430 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (62 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
[2024-06-01 02:22:01] [INFO ] Flow matrix only has 810 transitions (discarded 91 similar events)
// Phase 1: matrix 810 rows 183 cols
[2024-06-01 02:22:01] [INFO ] Computed 15 invariants in 10 ms
[2024-06-01 02:22:01] [INFO ] State equation strengthened by 77 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 111/129 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 767/897 variables, 130/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 67/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/897 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 78/975 variables, 44/256 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/975 variables, 6/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 17/992 variables, 8/270 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/992 variables, 4/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/992 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 1/993 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/993 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/993 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 993/993 variables, and 275 constraints, problems are : Problem set: 0 solved, 9 unsolved in 926 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 183/183 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 111/129 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/130 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 767/897 variables, 130/145 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/897 variables, 67/212 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/897 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/897 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 78/975 variables, 44/258 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/975 variables, 6/264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/975 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/975 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 17/992 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/992 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/992 variables, 5/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/992 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 1/993 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/993 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (OVERLAPS) 0/993 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 993/993 variables, and 284 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1693 ms.
Refiners :[Generalized P Invariants (flows): 15/15 constraints, State Equation: 183/183 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2687ms problems are : Problem set: 0 solved, 9 unsolved
Parikh walk visited 6 properties in 1003 ms.
Support contains 9 out of 183 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 183/183 places, 901/901 transitions.
Graph (trivial) has 118 edges and 183 vertex of which 29 / 183 are part of one of the 12 SCC in 1 ms
Free SCC test removed 17 places
Drop transitions (Empty/Sink Transition effects.) removed 292 transitions
Reduce isomorphic transitions removed 292 transitions.
Graph (complete) has 1173 edges and 166 vertex of which 144 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 144 transition count 596
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 20 place count 139 transition count 596
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 139 transition count 592
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 28 place count 135 transition count 592
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 29 place count 135 transition count 591
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 134 transition count 586
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 134 transition count 586
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 55 place count 122 transition count 574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 122 transition count 573
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 64 place count 118 transition count 611
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 94 place count 118 transition count 581
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 5 with 80 rules applied. Total rules applied 174 place count 118 transition count 501
Free-agglomeration rule applied 12 times with reduction of 2 identical transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 186 place count 118 transition count 487
Reduce places removed 12 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 5 with 34 rules applied. Total rules applied 220 place count 106 transition count 465
Drop transitions (Redundant composition of simpler transitions.) removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 6 with 25 rules applied. Total rules applied 245 place count 106 transition count 440
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 246 place count 105 transition count 434
Iterating global reduction 6 with 1 rules applied. Total rules applied 247 place count 105 transition count 434
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 248 place count 105 transition count 434
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 249 place count 105 transition count 433
Applied a total of 249 rules in 73 ms. Remains 105 /183 variables (removed 78) and now considering 433/901 (removed 468) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 105/183 places, 433/901 transitions.
RANDOM walk for 40000 steps (577 resets) in 1355 ms. (29 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (76 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (37 resets) in 77 ms. (512 steps per ms) remains 2/2 properties
[2024-06-01 02:22:06] [INFO ] Flow matrix only has 283 transitions (discarded 150 similar events)
// Phase 1: matrix 283 rows 105 cols
[2024-06-01 02:22:06] [INFO ] Computed 12 invariants in 2 ms
[2024-06-01 02:22:06] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/64 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/91 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 261/352 variables, 91/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 66/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 36/388 variables, 14/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/388 variables, 39/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/388 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/388 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 388/388 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 28/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 30/64 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 27/91 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 02:22:06] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 261/352 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/352 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/352 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 36/388 variables, 14/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/388 variables, 39/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/388 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/388 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/388 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 388/388 variables, and 225 constraints, problems are : Problem set: 0 solved, 2 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 668ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 6 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 433/433 transitions.
Graph (trivial) has 39 edges and 105 vertex of which 4 / 105 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 37 transitions
Redundant transition composition rules discarded 37 transitions
Iterating global reduction 0 with 37 rules applied. Total rules applied 38 place count 103 transition count 390
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 103 transition count 384
Reduce places removed 6 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 17 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 69 place count 97 transition count 365
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 71 place count 95 transition count 353
Iterating global reduction 1 with 2 rules applied. Total rules applied 73 place count 95 transition count 353
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 95 transition count 351
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 95 transition count 339
Applied a total of 87 rules in 24 ms. Remains 95 /105 variables (removed 10) and now considering 339/433 (removed 94) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 95/105 places, 339/433 transitions.
RANDOM walk for 40000 steps (711 resets) in 140 ms. (283 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (48 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
[2024-06-01 02:22:07] [INFO ] Flow matrix only has 196 transitions (discarded 143 similar events)
// Phase 1: matrix 196 rows 95 cols
[2024-06-01 02:22:07] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 02:22:07] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/91 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/286 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 88/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/291 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 17/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/291 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 291/291 variables, and 214 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 42/62 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/91 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 195/286 variables, 91/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 88/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/291 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/291 variables, 17/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/291 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/291 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 291/291 variables, and 215 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 95/95 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 339/339 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 1 place count 95 transition count 338
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 94 transition count 338
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 93 transition count 337
Applied a total of 4 rules in 8 ms. Remains 93 /95 variables (removed 2) and now considering 337/339 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 93/95 places, 337/339 transitions.
RANDOM walk for 40000 steps (713 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (54 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1850705 steps, run timeout after 3001 ms. (steps per millisecond=616 ) properties seen :0 out of 1
Probabilistic random walk after 1850705 steps, saw 242435 distinct states, run finished after 3004 ms. (steps per millisecond=616 ) properties seen :0
[2024-06-01 02:22:10] [INFO ] Flow matrix only has 194 transitions (discarded 143 similar events)
// Phase 1: matrix 194 rows 93 cols
[2024-06-01 02:22:10] [INFO ] Computed 14 invariants in 3 ms
[2024-06-01 02:22:10] [INFO ] State equation strengthened by 105 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/89 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 193/282 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 88/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/287 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 17/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/287 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 212 constraints, problems are : Problem set: 0 solved, 1 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 93/93 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 40/60 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/89 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 193/282 variables, 89/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 88/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/287 variables, 4/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 17/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/287 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 213 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 93/93 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 14 ms.
Support contains 5 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 337/337 transitions.
Applied a total of 0 rules in 19 ms. Remains 93 /93 variables (removed 0) and now considering 337/337 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 93/93 places, 337/337 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 337/337 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 337/337 (removed 0) transitions.
[2024-06-01 02:22:10] [INFO ] Flow matrix only has 194 transitions (discarded 143 similar events)
[2024-06-01 02:22:10] [INFO ] Invariant cache hit.
[2024-06-01 02:22:10] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 02:22:10] [INFO ] Flow matrix only has 194 transitions (discarded 143 similar events)
[2024-06-01 02:22:10] [INFO ] Invariant cache hit.
[2024-06-01 02:22:11] [INFO ] State equation strengthened by 105 read => feed constraints.
[2024-06-01 02:22:11] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2024-06-01 02:22:11] [INFO ] Redundant transitions in 177 ms returned []
Running 336 sub problems to find dead transitions.
[2024-06-01 02:22:11] [INFO ] Flow matrix only has 194 transitions (discarded 143 similar events)
[2024-06-01 02:22:11] [INFO ] Invariant cache hit.
[2024-06-01 02:22:11] [INFO ] State equation strengthened by 105 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 194/287 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 105/212 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 212 constraints, problems are : Problem set: 0 solved, 336 unsolved in 8574 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 93/93 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 336 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (OVERLAPS) 1/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (OVERLAPS) 194/287 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 105/212 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 336/548 constraints. Problems are: Problem set: 0 solved, 336 unsolved
[2024-06-01 02:22:25] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 336 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 549 constraints, problems are : Problem set: 0 solved, 336 unsolved in 19390 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 93/93 constraints, ReadFeed: 105/105 constraints, PredecessorRefiner: 336/336 constraints, Known Traps: 1/1 constraints]
After SMT, in 28437ms problems are : Problem set: 0 solved, 336 unsolved
Search for dead transitions found 0 dead transitions in 28444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28959 ms. Remains : 93/93 places, 337/337 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 77 edges and 93 vertex of which 24 / 93 are part of one of the 3 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions (Empty/Sink Transition effects.) removed 33 transitions
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 177 transitions.
Ensure Unique test removed 5 places
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 13 rules applied. Total rules applied 14 place count 67 transition count 152
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 12 rules applied. Total rules applied 26 place count 59 transition count 148
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 57 transition count 147
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 31 place count 56 transition count 146
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 31 place count 56 transition count 142
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 39 place count 52 transition count 142
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 50 transition count 140
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 50 transition count 140
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 45 place count 48 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 47 place count 48 transition count 130
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 4 with 26 rules applied. Total rules applied 73 place count 48 transition count 104
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 5 with 12 rules applied. Total rules applied 85 place count 42 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 87 place count 42 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
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 91 place count 40 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 6 with 24 rules applied. Total rules applied 115 place count 40 transition count 91
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 116 place count 39 transition count 88
Iterating global reduction 6 with 1 rules applied. Total rules applied 117 place count 39 transition count 88
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 123 place count 36 transition count 85
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 125 place count 34 transition count 73
Iterating global reduction 6 with 2 rules applied. Total rules applied 127 place count 34 transition count 73
Applied a total of 127 rules in 37 ms. Remains 34 /93 variables (removed 59) and now considering 73/337 (removed 264) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 73 rows 34 cols
[2024-06-01 02:22:39] [INFO ] Computed 7 invariants in 0 ms
[2024-06-01 02:22:39] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 02:22:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 02:22:39] [INFO ] [Nat]Absence check using 2 positive and 5 generalized place invariants in 1 ms returned sat
[2024-06-01 02:22:39] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 02:22:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 02:22:39] [INFO ] After 6ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 02:22:39] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 02:22:39] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 215 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 149 ms
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 81 ms
[2024-06-01 02:22:40] [INFO ] Input system was already deterministic with 1416 transitions.
Support contains 85 out of 780 places (down from 95) after GAL structural reductions.
Computed a total of 126 stabilizing places and 588 stable transitions
Graph (complete) has 2178 edges and 780 vertex of which 755 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.16 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 798 edges and 780 vertex of which 278 / 780 are part of one of the 31 SCC in 2 ms
Free SCC test removed 247 places
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 282 transitions.
Graph (complete) has 1855 edges and 533 vertex of which 508 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.3 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 219 place count 507 transition count 657
Reduce places removed 217 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 221 rules applied. Total rules applied 440 place count 290 transition count 653
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 445 place count 286 transition count 652
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 445 place count 286 transition count 615
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 519 place count 249 transition count 615
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 526 place count 242 transition count 608
Iterating global reduction 3 with 7 rules applied. Total rules applied 533 place count 242 transition count 608
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 242 transition count 607
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 534 place count 242 transition count 605
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 538 place count 240 transition count 605
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 674 place count 172 transition count 536
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 690 place count 172 transition count 520
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 4 with 8 rules applied. Total rules applied 698 place count 172 transition count 512
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 706 place count 164 transition count 512
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 714 place count 160 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 715 place count 159 transition count 507
Applied a total of 715 rules in 83 ms. Remains 159 /780 variables (removed 621) and now considering 507/1416 (removed 909) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 159/780 places, 507/1416 transitions.
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 20 ms
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 21 ms
[2024-06-01 02:22:40] [INFO ] Input system was already deterministic with 507 transitions.
RANDOM walk for 209 steps (6 resets) in 12 ms. (16 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-4b-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 792 edges and 780 vertex of which 278 / 780 are part of one of the 31 SCC in 1 ms
Free SCC test removed 247 places
Ensure Unique test removed 282 transitions
Reduce isomorphic transitions removed 282 transitions.
Graph (complete) has 1855 edges and 533 vertex of which 508 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 215 transitions
Trivial Post-agglo rules discarded 215 transitions
Performed 215 trivial Post agglomeration. Transition count delta: 215
Iterating post reduction 0 with 215 rules applied. Total rules applied 217 place count 508 transition count 660
Reduce places removed 215 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 219 rules applied. Total rules applied 436 place count 293 transition count 656
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 439 place count 290 transition count 656
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 439 place count 290 transition count 618
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 515 place count 252 transition count 618
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 522 place count 245 transition count 611
Iterating global reduction 3 with 7 rules applied. Total rules applied 529 place count 245 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 530 place count 245 transition count 610
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 530 place count 245 transition count 608
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 534 place count 243 transition count 608
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 670 place count 175 transition count 539
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 686 place count 175 transition count 523
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 4 with 8 rules applied. Total rules applied 694 place count 175 transition count 515
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 702 place count 167 transition count 515
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 710 place count 163 transition count 511
Applied a total of 710 rules in 65 ms. Remains 163 /780 variables (removed 617) and now considering 511/1416 (removed 905) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 163/780 places, 511/1416 transitions.
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 16 ms
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 17 ms
[2024-06-01 02:22:40] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 760 transition count 1396
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 760 transition count 1396
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 754 transition count 1390
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 754 transition count 1390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 754 transition count 1388
Applied a total of 54 rules in 41 ms. Remains 754 /780 variables (removed 26) and now considering 1388/1416 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 754/780 places, 1388/1416 transitions.
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 68 ms
[2024-06-01 02:22:40] [INFO ] Flatten gal took : 70 ms
[2024-06-01 02:22:41] [INFO ] Input system was already deterministic with 1388 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 803 edges and 780 vertex of which 287 / 780 are part of one of the 32 SCC in 1 ms
Free SCC test removed 255 places
Ensure Unique test removed 291 transitions
Reduce isomorphic transitions removed 291 transitions.
Graph (complete) has 1839 edges and 525 vertex of which 501 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 258 output transitions
Drop transitions (Output transitions of discarded places.) removed 258 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 500 transition count 648
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 438 place count 282 transition count 648
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 438 place count 282 transition count 612
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 510 place count 246 transition count 612
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 517 place count 239 transition count 605
Iterating global reduction 2 with 7 rules applied. Total rules applied 524 place count 239 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 525 place count 239 transition count 604
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 525 place count 239 transition count 602
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 529 place count 237 transition count 602
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 663 place count 170 transition count 534
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 679 place count 170 transition count 518
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 3 with 8 rules applied. Total rules applied 687 place count 170 transition count 510
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 695 place count 162 transition count 510
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 703 place count 158 transition count 506
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 706 place count 158 transition count 506
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 707 place count 157 transition count 505
Applied a total of 707 rules in 79 ms. Remains 157 /780 variables (removed 623) and now considering 505/1416 (removed 911) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 80 ms. Remains : 157/780 places, 505/1416 transitions.
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 18 ms
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 18 ms
[2024-06-01 02:22:41] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 785 edges and 780 vertex of which 262 / 780 are part of one of the 29 SCC in 0 ms
Free SCC test removed 233 places
Ensure Unique test removed 266 transitions
Reduce isomorphic transitions removed 266 transitions.
Graph (complete) has 1878 edges and 547 vertex of which 522 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 219 transitions
Trivial Post-agglo rules discarded 219 transitions
Performed 219 trivial Post agglomeration. Transition count delta: 219
Iterating post reduction 0 with 219 rules applied. Total rules applied 221 place count 522 transition count 672
Reduce places removed 219 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 226 rules applied. Total rules applied 447 place count 303 transition count 665
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 454 place count 297 transition count 664
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 454 place count 297 transition count 624
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 534 place count 257 transition count 624
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 541 place count 250 transition count 617
Iterating global reduction 3 with 7 rules applied. Total rules applied 548 place count 250 transition count 617
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 549 place count 250 transition count 616
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 549 place count 250 transition count 614
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 553 place count 248 transition count 614
Performed 69 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 691 place count 179 transition count 544
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 707 place count 179 transition count 528
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 4 with 8 rules applied. Total rules applied 715 place count 179 transition count 520
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 723 place count 171 transition count 520
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 731 place count 167 transition count 516
Applied a total of 731 rules in 59 ms. Remains 167 /780 variables (removed 613) and now considering 516/1416 (removed 900) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 167/780 places, 516/1416 transitions.
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 16 ms
[2024-06-01 02:22:41] [INFO ] Input system was already deterministic with 516 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 30 place count 750 transition count 1140
Iterating global reduction 1 with 29 rules applied. Total rules applied 59 place count 750 transition count 1140
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 65 place count 744 transition count 1134
Iterating global reduction 1 with 6 rules applied. Total rules applied 71 place count 744 transition count 1134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 744 transition count 1132
Applied a total of 73 rules in 70 ms. Remains 744 /780 variables (removed 36) and now considering 1132/1416 (removed 284) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 744/780 places, 1132/1416 transitions.
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 33 ms
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 34 ms
[2024-06-01 02:22:41] [INFO ] Input system was already deterministic with 1132 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 793 edges and 780 vertex of which 273 / 780 are part of one of the 30 SCC in 1 ms
Free SCC test removed 243 places
Ensure Unique test removed 278 transitions
Reduce isomorphic transitions removed 278 transitions.
Graph (complete) has 1859 edges and 537 vertex of which 512 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 220 transitions
Trivial Post-agglo rules discarded 220 transitions
Performed 220 trivial Post agglomeration. Transition count delta: 220
Iterating post reduction 0 with 220 rules applied. Total rules applied 222 place count 512 transition count 659
Reduce places removed 220 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 223 rules applied. Total rules applied 445 place count 292 transition count 656
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 447 place count 290 transition count 656
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 38 Pre rules applied. Total rules applied 447 place count 290 transition count 618
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 523 place count 252 transition count 618
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 530 place count 245 transition count 611
Iterating global reduction 3 with 7 rules applied. Total rules applied 537 place count 245 transition count 611
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 538 place count 245 transition count 610
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 538 place count 245 transition count 607
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 544 place count 242 transition count 607
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 4 with 136 rules applied. Total rules applied 680 place count 174 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 696 place count 174 transition count 522
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 4 with 8 rules applied. Total rules applied 704 place count 174 transition count 514
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 712 place count 166 transition count 514
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 720 place count 162 transition count 510
Applied a total of 720 rules in 62 ms. Remains 162 /780 variables (removed 618) and now considering 510/1416 (removed 906) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 162/780 places, 510/1416 transitions.
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 16 ms
[2024-06-01 02:22:41] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 761 transition count 1397
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 761 transition count 1397
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 755 transition count 1391
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 755 transition count 1391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 52 place count 755 transition count 1389
Applied a total of 52 rules in 81 ms. Remains 755 /780 variables (removed 25) and now considering 1389/1416 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 755/780 places, 1389/1416 transitions.
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 63 ms
[2024-06-01 02:22:41] [INFO ] Flatten gal took : 67 ms
[2024-06-01 02:22:42] [INFO ] Input system was already deterministic with 1389 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 749 transition count 1139
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 749 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 743 transition count 1133
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 743 transition count 1133
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 743 transition count 1131
Applied a total of 75 rules in 47 ms. Remains 743 /780 variables (removed 37) and now considering 1131/1416 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 743/780 places, 1131/1416 transitions.
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 32 ms
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 34 ms
[2024-06-01 02:22:42] [INFO ] Input system was already deterministic with 1131 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 754 transition count 1144
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 754 transition count 1144
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 57 place count 748 transition count 1138
Iterating global reduction 1 with 6 rules applied. Total rules applied 63 place count 748 transition count 1138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 748 transition count 1136
Applied a total of 65 rules in 44 ms. Remains 748 /780 variables (removed 32) and now considering 1136/1416 (removed 280) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 748/780 places, 1136/1416 transitions.
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 30 ms
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 32 ms
[2024-06-01 02:22:42] [INFO ] Input system was already deterministic with 1136 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 800 edges and 780 vertex of which 285 / 780 are part of one of the 32 SCC in 0 ms
Free SCC test removed 253 places
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Graph (complete) has 1842 edges and 527 vertex of which 502 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 216 transitions
Trivial Post-agglo rules discarded 216 transitions
Performed 216 trivial Post agglomeration. Transition count delta: 216
Iterating post reduction 0 with 216 rules applied. Total rules applied 218 place count 501 transition count 652
Reduce places removed 216 places and 0 transitions.
Iterating post reduction 1 with 216 rules applied. Total rules applied 434 place count 285 transition count 652
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 434 place count 285 transition count 616
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 506 place count 249 transition count 616
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 513 place count 242 transition count 609
Iterating global reduction 2 with 7 rules applied. Total rules applied 520 place count 242 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 521 place count 242 transition count 608
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 521 place count 242 transition count 606
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 525 place count 240 transition count 606
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 659 place count 173 transition count 538
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 3 with 15 rules applied. Total rules applied 674 place count 173 transition count 523
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 3 with 7 rules applied. Total rules applied 681 place count 173 transition count 516
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 688 place count 166 transition count 516
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 696 place count 162 transition count 512
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 697 place count 161 transition count 511
Applied a total of 697 rules in 59 ms. Remains 161 /780 variables (removed 619) and now considering 511/1416 (removed 905) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 161/780 places, 511/1416 transitions.
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 16 ms
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 17 ms
[2024-06-01 02:22:42] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 749 transition count 1139
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 749 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 743 transition count 1133
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 743 transition count 1133
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 743 transition count 1131
Applied a total of 75 rules in 37 ms. Remains 743 /780 variables (removed 37) and now considering 1131/1416 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 743/780 places, 1131/1416 transitions.
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 30 ms
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 31 ms
[2024-06-01 02:22:42] [INFO ] Input system was already deterministic with 1131 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 789 edges and 780 vertex of which 262 / 780 are part of one of the 30 SCC in 1 ms
Free SCC test removed 232 places
Ensure Unique test removed 265 transitions
Reduce isomorphic transitions removed 265 transitions.
Graph (complete) has 1874 edges and 548 vertex of which 523 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.2 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 221 transitions
Trivial Post-agglo rules discarded 221 transitions
Performed 221 trivial Post agglomeration. Transition count delta: 221
Iterating post reduction 0 with 221 rules applied. Total rules applied 223 place count 523 transition count 671
Reduce places removed 221 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 224 rules applied. Total rules applied 447 place count 302 transition count 668
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 449 place count 300 transition count 668
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 449 place count 300 transition count 625
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 535 place count 257 transition count 625
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 541 place count 251 transition count 619
Iterating global reduction 3 with 6 rules applied. Total rules applied 547 place count 251 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 548 place count 251 transition count 618
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 548 place count 251 transition count 616
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 552 place count 249 transition count 616
Performed 67 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 4 with 134 rules applied. Total rules applied 686 place count 182 transition count 548
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 4 with 17 rules applied. Total rules applied 703 place count 182 transition count 531
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 4 with 8 rules applied. Total rules applied 711 place count 182 transition count 523
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 719 place count 174 transition count 523
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 729 place count 169 transition count 518
Applied a total of 729 rules in 57 ms. Remains 169 /780 variables (removed 611) and now considering 518/1416 (removed 898) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 57 ms. Remains : 169/780 places, 518/1416 transitions.
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 14 ms
[2024-06-01 02:22:42] [INFO ] Flatten gal took : 15 ms
[2024-06-01 02:22:42] [INFO ] Input system was already deterministic with 518 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Graph (trivial) has 801 edges and 780 vertex of which 282 / 780 are part of one of the 32 SCC in 1 ms
Free SCC test removed 250 places
Ensure Unique test removed 285 transitions
Reduce isomorphic transitions removed 285 transitions.
Graph (complete) has 1847 edges and 530 vertex of which 505 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 259 output transitions
Drop transitions (Output transitions of discarded places.) removed 259 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 218 transitions
Trivial Post-agglo rules discarded 218 transitions
Performed 218 trivial Post agglomeration. Transition count delta: 218
Iterating post reduction 0 with 218 rules applied. Total rules applied 220 place count 504 transition count 653
Reduce places removed 218 places and 0 transitions.
Iterating post reduction 1 with 218 rules applied. Total rules applied 438 place count 286 transition count 653
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 37 Pre rules applied. Total rules applied 438 place count 286 transition count 616
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 512 place count 249 transition count 616
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 519 place count 242 transition count 609
Iterating global reduction 2 with 7 rules applied. Total rules applied 526 place count 242 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 527 place count 242 transition count 608
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 527 place count 242 transition count 606
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 531 place count 240 transition count 606
Performed 68 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 667 place count 172 transition count 537
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 683 place count 172 transition count 521
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 3 with 8 rules applied. Total rules applied 691 place count 172 transition count 513
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 699 place count 164 transition count 513
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 707 place count 160 transition count 509
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 708 place count 159 transition count 508
Applied a total of 708 rules in 59 ms. Remains 159 /780 variables (removed 621) and now considering 508/1416 (removed 908) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 159/780 places, 508/1416 transitions.
[2024-06-01 02:22:43] [INFO ] Flatten gal took : 16 ms
[2024-06-01 02:22:43] [INFO ] Flatten gal took : 21 ms
[2024-06-01 02:22:43] [INFO ] Input system was already deterministic with 508 transitions.
RANDOM walk for 33710 steps (1392 resets) in 640 ms. (52 steps per ms) remains 0/1 properties
FORMULA CloudDeployment-PT-4b-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 780/780 places, 1416/1416 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 779 transition count 1416
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 31 place count 749 transition count 1139
Iterating global reduction 1 with 30 rules applied. Total rules applied 61 place count 749 transition count 1139
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 67 place count 743 transition count 1133
Iterating global reduction 1 with 6 rules applied. Total rules applied 73 place count 743 transition count 1133
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 743 transition count 1131
Applied a total of 75 rules in 39 ms. Remains 743 /780 variables (removed 37) and now considering 1131/1416 (removed 285) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 743/780 places, 1131/1416 transitions.
[2024-06-01 02:22:43] [INFO ] Flatten gal took : 28 ms
[2024-06-01 02:22:43] [INFO ] Flatten gal took : 29 ms
[2024-06-01 02:22:43] [INFO ] Input system was already deterministic with 1131 transitions.
[2024-06-01 02:22:43] [INFO ] Flatten gal took : 58 ms
[2024-06-01 02:22:43] [INFO ] Flatten gal took : 58 ms
[2024-06-01 02:22:43] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 02:22:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 780 places, 1416 transitions and 7896 arcs took 10 ms.
Total runtime 120379 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-01
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-02
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-03
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-04
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-05
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-06
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-07
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-08
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-09
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-10
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2024-11
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2023-12
Could not compute solution for formula : CloudDeployment-PT-4b-CTLFireability-2023-15

BK_STOP 1717208564002

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/589/ctl_0_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/589/ctl_1_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/589/ctl_2_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/589/ctl_3_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/589/ctl_4_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/589/ctl_5_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/589/ctl_6_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/589/ctl_7_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/589/ctl_8_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/589/ctl_9_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/589/ctl_10_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/589/ctl_11_
ctl formula name CloudDeployment-PT-4b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/589/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudDeployment-PT-4b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CloudDeployment-PT-4b, 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 r476-tall-171620506200578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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