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.r179-tall-171640601100241.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 FunctionPointer-PT-b016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100241
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K 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 FunctionPointer-PT-b016-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b016-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716432176216

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:42:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:42:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:42:57] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-05-23 02:42:57] [INFO ] Transformed 306 places.
[2024-05-23 02:42:57] [INFO ] Transformed 840 transitions.
[2024-05-23 02:42:57] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 74 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 215 transition count 648
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 20 place count 202 transition count 576
Iterating global reduction 1 with 13 rules applied. Total rules applied 33 place count 202 transition count 576
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 202 transition count 540
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 71 place count 200 transition count 536
Iterating global reduction 2 with 2 rules applied. Total rules applied 73 place count 200 transition count 536
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 83 place count 200 transition count 526
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 84 place count 199 transition count 524
Iterating global reduction 3 with 1 rules applied. Total rules applied 85 place count 199 transition count 524
Applied a total of 85 rules in 70 ms. Remains 199 /222 variables (removed 23) and now considering 524/648 (removed 124) transitions.
[2024-05-23 02:42:57] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
// Phase 1: matrix 349 rows 199 cols
[2024-05-23 02:42:57] [INFO ] Computed 3 invariants in 21 ms
[2024-05-23 02:42:58] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-23 02:42:58] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
[2024-05-23 02:42:58] [INFO ] Invariant cache hit.
[2024-05-23 02:42:58] [INFO ] State equation strengthened by 64 read => feed constraints.
[2024-05-23 02:42:58] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 522 sub problems to find dead transitions.
[2024-05-23 02:42:58] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
[2024-05-23 02:42:58] [INFO ] Invariant cache hit.
[2024-05-23 02:42:58] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 349/546 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 522 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (OVERLAPS) 2/548 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 522 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 266 constraints, problems are : Problem set: 0 solved, 522 unsolved in 28822 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 522 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 2 (OVERLAPS) 1/197 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 4 (OVERLAPS) 349/546 variables, 197/200 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 64/264 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 32/296 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 8 (OVERLAPS) 2/548 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 490/788 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 522 unsolved
At refinement iteration 11 (OVERLAPS) 0/548 variables, 0/788 constraints. Problems are: Problem set: 0 solved, 522 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 788 constraints, problems are : Problem set: 0 solved, 522 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 522/522 constraints, Known Traps: 0/0 constraints]
After SMT, in 59683ms problems are : Problem set: 0 solved, 522 unsolved
Search for dead transitions found 0 dead transitions in 59700ms
Starting structural reductions in LTL mode, iteration 1 : 199/222 places, 524/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60386 ms. Remains : 199/222 places, 524/648 transitions.
Support contains 74 out of 199 places after structural reductions.
[2024-05-23 02:43:58] [INFO ] Flatten gal took : 66 ms
[2024-05-23 02:43:58] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:43:58] [INFO ] Flatten gal took : 29 ms
[2024-05-23 02:43:58] [INFO ] Input system was already deterministic with 524 transitions.
Support contains 45 out of 199 places (down from 74) after GAL structural reductions.
RANDOM walk for 40026 steps (32 resets) in 1691 ms. (23 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40003 steps (12 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (15 resets) in 96 ms. (412 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (13 resets) in 191 ms. (208 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (18 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (14 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (21 resets) in 92 ms. (430 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (9 resets) in 53 ms. (740 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (13 resets) in 76 ms. (519 steps per ms) remains 10/10 properties
[2024-05-23 02:43:59] [INFO ] Flow matrix only has 349 transitions (discarded 175 similar events)
[2024-05-23 02:43:59] [INFO ] Invariant cache hit.
[2024-05-23 02:43:59] [INFO ] State equation strengthened by 64 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 1 (OVERLAPS) 31/42 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/44 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 196/240 variables, 44/46 constraints. Problems are: Problem set: 3 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 15/61 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 0/61 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 247/487 variables, 109/170 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/487 variables, 49/219 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/487 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 6/493 variables, 1/220 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/493 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 55/548 variables, 46/266 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/548 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/548 variables, 0/266 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 266 constraints, problems are : Problem set: 3 solved, 7 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 36/44 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 207/251 variables, 24/32 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 3/35 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 7/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/251 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 29/280 variables, 2/44 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 6/50 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 229/509 variables, 129/179 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/509 variables, 61/240 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 0/240 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 6/515 variables, 1/241 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/515 variables, 0/241 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 33/548 variables, 32/273 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/548 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 0/548 variables, 0/273 constraints. Problems are: Problem set: 3 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 273 constraints, problems are : Problem set: 3 solved, 7 unsolved in 484 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 199/199 constraints, ReadFeed: 64/64 constraints, PredecessorRefiner: 7/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 875ms problems are : Problem set: 3 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5538 ms.
Support contains 8 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 807 edges and 199 vertex of which 172 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.4 ms
Discarding 27 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 172 transition count 476
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 68 place count 153 transition count 404
Iterating global reduction 1 with 19 rules applied. Total rules applied 87 place count 153 transition count 404
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 99 place count 153 transition count 392
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 110 place count 142 transition count 370
Iterating global reduction 2 with 11 rules applied. Total rules applied 121 place count 142 transition count 370
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 138 transition count 360
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 138 transition count 360
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 132 place count 135 transition count 350
Iterating global reduction 2 with 3 rules applied. Total rules applied 135 place count 135 transition count 350
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 138 place count 132 transition count 342
Iterating global reduction 2 with 3 rules applied. Total rules applied 141 place count 132 transition count 342
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 143 place count 130 transition count 334
Iterating global reduction 2 with 2 rules applied. Total rules applied 145 place count 130 transition count 334
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 147 place count 128 transition count 328
Iterating global reduction 2 with 2 rules applied. Total rules applied 149 place count 128 transition count 328
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 151 place count 126 transition count 324
Iterating global reduction 2 with 2 rules applied. Total rules applied 153 place count 126 transition count 324
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 155 place count 124 transition count 320
Iterating global reduction 2 with 2 rules applied. Total rules applied 157 place count 124 transition count 320
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 158 place count 123 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 159 place count 123 transition count 318
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 160 place count 122 transition count 316
Iterating global reduction 2 with 1 rules applied. Total rules applied 161 place count 122 transition count 316
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 173 place count 122 transition count 304
Applied a total of 173 rules in 129 ms. Remains 122 /199 variables (removed 77) and now considering 304/524 (removed 220) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 122/199 places, 304/524 transitions.
RANDOM walk for 40001 steps (8 resets) in 245 ms. (162 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
[2024-05-23 02:44:06] [INFO ] Flow matrix only has 199 transitions (discarded 105 similar events)
// Phase 1: matrix 199 rows 122 cols
[2024-05-23 02:44:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:44:06] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 117/141 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 14/155 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 141/296 variables, 82/108 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/302 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/302 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 19/321 variables, 18/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/321 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 157 constraints, problems are : Problem set: 0 solved, 5 unsolved in 208 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 117/141 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 14/155 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 141/296 variables, 82/113 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 30/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/302 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/302 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 19/321 variables, 18/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/321 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 321/321 variables, and 162 constraints, problems are : Problem set: 0 solved, 5 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 122/122 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 443ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2436 ms.
Support contains 5 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 304/304 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 119 transition count 296
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 119 transition count 296
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 119 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 117 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 117 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 115 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 115 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 113 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 113 transition count 280
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 111 transition count 276
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 111 transition count 276
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 109 transition count 272
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 109 transition count 272
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 107 transition count 268
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 107 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 106 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 106 transition count 266
Applied a total of 34 rules in 30 ms. Remains 106 /122 variables (removed 16) and now considering 266/304 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 106/122 places, 266/304 transitions.
RANDOM walk for 40001 steps (8 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 293312 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 5
Probabilistic random walk after 293312 steps, saw 182591 distinct states, run finished after 3005 ms. (steps per millisecond=97 ) properties seen :0
[2024-05-23 02:44:12] [INFO ] Flow matrix only has 172 transitions (discarded 94 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-23 02:44:12] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:44:12] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 102/126 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 10/136 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 123/259 variables, 70/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/259 variables, 24/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 6/265 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/265 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 13/278 variables, 14/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/278 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/278 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 135 constraints, problems are : Problem set: 0 solved, 5 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 19/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 102/126 variables, 13/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 10/136 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/136 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 123/259 variables, 70/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/259 variables, 24/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/259 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 6/265 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/265 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 13/278 variables, 14/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/278 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/278 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 140 constraints, problems are : Problem set: 0 solved, 5 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 401ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3459 ms.
Support contains 5 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 266/266 transitions.
Applied a total of 0 rules in 21 ms. Remains 106 /106 variables (removed 0) and now considering 266/266 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 106/106 places, 266/266 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 266/266 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 266/266 (removed 0) transitions.
[2024-05-23 02:44:15] [INFO ] Flow matrix only has 172 transitions (discarded 94 similar events)
[2024-05-23 02:44:15] [INFO ] Invariant cache hit.
[2024-05-23 02:44:16] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-23 02:44:16] [INFO ] Flow matrix only has 172 transitions (discarded 94 similar events)
[2024-05-23 02:44:16] [INFO ] Invariant cache hit.
[2024-05-23 02:44:16] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-05-23 02:44:16] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-23 02:44:16] [INFO ] Redundant transitions in 11 ms returned []
Running 264 sub problems to find dead transitions.
[2024-05-23 02:44:16] [INFO ] Flow matrix only has 172 transitions (discarded 94 similar events)
[2024-05-23 02:44:16] [INFO ] Invariant cache hit.
[2024-05-23 02:44:16] [INFO ] State equation strengthened by 26 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 172/278 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 264 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 26/135 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (OVERLAPS) 0/278 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 135 constraints, problems are : Problem set: 0 solved, 264 unsolved in 4817 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (OVERLAPS) 172/278 variables, 106/109 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/278 variables, 26/135 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 264/399 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 399 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8615 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 106/106 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
After SMT, in 13664ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 13668ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13921 ms. Remains : 106/106 places, 266/266 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 103 rules applied. Total rules applied 103 place count 106 transition count 163
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 112 place count 97 transition count 163
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 112 place count 97 transition count 139
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 160 place count 73 transition count 139
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 2 with 30 rules applied. Total rules applied 190 place count 58 transition count 124
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 197 place count 51 transition count 110
Iterating global reduction 2 with 7 rules applied. Total rules applied 204 place count 51 transition count 110
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 211 place count 44 transition count 96
Iterating global reduction 2 with 7 rules applied. Total rules applied 218 place count 44 transition count 96
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 225 place count 37 transition count 82
Iterating global reduction 2 with 7 rules applied. Total rules applied 232 place count 37 transition count 82
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 239 place count 37 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 239 place count 37 transition count 74
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 241 place count 36 transition count 74
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 249 place count 32 transition count 74
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 250 place count 32 transition count 73
Applied a total of 250 rules in 24 ms. Remains 32 /106 variables (removed 74) and now considering 73/266 (removed 193) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 73 rows 32 cols
[2024-05-23 02:44:29] [INFO ] Computed 3 invariants in 1 ms
[2024-05-23 02:44:29] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 02:44:30] [INFO ] After 25ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5
[2024-05-23 02:44:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-23 02:44:30] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 02:44:30] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 02:44:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 02:44:30] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 02:44:30] [INFO ] After 13ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-23 02:44:30] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-23 02:44:30] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 229 ms.
Successfully simplified 3 atomic propositions for a total of 10 simplifications.
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:44:30] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 24 ms
FORMULA FunctionPointer-PT-b016-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 26 ms
[2024-05-23 02:44:30] [INFO ] Input system was already deterministic with 524 transitions.
Support contains 38 out of 199 places (down from 40) after GAL structural reductions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 174 transition count 446
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 174 transition count 446
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 61 place count 174 transition count 430
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 163 transition count 408
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 163 transition count 408
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 90 place count 156 transition count 390
Iterating global reduction 1 with 7 rules applied. Total rules applied 97 place count 156 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 104 place count 149 transition count 364
Iterating global reduction 1 with 7 rules applied. Total rules applied 111 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 118 place count 142 transition count 348
Iterating global reduction 1 with 7 rules applied. Total rules applied 125 place count 142 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 131 place count 136 transition count 326
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 136 transition count 326
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 143 place count 130 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 155 place count 124 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 161 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 167 place count 118 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 173 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 178 place count 113 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 183 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 188 place count 108 transition count 262
Iterating global reduction 1 with 5 rules applied. Total rules applied 193 place count 108 transition count 262
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 197 place count 104 transition count 254
Iterating global reduction 1 with 4 rules applied. Total rules applied 201 place count 104 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 203 place count 104 transition count 252
Applied a total of 203 rules in 82 ms. Remains 104 /199 variables (removed 95) and now considering 252/524 (removed 272) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 82 ms. Remains : 104/199 places, 252/524 transitions.
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:44:30] [INFO ] Input system was already deterministic with 252 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 23 place count 176 transition count 458
Iterating global reduction 1 with 20 rules applied. Total rules applied 43 place count 176 transition count 458
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 65 place count 176 transition count 436
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 75 place count 166 transition count 416
Iterating global reduction 2 with 10 rules applied. Total rules applied 85 place count 166 transition count 416
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 159 transition count 398
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 159 transition count 398
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 105 place count 153 transition count 376
Iterating global reduction 2 with 6 rules applied. Total rules applied 111 place count 153 transition count 376
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 117 place count 147 transition count 362
Iterating global reduction 2 with 6 rules applied. Total rules applied 123 place count 147 transition count 362
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 127 place count 143 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 131 place count 143 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 135 place count 139 transition count 332
Iterating global reduction 2 with 4 rules applied. Total rules applied 139 place count 139 transition count 332
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 142 place count 136 transition count 326
Iterating global reduction 2 with 3 rules applied. Total rules applied 145 place count 136 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 148 place count 133 transition count 320
Iterating global reduction 2 with 3 rules applied. Total rules applied 151 place count 133 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 154 place count 130 transition count 314
Iterating global reduction 2 with 3 rules applied. Total rules applied 157 place count 130 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 160 place count 127 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 163 place count 127 transition count 308
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 165 place count 125 transition count 304
Iterating global reduction 2 with 2 rules applied. Total rules applied 167 place count 125 transition count 304
Applied a total of 167 rules in 31 ms. Remains 125 /199 variables (removed 74) and now considering 304/524 (removed 220) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 125/199 places, 304/524 transitions.
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 11 ms
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 12 ms
[2024-05-23 02:44:30] [INFO ] Input system was already deterministic with 304 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 176 transition count 450
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 176 transition count 450
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 55 place count 176 transition count 436
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 66 place count 165 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 77 place count 165 transition count 414
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 159 transition count 400
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 159 transition count 400
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 95 place count 153 transition count 378
Iterating global reduction 1 with 6 rules applied. Total rules applied 101 place count 153 transition count 378
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 107 place count 147 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 113 place count 147 transition count 364
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 119 place count 141 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 125 place count 141 transition count 340
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 131 place count 135 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 137 place count 135 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 143 place count 129 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 149 place count 129 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 155 place count 123 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 161 place count 123 transition count 294
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 167 place count 117 transition count 282
Iterating global reduction 1 with 6 rules applied. Total rules applied 173 place count 117 transition count 282
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 179 place count 111 transition count 270
Iterating global reduction 1 with 6 rules applied. Total rules applied 185 place count 111 transition count 270
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 190 place count 106 transition count 260
Iterating global reduction 1 with 5 rules applied. Total rules applied 195 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 199 place count 106 transition count 256
Applied a total of 199 rules in 58 ms. Remains 106 /199 variables (removed 93) and now considering 256/524 (removed 268) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 106/199 places, 256/524 transitions.
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:30] [INFO ] Input system was already deterministic with 256 transitions.
RANDOM walk for 40017 steps (41 resets) in 384 ms. (103 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (12 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1569329 steps, run timeout after 3001 ms. (steps per millisecond=522 ) properties seen :0 out of 1
Probabilistic random walk after 1569329 steps, saw 1031705 distinct states, run finished after 3001 ms. (steps per millisecond=522 ) properties seen :0
[2024-05-23 02:44:33] [INFO ] Flow matrix only has 173 transitions (discarded 83 similar events)
// Phase 1: matrix 173 rows 106 cols
[2024-05-23 02:44:33] [INFO ] Computed 2 invariants in 4 ms
[2024-05-23 02:44:33] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/26 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/121 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 5/126 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 133/259 variables, 71/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/259 variables, 38/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/265 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/265 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 14/279 variables, 16/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/279 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/279 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 279/279 variables, and 148 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/26 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 95/121 variables, 8/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/121 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 5/126 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 133/259 variables, 71/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/259 variables, 38/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/259 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/265 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/265 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 14/279 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/279 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/279 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 279/279 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 256/256 transitions.
Graph (complete) has 430 edges and 106 vertex of which 82 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 82 transition count 208
Applied a total of 49 rules in 6 ms. Remains 82 /106 variables (removed 24) and now considering 208/256 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 82/106 places, 208/256 transitions.
RANDOM walk for 44247 steps (0 resets) in 146 ms. (301 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-b016-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 174 transition count 446
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 174 transition count 446
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 63 place count 174 transition count 430
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 74 place count 163 transition count 408
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 163 transition count 408
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 156 transition count 390
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 156 transition count 390
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 106 place count 149 transition count 364
Iterating global reduction 2 with 7 rules applied. Total rules applied 113 place count 149 transition count 364
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 120 place count 142 transition count 348
Iterating global reduction 2 with 7 rules applied. Total rules applied 127 place count 142 transition count 348
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 133 place count 136 transition count 326
Iterating global reduction 2 with 6 rules applied. Total rules applied 139 place count 136 transition count 326
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 145 place count 130 transition count 306
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 130 transition count 306
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 157 place count 124 transition count 294
Iterating global reduction 2 with 6 rules applied. Total rules applied 163 place count 124 transition count 294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 169 place count 118 transition count 282
Iterating global reduction 2 with 6 rules applied. Total rules applied 175 place count 118 transition count 282
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 180 place count 113 transition count 272
Iterating global reduction 2 with 5 rules applied. Total rules applied 185 place count 113 transition count 272
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 190 place count 108 transition count 262
Iterating global reduction 2 with 5 rules applied. Total rules applied 195 place count 108 transition count 262
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 199 place count 104 transition count 254
Iterating global reduction 2 with 4 rules applied. Total rules applied 203 place count 104 transition count 254
Applied a total of 203 rules in 24 ms. Remains 104 /199 variables (removed 95) and now considering 254/524 (removed 270) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 104/199 places, 254/524 transitions.
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Graph (complete) has 1073 edges and 199 vertex of which 196 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 177 transition count 460
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 177 transition count 460
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 59 place count 177 transition count 440
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 168 transition count 422
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 168 transition count 422
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 83 place count 162 transition count 406
Iterating global reduction 1 with 6 rules applied. Total rules applied 89 place count 162 transition count 406
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 94 place count 157 transition count 388
Iterating global reduction 1 with 5 rules applied. Total rules applied 99 place count 157 transition count 388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 104 place count 152 transition count 376
Iterating global reduction 1 with 5 rules applied. Total rules applied 109 place count 152 transition count 376
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 113 place count 148 transition count 362
Iterating global reduction 1 with 4 rules applied. Total rules applied 117 place count 148 transition count 362
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 121 place count 144 transition count 350
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 144 transition count 350
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 129 place count 140 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 133 place count 140 transition count 342
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 136 place count 137 transition count 336
Iterating global reduction 1 with 3 rules applied. Total rules applied 139 place count 137 transition count 336
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 142 place count 134 transition count 330
Iterating global reduction 1 with 3 rules applied. Total rules applied 145 place count 134 transition count 330
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 148 place count 131 transition count 324
Iterating global reduction 1 with 3 rules applied. Total rules applied 151 place count 131 transition count 324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 153 place count 129 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 155 place count 129 transition count 320
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 163 place count 129 transition count 312
Applied a total of 163 rules in 52 ms. Remains 129 /199 variables (removed 70) and now considering 312/524 (removed 212) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 129/199 places, 312/524 transitions.
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 10 ms
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 11 ms
[2024-05-23 02:44:34] [INFO ] Input system was already deterministic with 312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 25 place count 174 transition count 446
Iterating global reduction 1 with 22 rules applied. Total rules applied 47 place count 174 transition count 446
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 63 place count 174 transition count 430
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 74 place count 163 transition count 408
Iterating global reduction 2 with 11 rules applied. Total rules applied 85 place count 163 transition count 408
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 91 place count 157 transition count 392
Iterating global reduction 2 with 6 rules applied. Total rules applied 97 place count 157 transition count 392
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 103 place count 151 transition count 370
Iterating global reduction 2 with 6 rules applied. Total rules applied 109 place count 151 transition count 370
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 115 place count 145 transition count 356
Iterating global reduction 2 with 6 rules applied. Total rules applied 121 place count 145 transition count 356
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 127 place count 139 transition count 334
Iterating global reduction 2 with 6 rules applied. Total rules applied 133 place count 139 transition count 334
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 139 place count 133 transition count 314
Iterating global reduction 2 with 6 rules applied. Total rules applied 145 place count 133 transition count 314
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 151 place count 127 transition count 302
Iterating global reduction 2 with 6 rules applied. Total rules applied 157 place count 127 transition count 302
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 163 place count 121 transition count 290
Iterating global reduction 2 with 6 rules applied. Total rules applied 169 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 174 place count 116 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 179 place count 116 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 184 place count 111 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 111 transition count 270
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 193 place count 107 transition count 262
Iterating global reduction 2 with 4 rules applied. Total rules applied 197 place count 107 transition count 262
Applied a total of 197 rules in 25 ms. Remains 107 /199 variables (removed 92) and now considering 262/524 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 107/199 places, 262/524 transitions.
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:44:34] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 175 transition count 448
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 175 transition count 448
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 61 place count 175 transition count 432
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 72 place count 164 transition count 410
Iterating global reduction 2 with 11 rules applied. Total rules applied 83 place count 164 transition count 410
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 90 place count 157 transition count 392
Iterating global reduction 2 with 7 rules applied. Total rules applied 97 place count 157 transition count 392
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 104 place count 150 transition count 366
Iterating global reduction 2 with 7 rules applied. Total rules applied 111 place count 150 transition count 366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 118 place count 143 transition count 350
Iterating global reduction 2 with 7 rules applied. Total rules applied 125 place count 143 transition count 350
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 131 place count 137 transition count 328
Iterating global reduction 2 with 6 rules applied. Total rules applied 137 place count 137 transition count 328
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 143 place count 131 transition count 308
Iterating global reduction 2 with 6 rules applied. Total rules applied 149 place count 131 transition count 308
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 155 place count 125 transition count 296
Iterating global reduction 2 with 6 rules applied. Total rules applied 161 place count 125 transition count 296
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 167 place count 119 transition count 284
Iterating global reduction 2 with 6 rules applied. Total rules applied 173 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 115 transition count 276
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 115 transition count 276
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 185 place count 111 transition count 268
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 111 transition count 268
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 192 place count 108 transition count 262
Iterating global reduction 2 with 3 rules applied. Total rules applied 195 place count 108 transition count 262
Applied a total of 195 rules in 24 ms. Remains 108 /199 variables (removed 91) and now considering 262/524 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 108/199 places, 262/524 transitions.
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 175 transition count 456
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 175 transition count 456
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 69 place count 175 transition count 432
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 79 place count 165 transition count 412
Iterating global reduction 2 with 10 rules applied. Total rules applied 89 place count 165 transition count 412
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 96 place count 158 transition count 394
Iterating global reduction 2 with 7 rules applied. Total rules applied 103 place count 158 transition count 394
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 110 place count 151 transition count 368
Iterating global reduction 2 with 7 rules applied. Total rules applied 117 place count 151 transition count 368
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 124 place count 144 transition count 352
Iterating global reduction 2 with 7 rules applied. Total rules applied 131 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 137 place count 138 transition count 330
Iterating global reduction 2 with 6 rules applied. Total rules applied 143 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 149 place count 132 transition count 310
Iterating global reduction 2 with 6 rules applied. Total rules applied 155 place count 132 transition count 310
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 161 place count 126 transition count 298
Iterating global reduction 2 with 6 rules applied. Total rules applied 167 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 173 place count 120 transition count 286
Iterating global reduction 2 with 6 rules applied. Total rules applied 179 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 184 place count 115 transition count 276
Iterating global reduction 2 with 5 rules applied. Total rules applied 189 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 194 place count 110 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 199 place count 110 transition count 266
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 203 place count 106 transition count 258
Iterating global reduction 2 with 4 rules applied. Total rules applied 207 place count 106 transition count 258
Applied a total of 207 rules in 27 ms. Remains 106 /199 variables (removed 93) and now considering 258/524 (removed 266) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 106/199 places, 258/524 transitions.
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 524/524 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 196 transition count 524
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 22 place count 177 transition count 460
Iterating global reduction 1 with 19 rules applied. Total rules applied 41 place count 177 transition count 460
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 59 place count 177 transition count 442
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 68 place count 168 transition count 424
Iterating global reduction 2 with 9 rules applied. Total rules applied 77 place count 168 transition count 424
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 162 transition count 410
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 162 transition count 410
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 95 place count 156 transition count 388
Iterating global reduction 2 with 6 rules applied. Total rules applied 101 place count 156 transition count 388
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 107 place count 150 transition count 374
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 150 transition count 374
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 145 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 145 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 128 place count 140 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 133 place count 140 transition count 336
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 138 place count 135 transition count 326
Iterating global reduction 2 with 5 rules applied. Total rules applied 143 place count 135 transition count 326
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 148 place count 130 transition count 316
Iterating global reduction 2 with 5 rules applied. Total rules applied 153 place count 130 transition count 316
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 158 place count 125 transition count 306
Iterating global reduction 2 with 5 rules applied. Total rules applied 163 place count 125 transition count 306
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 168 place count 120 transition count 296
Iterating global reduction 2 with 5 rules applied. Total rules applied 173 place count 120 transition count 296
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 177 place count 116 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 181 place count 116 transition count 288
Applied a total of 181 rules in 23 ms. Remains 116 /199 variables (removed 83) and now considering 288/524 (removed 236) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 116/199 places, 288/524 transitions.
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 8 ms
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:44:34] [INFO ] Input system was already deterministic with 288 transitions.
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:44:34] [INFO ] Flatten gal took : 16 ms
[2024-05-23 02:44:34] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-23 02:44:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 199 places, 524 transitions and 2112 arcs took 5 ms.
Total runtime 97170 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b016

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/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: 608
MODEL NAME: /home/mcc/execution/410/model
199 places, 524 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.
coverability test failed!!
Convergence in 11 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716432277002

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

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

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="FunctionPointer-PT-b016"
export BK_EXAMINATION="CTLCardinality"
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 FunctionPointer-PT-b016, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601100241"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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