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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 888K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Apr 11 16:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 16:04 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-b032-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-b032-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717189126096

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:58:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:58:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:58:47] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-31 20:58:47] [INFO ] Transformed 306 places.
[2024-05-31 20:58:47] [INFO ] Transformed 840 transitions.
[2024-05-31 20:58:47] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 206 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 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-b032-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 66 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 214 transition count 648
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 23 place count 199 transition count 558
Iterating global reduction 1 with 15 rules applied. Total rules applied 38 place count 199 transition count 558
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 70 place count 199 transition count 526
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 77 place count 192 transition count 512
Iterating global reduction 2 with 7 rules applied. Total rules applied 84 place count 192 transition count 512
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 87 place count 189 transition count 506
Iterating global reduction 2 with 3 rules applied. Total rules applied 90 place count 189 transition count 506
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 92 place count 187 transition count 498
Iterating global reduction 2 with 2 rules applied. Total rules applied 94 place count 187 transition count 498
Applied a total of 94 rules in 72 ms. Remains 187 /222 variables (removed 35) and now considering 498/648 (removed 150) transitions.
[2024-05-31 20:58:47] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
// Phase 1: matrix 330 rows 187 cols
[2024-05-31 20:58:47] [INFO ] Computed 2 invariants in 20 ms
[2024-05-31 20:58:47] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-31 20:58:47] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
[2024-05-31 20:58:47] [INFO ] Invariant cache hit.
[2024-05-31 20:58:48] [INFO ] State equation strengthened by 62 read => feed constraints.
[2024-05-31 20:58:48] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 591 ms to find 0 implicit places.
Running 496 sub problems to find dead transitions.
[2024-05-31 20:58:48] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
[2024-05-31 20:58:48] [INFO ] Invariant cache hit.
[2024-05-31 20:58:48] [INFO ] State equation strengthened by 62 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 330/515 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 62/249 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (OVERLAPS) 2/517 variables, 2/251 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 8 (OVERLAPS) 0/517 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 251 constraints, problems are : Problem set: 0 solved, 496 unsolved in 26348 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 496 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/185 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 3 (OVERLAPS) 330/515 variables, 185/187 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/515 variables, 62/249 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/515 variables, 32/281 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/515 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 7 (OVERLAPS) 2/517 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/517 variables, 464/747 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/517 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 496 unsolved
At refinement iteration 10 (OVERLAPS) 0/517 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 496 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 747 constraints, problems are : Problem set: 0 solved, 496 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 496/496 constraints, Known Traps: 0/0 constraints]
After SMT, in 57123ms problems are : Problem set: 0 solved, 496 unsolved
Search for dead transitions found 0 dead transitions in 57150ms
Starting structural reductions in LTL mode, iteration 1 : 187/222 places, 498/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57835 ms. Remains : 187/222 places, 498/648 transitions.
Support contains 66 out of 187 places after structural reductions.
[2024-05-31 20:59:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 20:59:45] [INFO ] Flatten gal took : 87 ms
FORMULA FunctionPointer-PT-b032-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 20:59:45] [INFO ] Flatten gal took : 65 ms
[2024-05-31 20:59:45] [INFO ] Input system was already deterministic with 498 transitions.
Support contains 54 out of 187 places (down from 66) after GAL structural reductions.
RANDOM walk for 40055 steps (25 resets) in 1064 ms. (37 steps per ms) remains 21/44 properties
BEST_FIRST walk for 4004 steps (10 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 35 ms. (111 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
[2024-05-31 20:59:46] [INFO ] Flow matrix only has 330 transitions (discarded 168 similar events)
[2024-05-31 20:59:46] [INFO ] Invariant cache hit.
[2024-05-31 20:59:46] [INFO ] State equation strengthened by 62 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 41/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 22/92 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 190/282 variables, 92/94 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 15/109 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 8 (OVERLAPS) 159/441 variables, 51/160 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/441 variables, 40/200 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/441 variables, 0/200 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 11 (OVERLAPS) 68/509 variables, 36/236 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/509 variables, 7/243 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/509 variables, 0/243 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 8/517 variables, 8/251 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/517 variables, 0/251 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 16 (OVERLAPS) 0/517 variables, 0/251 constraints. Problems are: Problem set: 4 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 517/517 variables, and 251 constraints, problems are : Problem set: 4 solved, 17 unsolved in 1296 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 41/63 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 26/89 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 181/270 variables, 89/91 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 15/106 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/106 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 161/431 variables, 47/153 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/431 variables, 40/193 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/431 variables, 17/210 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/431 variables, 0/210 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 77/508 variables, 42/252 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/508 variables, 7/259 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/508 variables, 0/259 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 9/517 variables, 9/268 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/517 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 0/517 variables, 0/268 constraints. Problems are: Problem set: 4 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 517/517 variables, and 268 constraints, problems are : Problem set: 4 solved, 17 unsolved in 1191 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 187/187 constraints, ReadFeed: 62/62 constraints, PredecessorRefiner: 17/21 constraints, Known Traps: 0/0 constraints]
After SMT, in 2507ms problems are : Problem set: 4 solved, 17 unsolved
Fused 17 Parikh solutions to 13 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 22 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 498/498 transitions.
Graph (complete) has 755 edges and 187 vertex of which 165 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 43 place count 165 transition count 456
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 54 place count 154 transition count 406
Iterating global reduction 1 with 11 rules applied. Total rules applied 65 place count 154 transition count 406
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 73 place count 154 transition count 398
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 146 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 146 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 146 transition count 378
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 144 transition count 374
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 144 transition count 374
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 99 place count 142 transition count 366
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 142 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 103 place count 140 transition count 362
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 140 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 107 place count 138 transition count 354
Iterating global reduction 3 with 2 rules applied. Total rules applied 109 place count 138 transition count 354
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 110 place count 137 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 111 place count 137 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 112 place count 136 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 113 place count 136 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 114 place count 135 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 115 place count 135 transition count 346
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 116 place count 134 transition count 344
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 134 transition count 344
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 118 place count 133 transition count 342
Iterating global reduction 3 with 1 rules applied. Total rules applied 119 place count 133 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 133 place count 133 transition count 328
Applied a total of 133 rules in 118 ms. Remains 133 /187 variables (removed 54) and now considering 328/498 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 133/187 places, 328/498 transitions.
RANDOM walk for 40000 steps (10 resets) in 489 ms. (81 steps per ms) remains 13/17 properties
BEST_FIRST walk for 40003 steps (9 resets) in 98 ms. (404 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (9 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (9 resets) in 131 ms. (303 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (9 resets) in 134 ms. (296 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 52 ms. (754 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 49 ms. (800 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (10 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (9 resets) in 52 ms. (754 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (12 resets) in 103 ms. (384 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (10 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (9 resets) in 39 ms. (1000 steps per ms) remains 12/12 properties
[2024-05-31 20:59:49] [INFO ] Flow matrix only has 216 transitions (discarded 112 similar events)
// Phase 1: matrix 216 rows 133 cols
[2024-05-31 20:59:49] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 20:59:49] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 43/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 106/164 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 105/269 variables, 24/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 17/286 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/286 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 55/341 variables, 42/157 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 9/166 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 8/349 variables, 8/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/349 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 349/349 variables, and 174 constraints, problems are : Problem set: 0 solved, 12 unsolved in 462 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 43/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 106/164 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/164 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 105/269 variables, 24/83 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 30/113 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 12/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 17/286 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 55/341 variables, 42/169 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 9/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 8/349 variables, 8/186 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/349 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/349 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 349/349 variables, and 186 constraints, problems are : Problem set: 0 solved, 12 unsolved in 687 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 133/133 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 1173ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 4 properties in 30408 ms.
Support contains 10 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 328/328 transitions.
Graph (complete) has 546 edges and 133 vertex of which 129 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 129 transition count 322
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 11 place count 125 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 125 transition count 314
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 19 place count 125 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 21 place count 123 transition count 306
Iterating global reduction 2 with 2 rules applied. Total rules applied 23 place count 123 transition count 306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 25 place count 121 transition count 302
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 121 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 29 place count 119 transition count 296
Iterating global reduction 2 with 2 rules applied. Total rules applied 31 place count 119 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 33 place count 117 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 35 place count 117 transition count 292
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 116 transition count 288
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 116 transition count 288
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 115 transition count 286
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 115 transition count 286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 114 transition count 284
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 114 transition count 284
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 113 transition count 282
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 113 transition count 282
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 112 transition count 280
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 112 transition count 280
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 111 transition count 278
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 111 transition count 278
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 110 transition count 276
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 110 transition count 276
Applied a total of 49 rules in 45 ms. Remains 110 /133 variables (removed 23) and now considering 276/328 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 110/133 places, 276/328 transitions.
RANDOM walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 60 ms. (655 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 49 ms. (800 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 245157 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 8
Probabilistic random walk after 245157 steps, saw 152619 distinct states, run finished after 3025 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-31 21:00:24] [INFO ] Flow matrix only has 178 transitions (discarded 98 similar events)
// Phase 1: matrix 178 rows 110 cols
[2024-05-31 21:00:24] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:00:24] [INFO ] State equation strengthened by 31 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 46/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 101/157 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 79/236 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 14/250 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 34/284 variables, 29/134 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/288 variables, 4/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/288 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 144 constraints, problems are : Problem set: 0 solved, 8 unsolved in 281 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 46/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 101/157 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 79/236 variables, 19/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 25/101 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 14/250 variables, 2/111 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 34/284 variables, 29/142 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 4/288 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/288 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 152 constraints, problems are : Problem set: 0 solved, 8 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 110/110 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 635ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 12422 ms.
Support contains 8 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 276/276 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 109 transition count 272
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 109 transition count 272
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 108 transition count 270
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 108 transition count 270
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 107 transition count 266
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 107 transition count 266
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 106 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 106 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 105 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 105 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 104 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 104 transition count 260
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 103 transition count 258
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 103 transition count 258
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 102 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 102 transition count 256
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 101 transition count 254
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 101 transition count 254
Applied a total of 18 rules in 25 ms. Remains 101 /110 variables (removed 9) and now considering 254/276 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 101/110 places, 254/276 transitions.
RANDOM walk for 40002 steps (8 resets) in 127 ms. (312 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 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 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 299425 steps, run timeout after 3001 ms. (steps per millisecond=99 ) properties seen :0 out of 5
Probabilistic random walk after 299425 steps, saw 186399 distinct states, run finished after 3007 ms. (steps per millisecond=99 ) properties seen :0
[2024-05-31 21:00:40] [INFO ] Flow matrix only has 162 transitions (discarded 92 similar events)
// Phase 1: matrix 162 rows 101 cols
[2024-05-31 21:00:40] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 21:00:40] [INFO ] State equation strengthened by 28 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 97/152 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 69/221 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 12/233 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/233 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 27/260 variables, 24/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/260 variables, 5/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 3/263 variables, 3/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/263 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/263 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 132 constraints, problems are : Problem set: 0 solved, 5 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 28/28 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 47/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 97/152 variables, 55/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/152 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 69/221 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/221 variables, 23/96 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/221 variables, 5/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/221 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 12/233 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 27/260 variables, 24/129 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/260 variables, 5/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/260 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 3/263 variables, 3/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/263 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/263 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 137 constraints, problems are : Problem set: 0 solved, 5 unsolved in 241 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 101/101 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 7266 ms.
Support contains 7 out of 101 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 101/101 places, 254/254 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 100 transition count 252
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 100 transition count 252
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 99 transition count 248
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 99 transition count 248
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 98 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 98 transition count 246
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 97 transition count 244
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 97 transition count 244
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 96 transition count 242
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 96 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 95 transition count 240
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 95 transition count 240
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 94 transition count 238
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 94 transition count 238
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 93 transition count 236
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 93 transition count 236
Applied a total of 16 rules in 14 ms. Remains 93 /101 variables (removed 8) and now considering 236/254 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 93/101 places, 236/254 transitions.
RANDOM walk for 40000 steps (8 resets) in 87 ms. (454 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 28 ms. (1379 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 371182 steps, run timeout after 3001 ms. (steps per millisecond=123 ) properties seen :0 out of 4
Probabilistic random walk after 371182 steps, saw 231051 distinct states, run finished after 3001 ms. (steps per millisecond=123 ) properties seen :0
[2024-05-31 21:00:51] [INFO ] Flow matrix only has 149 transitions (discarded 87 similar events)
// Phase 1: matrix 149 rows 93 cols
[2024-05-31 21:00:51] [INFO ] Computed 3 invariants in 0 ms
[2024-05-31 21:00:51] [INFO ] State equation strengthened by 25 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 95/149 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 60/209 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/219 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 21/240 variables, 19/115 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 2/242 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/242 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 121 constraints, problems are : Problem set: 0 solved, 4 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 47/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 95/149 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 60/209 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 21/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/209 variables, 4/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/209 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 10/219 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 21/240 variables, 19/119 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/240 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 2/242 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/242 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 125 constraints, problems are : Problem set: 0 solved, 4 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 349ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 3576 ms.
Support contains 7 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 236/236 transitions.
Applied a total of 0 rules in 4 ms. Remains 93 /93 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 93/93 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 236/236 transitions.
Applied a total of 0 rules in 15 ms. Remains 93 /93 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2024-05-31 21:00:55] [INFO ] Flow matrix only has 149 transitions (discarded 87 similar events)
[2024-05-31 21:00:55] [INFO ] Invariant cache hit.
[2024-05-31 21:00:55] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 21:00:55] [INFO ] Flow matrix only has 149 transitions (discarded 87 similar events)
[2024-05-31 21:00:55] [INFO ] Invariant cache hit.
[2024-05-31 21:00:55] [INFO ] State equation strengthened by 25 read => feed constraints.
[2024-05-31 21:00:55] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-31 21:00:55] [INFO ] Redundant transitions in 9 ms returned []
Running 234 sub problems to find dead transitions.
[2024-05-31 21:00:55] [INFO ] Flow matrix only has 149 transitions (discarded 87 similar events)
[2024-05-31 21:00:55] [INFO ] Invariant cache hit.
[2024-05-31 21:00:55] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 149/242 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 25/121 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 0/242 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 121 constraints, problems are : Problem set: 0 solved, 234 unsolved in 3756 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/93 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (OVERLAPS) 149/242 variables, 93/96 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 25/121 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 234/355 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/242 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 355 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6772 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 10692ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 10694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10934 ms. Remains : 93/93 places, 236/236 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 87 transitions
Reduce isomorphic transitions removed 87 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 93 transition count 146
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 93 place count 90 transition count 146
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 93 place count 90 transition count 128
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 129 place count 72 transition count 128
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 163 place count 55 transition count 111
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 170 place count 48 transition count 97
Iterating global reduction 2 with 7 rules applied. Total rules applied 177 place count 48 transition count 97
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 184 place count 41 transition count 83
Iterating global reduction 2 with 7 rules applied. Total rules applied 191 place count 41 transition count 83
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 197 place count 35 transition count 71
Iterating global reduction 2 with 6 rules applied. Total rules applied 203 place count 35 transition count 71
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 208 place count 35 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 212 place count 33 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 3 with 8 rules applied. Total rules applied 220 place count 33 transition count 59
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 221 place count 33 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 222 place count 32 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 223 place count 32 transition count 57
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 32 transition count 57
Applied a total of 224 rules in 28 ms. Remains 32 /93 variables (removed 61) and now considering 57/236 (removed 179) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 57 rows 32 cols
[2024-05-31 21:01:06] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 21:01:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:01:06] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-31 21:01:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 21:01:06] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-31 21:01:06] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:01:06] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-31 21:01:06] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-31 21:01:06] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 167 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA FunctionPointer-PT-b032-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:01:06] [INFO ] Flatten gal took : 24 ms
[2024-05-31 21:01:06] [INFO ] Flatten gal took : 24 ms
[2024-05-31 21:01:06] [INFO ] Input system was already deterministic with 498 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 1011 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Graph (complete) has 1011 edges and 187 vertex of which 185 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 167 transition count 432
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 53 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 156 transition count 392
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 79 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 86 place count 149 transition count 366
Iterating global reduction 2 with 7 rules applied. Total rules applied 93 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 100 place count 142 transition count 342
Iterating global reduction 2 with 7 rules applied. Total rules applied 107 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 114 place count 135 transition count 326
Iterating global reduction 2 with 7 rules applied. Total rules applied 121 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 128 place count 128 transition count 304
Iterating global reduction 2 with 7 rules applied. Total rules applied 135 place count 128 transition count 304
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 141 place count 122 transition count 288
Iterating global reduction 2 with 6 rules applied. Total rules applied 147 place count 122 transition count 288
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 153 place count 116 transition count 276
Iterating global reduction 2 with 6 rules applied. Total rules applied 159 place count 116 transition count 276
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 164 place count 111 transition count 266
Iterating global reduction 2 with 5 rules applied. Total rules applied 169 place count 111 transition count 266
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 172 place count 108 transition count 260
Iterating global reduction 2 with 3 rules applied. Total rules applied 175 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 178 place count 105 transition count 254
Iterating global reduction 2 with 3 rules applied. Total rules applied 181 place count 105 transition count 254
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 183 place count 103 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 185 place count 103 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 189 place count 103 transition count 246
Applied a total of 189 rules in 60 ms. Remains 103 /187 variables (removed 84) and now considering 246/498 (removed 252) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 103/187 places, 246/498 transitions.
[2024-05-31 21:01:06] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:06] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:06] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 87 place count 149 transition count 366
Iterating global reduction 3 with 7 rules applied. Total rules applied 94 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 142 transition count 342
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 135 transition count 326
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 128 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 143 place count 121 transition count 284
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 157 place count 114 transition count 270
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 108 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 104 transition count 250
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 100 transition count 242
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 97 transition count 236
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 97 transition count 236
Applied a total of 198 rules in 24 ms. Remains 97 /187 variables (removed 90) and now considering 236/498 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 97/187 places, 236/498 transitions.
[2024-05-31 21:01:06] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:01:06] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:06] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 186 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 169 transition count 434
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 169 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 51 place count 169 transition count 418
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 61 place count 159 transition count 396
Iterating global reduction 2 with 10 rules applied. Total rules applied 71 place count 159 transition count 396
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 159 transition count 392
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 154 transition count 374
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 154 transition count 374
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 149 transition count 358
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 149 transition count 358
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 144 transition count 346
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 144 transition count 346
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 109 place count 140 transition count 334
Iterating global reduction 3 with 4 rules applied. Total rules applied 113 place count 140 transition count 334
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 117 place count 136 transition count 324
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 136 transition count 324
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 125 place count 132 transition count 316
Iterating global reduction 3 with 4 rules applied. Total rules applied 129 place count 132 transition count 316
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 133 place count 128 transition count 308
Iterating global reduction 3 with 4 rules applied. Total rules applied 137 place count 128 transition count 308
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 126 transition count 304
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 126 transition count 304
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 143 place count 124 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 145 place count 124 transition count 300
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 146 place count 123 transition count 298
Iterating global reduction 3 with 1 rules applied. Total rules applied 147 place count 123 transition count 298
Applied a total of 147 rules in 27 ms. Remains 123 /187 variables (removed 64) and now considering 298/498 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 123/187 places, 298/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 11 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 87 place count 149 transition count 366
Iterating global reduction 3 with 7 rules applied. Total rules applied 94 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 142 transition count 342
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 135 transition count 326
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 128 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 143 place count 121 transition count 284
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 157 place count 114 transition count 270
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 108 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 104 transition count 250
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 100 transition count 242
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 97 transition count 236
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 97 transition count 236
Applied a total of 198 rules in 24 ms. Remains 97 /187 variables (removed 90) and now considering 236/498 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 97/187 places, 236/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 168 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 52 place count 168 transition count 418
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 158 transition count 398
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 158 transition count 398
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 158 transition count 394
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 82 place count 152 transition count 376
Iterating global reduction 3 with 6 rules applied. Total rules applied 88 place count 152 transition count 376
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 94 place count 146 transition count 354
Iterating global reduction 3 with 6 rules applied. Total rules applied 100 place count 146 transition count 354
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 106 place count 140 transition count 340
Iterating global reduction 3 with 6 rules applied. Total rules applied 112 place count 140 transition count 340
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 118 place count 134 transition count 320
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 134 transition count 320
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 130 place count 128 transition count 302
Iterating global reduction 3 with 6 rules applied. Total rules applied 136 place count 128 transition count 302
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 142 place count 122 transition count 290
Iterating global reduction 3 with 6 rules applied. Total rules applied 148 place count 122 transition count 290
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 154 place count 116 transition count 278
Iterating global reduction 3 with 6 rules applied. Total rules applied 160 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 164 place count 112 transition count 270
Iterating global reduction 3 with 4 rules applied. Total rules applied 168 place count 112 transition count 270
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 108 transition count 262
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 108 transition count 262
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 179 place count 105 transition count 256
Iterating global reduction 3 with 3 rules applied. Total rules applied 182 place count 105 transition count 256
Applied a total of 182 rules in 23 ms. Remains 105 /187 variables (removed 82) and now considering 256/498 (removed 242) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 105/187 places, 256/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Graph (complete) has 1011 edges and 187 vertex of which 186 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 171 transition count 438
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 171 transition count 438
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 45 place count 171 transition count 424
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 54 place count 162 transition count 404
Iterating global reduction 1 with 9 rules applied. Total rules applied 63 place count 162 transition count 404
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 67 place count 162 transition count 400
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 157 transition count 382
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 157 transition count 382
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 82 place count 152 transition count 366
Iterating global reduction 2 with 5 rules applied. Total rules applied 87 place count 152 transition count 366
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 92 place count 147 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 97 place count 147 transition count 354
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 102 place count 142 transition count 340
Iterating global reduction 2 with 5 rules applied. Total rules applied 107 place count 142 transition count 340
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 112 place count 137 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 117 place count 137 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 132 transition count 318
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 132 transition count 318
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 131 place count 128 transition count 310
Iterating global reduction 2 with 4 rules applied. Total rules applied 135 place count 128 transition count 310
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 137 place count 126 transition count 306
Iterating global reduction 2 with 2 rules applied. Total rules applied 139 place count 126 transition count 306
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 124 transition count 302
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 124 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 123 transition count 300
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 123 transition count 300
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 151 place count 123 transition count 294
Applied a total of 151 rules in 52 ms. Remains 123 /187 variables (removed 64) and now considering 294/498 (removed 204) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 123/187 places, 294/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 168 transition count 436
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 168 transition count 436
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 52 place count 168 transition count 420
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 62 place count 158 transition count 398
Iterating global reduction 2 with 10 rules applied. Total rules applied 72 place count 158 transition count 398
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 76 place count 158 transition count 394
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 81 place count 153 transition count 378
Iterating global reduction 3 with 5 rules applied. Total rules applied 86 place count 153 transition count 378
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 91 place count 148 transition count 360
Iterating global reduction 3 with 5 rules applied. Total rules applied 96 place count 148 transition count 360
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 101 place count 143 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 106 place count 143 transition count 350
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 111 place count 138 transition count 336
Iterating global reduction 3 with 5 rules applied. Total rules applied 116 place count 138 transition count 336
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 121 place count 133 transition count 322
Iterating global reduction 3 with 5 rules applied. Total rules applied 126 place count 133 transition count 322
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 131 place count 128 transition count 312
Iterating global reduction 3 with 5 rules applied. Total rules applied 136 place count 128 transition count 312
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 140 place count 124 transition count 304
Iterating global reduction 3 with 4 rules applied. Total rules applied 144 place count 124 transition count 304
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 146 place count 122 transition count 300
Iterating global reduction 3 with 2 rules applied. Total rules applied 148 place count 122 transition count 300
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 150 place count 120 transition count 296
Iterating global reduction 3 with 2 rules applied. Total rules applied 152 place count 120 transition count 296
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 153 place count 119 transition count 294
Iterating global reduction 3 with 1 rules applied. Total rules applied 154 place count 119 transition count 294
Applied a total of 154 rules in 23 ms. Remains 119 /187 variables (removed 68) and now considering 294/498 (removed 204) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 119/187 places, 294/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 294 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 86 place count 150 transition count 370
Iterating global reduction 3 with 6 rules applied. Total rules applied 92 place count 150 transition count 370
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 98 place count 144 transition count 350
Iterating global reduction 3 with 6 rules applied. Total rules applied 104 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 110 place count 138 transition count 336
Iterating global reduction 3 with 6 rules applied. Total rules applied 116 place count 138 transition count 336
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 122 place count 132 transition count 316
Iterating global reduction 3 with 6 rules applied. Total rules applied 128 place count 132 transition count 316
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 133 place count 127 transition count 300
Iterating global reduction 3 with 5 rules applied. Total rules applied 138 place count 127 transition count 300
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 141 place count 124 transition count 294
Iterating global reduction 3 with 3 rules applied. Total rules applied 144 place count 124 transition count 294
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 121 transition count 288
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 121 transition count 288
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 118 transition count 282
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 118 transition count 282
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 159 place count 115 transition count 276
Iterating global reduction 3 with 3 rules applied. Total rules applied 162 place count 115 transition count 276
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 113 transition count 272
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 113 transition count 272
Applied a total of 166 rules in 22 ms. Remains 113 /187 variables (removed 74) and now considering 272/498 (removed 226) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 113/187 places, 272/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 272 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 19 place count 168 transition count 434
Iterating global reduction 1 with 17 rules applied. Total rules applied 36 place count 168 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 52 place count 168 transition count 418
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 61 place count 159 transition count 400
Iterating global reduction 2 with 9 rules applied. Total rules applied 70 place count 159 transition count 400
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 74 place count 159 transition count 396
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 79 place count 154 transition count 380
Iterating global reduction 3 with 5 rules applied. Total rules applied 84 place count 154 transition count 380
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 89 place count 149 transition count 362
Iterating global reduction 3 with 5 rules applied. Total rules applied 94 place count 149 transition count 362
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 99 place count 144 transition count 350
Iterating global reduction 3 with 5 rules applied. Total rules applied 104 place count 144 transition count 350
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 139 transition count 334
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 139 transition count 334
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 119 place count 134 transition count 320
Iterating global reduction 3 with 5 rules applied. Total rules applied 124 place count 134 transition count 320
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 129 place count 129 transition count 310
Iterating global reduction 3 with 5 rules applied. Total rules applied 134 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 139 place count 124 transition count 300
Iterating global reduction 3 with 5 rules applied. Total rules applied 144 place count 124 transition count 300
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 147 place count 121 transition count 294
Iterating global reduction 3 with 3 rules applied. Total rules applied 150 place count 121 transition count 294
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 153 place count 118 transition count 288
Iterating global reduction 3 with 3 rules applied. Total rules applied 156 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 158 place count 116 transition count 284
Iterating global reduction 3 with 2 rules applied. Total rules applied 160 place count 116 transition count 284
Applied a total of 160 rules in 23 ms. Remains 116 /187 variables (removed 71) and now considering 284/498 (removed 214) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 116/187 places, 284/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 9 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 20 place count 167 transition count 432
Iterating global reduction 1 with 18 rules applied. Total rules applied 38 place count 167 transition count 432
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 54 place count 167 transition count 416
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 65 place count 156 transition count 392
Iterating global reduction 2 with 11 rules applied. Total rules applied 76 place count 156 transition count 392
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 80 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 87 place count 149 transition count 366
Iterating global reduction 3 with 7 rules applied. Total rules applied 94 place count 149 transition count 366
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 101 place count 142 transition count 342
Iterating global reduction 3 with 7 rules applied. Total rules applied 108 place count 142 transition count 342
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 115 place count 135 transition count 326
Iterating global reduction 3 with 7 rules applied. Total rules applied 122 place count 135 transition count 326
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 129 place count 128 transition count 304
Iterating global reduction 3 with 7 rules applied. Total rules applied 136 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 143 place count 121 transition count 284
Iterating global reduction 3 with 7 rules applied. Total rules applied 150 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 157 place count 114 transition count 270
Iterating global reduction 3 with 7 rules applied. Total rules applied 164 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 170 place count 108 transition count 258
Iterating global reduction 3 with 6 rules applied. Total rules applied 176 place count 108 transition count 258
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 180 place count 104 transition count 250
Iterating global reduction 3 with 4 rules applied. Total rules applied 184 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 188 place count 100 transition count 242
Iterating global reduction 3 with 4 rules applied. Total rules applied 192 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 195 place count 97 transition count 236
Iterating global reduction 3 with 3 rules applied. Total rules applied 198 place count 97 transition count 236
Applied a total of 198 rules in 22 ms. Remains 97 /187 variables (removed 90) and now considering 236/498 (removed 262) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 97/187 places, 236/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 8 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 18 place count 169 transition count 438
Iterating global reduction 1 with 16 rules applied. Total rules applied 34 place count 169 transition count 438
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 48 place count 169 transition count 424
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 162 transition count 410
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 162 transition count 410
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 157 transition count 394
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 157 transition count 394
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 152 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 152 transition count 376
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 147 transition count 364
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 147 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 142 transition count 348
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 142 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 137 transition count 334
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 137 transition count 334
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 117 place count 132 transition count 324
Iterating global reduction 2 with 5 rules applied. Total rules applied 122 place count 132 transition count 324
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 127 place count 127 transition count 314
Iterating global reduction 2 with 5 rules applied. Total rules applied 132 place count 127 transition count 314
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 135 place count 124 transition count 308
Iterating global reduction 2 with 3 rules applied. Total rules applied 138 place count 124 transition count 308
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 141 place count 121 transition count 302
Iterating global reduction 2 with 3 rules applied. Total rules applied 144 place count 121 transition count 302
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 146 place count 119 transition count 298
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 119 transition count 298
Applied a total of 148 rules in 25 ms. Remains 119 /187 variables (removed 68) and now considering 298/498 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 119/187 places, 298/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 498/498 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 498
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 16 place count 171 transition count 448
Iterating global reduction 1 with 14 rules applied. Total rules applied 30 place count 171 transition count 448
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 44 place count 171 transition count 434
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 52 place count 163 transition count 416
Iterating global reduction 2 with 8 rules applied. Total rules applied 60 place count 163 transition count 416
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 163 transition count 408
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 159 transition count 396
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 159 transition count 396
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 80 place count 155 transition count 382
Iterating global reduction 3 with 4 rules applied. Total rules applied 84 place count 155 transition count 382
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 88 place count 151 transition count 374
Iterating global reduction 3 with 4 rules applied. Total rules applied 92 place count 151 transition count 374
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 148 transition count 366
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 148 transition count 366
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 101 place count 145 transition count 358
Iterating global reduction 3 with 3 rules applied. Total rules applied 104 place count 145 transition count 358
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 107 place count 142 transition count 352
Iterating global reduction 3 with 3 rules applied. Total rules applied 110 place count 142 transition count 352
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 111 place count 141 transition count 350
Iterating global reduction 3 with 1 rules applied. Total rules applied 112 place count 141 transition count 350
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 113 place count 140 transition count 348
Iterating global reduction 3 with 1 rules applied. Total rules applied 114 place count 140 transition count 348
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 115 place count 139 transition count 346
Iterating global reduction 3 with 1 rules applied. Total rules applied 116 place count 139 transition count 346
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 117 place count 138 transition count 344
Iterating global reduction 3 with 1 rules applied. Total rules applied 118 place count 138 transition count 344
Applied a total of 118 rules in 26 ms. Remains 138 /187 variables (removed 49) and now considering 344/498 (removed 154) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 138/187 places, 344/498 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 10 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 12 ms
[2024-05-31 21:01:07] [INFO ] Input system was already deterministic with 344 transitions.
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 17 ms
[2024-05-31 21:01:07] [INFO ] Flatten gal took : 16 ms
[2024-05-31 21:01:07] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-31 21:01:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 187 places, 498 transitions and 2004 arcs took 5 ms.
Total runtime 140526 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-00
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-01
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-02
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-04
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-06
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-07
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-08
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-09
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-10
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2024-11
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2023-14
Could not compute solution for formula : FunctionPointer-PT-b032-CTLCardinality-2023-15

BK_STOP 1717189268091

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/579/ctl_0_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/579/ctl_1_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/579/ctl_2_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/579/ctl_3_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/579/ctl_4_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/579/ctl_5_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/579/ctl_6_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/579/ctl_7_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/579/ctl_8_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/579/ctl_9_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/579/ctl_10_
ctl formula name FunctionPointer-PT-b032-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/579/ctl_11_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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