fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r135-tall-171631131300530
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for DoubleExponent-PT-002

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
406.172 15948.00 41503.00 55.80 T????TF????????? normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 33K 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 DoubleExponent-PT-002-CTLFireability-2024-00
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-01
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-02
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-03
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-04
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-05
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-06
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-07
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-08
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-09
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-10
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2024-11
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-12
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-13
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-14
FORMULA_NAME DoubleExponent-PT-002-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716375412103

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:56:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 10:56:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:56:53] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-22 10:56:53] [INFO ] Transformed 110 places.
[2024-05-22 10:56:53] [INFO ] Transformed 98 transitions.
[2024-05-22 10:56:53] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 74 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 106 transition count 98
Applied a total of 4 rules in 27 ms. Remains 106 /110 variables (removed 4) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 106 cols
[2024-05-22 10:56:53] [INFO ] Computed 11 invariants in 19 ms
[2024-05-22 10:56:53] [INFO ] Implicit Places using invariants in 208 ms returned [76]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 246 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 105/110 places, 98/98 transitions.
Applied a total of 0 rules in 3 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 293 ms. Remains : 105/110 places, 98/98 transitions.
Support contains 74 out of 105 places after structural reductions.
[2024-05-22 10:56:53] [INFO ] Flatten gal took : 29 ms
[2024-05-22 10:56:53] [INFO ] Flatten gal took : 12 ms
[2024-05-22 10:56:54] [INFO ] Input system was already deterministic with 98 transitions.
Reduction of identical properties reduced properties to check from 63 to 62
RANDOM walk for 40000 steps (1310 resets) in 1518 ms. (26 steps per ms) remains 34/62 properties
BEST_FIRST walk for 4000 steps (112 resets) in 157 ms. (25 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (112 resets) in 124 ms. (32 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (108 resets) in 51 ms. (76 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (113 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (117 resets) in 47 ms. (83 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 39 ms. (100 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (110 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 59 ms. (66 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (107 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (112 resets) in 154 ms. (25 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (104 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (104 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (118 resets) in 37 ms. (105 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (104 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (148 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (109 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (117 resets) in 46 ms. (85 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (118 resets) in 48 ms. (81 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (115 resets) in 41 ms. (95 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (115 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (112 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (116 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (111 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (116 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (113 resets) in 40 ms. (97 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (115 resets) in 33 ms. (117 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (110 resets) in 32 ms. (121 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (114 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (112 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (107 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (117 resets) in 28 ms. (137 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (110 resets) in 55 ms. (71 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (115 resets) in 35 ms. (111 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4001 steps (114 resets) in 45 ms. (86 steps per ms) remains 34/34 properties
// Phase 1: matrix 98 rows 105 cols
[2024-05-22 10:56:55] [INFO ] Computed 10 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 11/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 31/92 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 95/187 variables, 92/102 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 7 (OVERLAPS) 16/203 variables, 13/115 constraints. Problems are: Problem set: 9 solved, 25 unsolved
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/203 variables, 1/116 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/203 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 10 (OVERLAPS) 0/203 variables, 0/116 constraints. Problems are: Problem set: 9 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 203/203 variables, and 116 constraints, problems are : Problem set: 9 solved, 25 unsolved in 1344 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 9 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 14/50 variables, 2/2 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/2 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 41/91 variables, 8/10 constraints. Problems are: Problem set: 9 solved, 25 unsolved
[2024-05-22 10:56:56] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 95/186 variables, 91/102 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 12/114 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/114 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 17/203 variables, 14/128 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/203 variables, 13/141 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/203 variables, 1/142 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/203 variables, 0/142 constraints. Problems are: Problem set: 9 solved, 25 unsolved
At refinement iteration 13 (OVERLAPS) 0/203 variables, 0/142 constraints. Problems are: Problem set: 9 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 203/203 variables, and 142 constraints, problems are : Problem set: 9 solved, 25 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 25/34 constraints, Known Traps: 2/2 constraints]
After SMT, in 2541ms problems are : Problem set: 9 solved, 25 unsolved
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 0 properties in 1717 ms.
Support contains 36 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 98/98 transitions.
Graph (complete) has 171 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 104 transition count 95
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 6 rules applied. Total rules applied 9 place count 102 transition count 91
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 13 place count 98 transition count 91
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 13 place count 98 transition count 85
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 25 place count 92 transition count 85
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 39 place count 85 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
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 43 place count 83 transition count 78
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 46 place count 83 transition count 75
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 49 place count 80 transition count 75
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 51 place count 80 transition count 75
Applied a total of 51 rules in 33 ms. Remains 80 /105 variables (removed 25) and now considering 75/98 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 80/105 places, 75/98 transitions.
RANDOM walk for 40000 steps (1970 resets) in 484 ms. (82 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40001 steps (1676 resets) in 179 ms. (222 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1677 resets) in 129 ms. (307 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1668 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1659 resets) in 239 ms. (166 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1671 resets) in 136 ms. (291 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1676 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1678 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1666 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1675 resets) in 138 ms. (287 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1635 resets) in 83 ms. (476 steps per ms) remains 10/10 properties
// Phase 1: matrix 75 rows 80 cols
[2024-05-22 10:57:00] [INFO ] Computed 10 invariants in 5 ms
[2024-05-22 10:57:00] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 37/63 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 4/67 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 70/137 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 15/152 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/152 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 3/155 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 10:57:00] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
[2024-05-22 10:57:00] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/155 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/155 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (OVERLAPS) 0/155 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 155/155 variables, and 94 constraints, problems are : Problem set: 0 solved, 10 unsolved in 427 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 6/22 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 4/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 37/63 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 10:57:00] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 4/67 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 70/137 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/137 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/137 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/137 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 15/152 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/152 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/152 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/152 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 3/155 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-05-22 10:57:01] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/155 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/155 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/155 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 155/155 variables, and 106 constraints, problems are : Problem set: 0 solved, 10 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 80/80 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints]
After SMT, in 997ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 2476 ms.
Support contains 16 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 75/75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 80 transition count 68
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 73 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 71 transition count 66
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 71 transition count 65
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 70 transition count 65
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 3 with 12 rules applied. Total rules applied 32 place count 64 transition count 59
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 64 transition count 57
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 36 place count 62 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 62 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 38 place count 61 transition count 56
Applied a total of 38 rules in 14 ms. Remains 61 /80 variables (removed 19) and now considering 56/75 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 61/80 places, 56/75 transitions.
RANDOM walk for 40000 steps (2815 resets) in 304 ms. (131 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40001 steps (2207 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2208 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2196 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (2221 resets) in 135 ms. (294 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2205 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (2191 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2204 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
// Phase 1: matrix 56 rows 61 cols
[2024-05-22 10:57:04] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 10:57:04] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 10:57:04] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 33/51 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 10:57:04] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/54 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 56/110 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 7/117 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/117 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/117 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 117/117 variables, and 77 constraints, problems are : Problem set: 0 solved, 7 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 3/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 33/51 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 3/54 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/54 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 56/110 variables, 54/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 4/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 7/117 variables, 7/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/117 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 10:57:04] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 1 ms to minimize.
[2024-05-22 10:57:04] [INFO ] Deduced a trap composed of 9 places in 25 ms of which 1 ms to minimize.
[2024-05-22 10:57:04] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-22 10:57:04] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/117 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/117 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 0/117 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 117/117 variables, and 88 constraints, problems are : Problem set: 0 solved, 7 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 61/61 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 6/6 constraints]
After SMT, in 601ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 1353 ms.
Support contains 13 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 56/56 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 60 transition count 55
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 55
Applied a total of 4 rules in 6 ms. Remains 60 /61 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 60/61 places, 55/56 transitions.
RANDOM walk for 40000 steps (2820 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2197 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (2194 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2236 resets) in 88 ms. (449 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2210 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2159 resets) in 62 ms. (634 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (2176 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (2217 resets) in 64 ms. (615 steps per ms) remains 7/7 properties
Finished probabilistic random walk after 539 steps, run visited all 7 properties in 13 ms. (steps per millisecond=41 )
Probabilistic random walk after 539 steps, saw 280 distinct states, run finished after 16 ms. (steps per millisecond=33 ) properties seen :7
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2024-05-22 10:57:06] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 7 ms
[2024-05-22 10:57:06] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DoubleExponent-PT-002-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 6 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 98 transitions.
Support contains 53 out of 105 places (down from 60) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 7 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Graph (complete) has 171 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 104 transition count 74
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 81 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 47 place count 81 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 78 transition count 71
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 87 place count 61 transition count 54
Applied a total of 87 rules in 11 ms. Remains 61 /105 variables (removed 44) and now considering 54/98 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 61/105 places, 54/98 transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Graph (complete) has 171 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 103 transition count 77
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 84 transition count 74
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 45 place count 81 transition count 74
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 81 transition count 72
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 49 place count 79 transition count 72
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 79 place count 64 transition count 57
Applied a total of 79 rules in 9 ms. Remains 64 /105 variables (removed 41) and now considering 57/98 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 64/105 places, 57/98 transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 6 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Applied a total of 0 rules in 1 ms. Remains 105 /105 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 105/105 places, 98/98 transitions.
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:06] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:06] [INFO ] Input system was already deterministic with 98 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Graph (complete) has 171 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 103 transition count 75
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 82 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 43 place count 82 transition count 72
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 49 place count 79 transition count 72
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 75 place count 66 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 65 transition count 58
Applied a total of 76 rules in 9 ms. Remains 65 /105 variables (removed 40) and now considering 58/98 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 65/105 places, 58/98 transitions.
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 3 ms
[2024-05-22 10:57:07] [INFO ] Input system was already deterministic with 58 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Input system was already deterministic with 97 transitions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 97
Applied a total of 2 rules in 2 ms. Remains 104 /105 variables (removed 1) and now considering 97/98 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 104/105 places, 97/98 transitions.
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Input system was already deterministic with 97 transitions.
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 5 ms
[2024-05-22 10:57:07] [INFO ] Flatten gal took : 4 ms
[2024-05-22 10:57:07] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-22 10:57:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 98 transitions and 269 arcs took 2 ms.
Total runtime 13904 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-002

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 105
TRANSITIONS: 98
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


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


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

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

Process ID: 581
MODEL NAME: /home/mcc/execution/407/model
105 places, 98 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
coverability test failed!!
Start RS construction.
Convergence in 1 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716375428051

--------------------
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

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="DoubleExponent-PT-002"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-002, 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 r135-tall-171631131300530"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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