Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601100251.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is FunctionPointer-PT-b032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601100251
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-b032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716432582118

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:49:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:49:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:49:43] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-23 02:49:43] [INFO ] Transformed 306 places.
[2024-05-23 02:49:43] [INFO ] Transformed 840 transitions.
[2024-05-23 02:49:43] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FunctionPointer-PT-b032-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 213 transition count 648
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 31 place count 191 transition count 512
Iterating global reduction 1 with 22 rules applied. Total rules applied 53 place count 191 transition count 512
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 85 place count 191 transition count 480
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 180 transition count 458
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 180 transition count 458
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 115 place count 180 transition count 450
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 119 place count 176 transition count 442
Iterating global reduction 3 with 4 rules applied. Total rules applied 123 place count 176 transition count 442
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 127 place count 172 transition count 426
Iterating global reduction 3 with 4 rules applied. Total rules applied 131 place count 172 transition count 426
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 135 place count 168 transition count 418
Iterating global reduction 3 with 4 rules applied. Total rules applied 139 place count 168 transition count 418
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 141 place count 166 transition count 410
Iterating global reduction 3 with 2 rules applied. Total rules applied 143 place count 166 transition count 410
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 145 place count 164 transition count 402
Iterating global reduction 3 with 2 rules applied. Total rules applied 147 place count 164 transition count 402
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 148 place count 163 transition count 400
Iterating global reduction 3 with 1 rules applied. Total rules applied 149 place count 163 transition count 400
Applied a total of 149 rules in 94 ms. Remains 163 /222 variables (removed 59) and now considering 400/648 (removed 248) transitions.
[2024-05-23 02:49:43] [INFO ] Flow matrix only has 277 transitions (discarded 123 similar events)
// Phase 1: matrix 277 rows 163 cols
[2024-05-23 02:49:43] [INFO ] Computed 3 invariants in 16 ms
[2024-05-23 02:49:43] [INFO ] Implicit Places using invariants in 244 ms returned []
[2024-05-23 02:49:43] [INFO ] Flow matrix only has 277 transitions (discarded 123 similar events)
[2024-05-23 02:49:43] [INFO ] Invariant cache hit.
[2024-05-23 02:49:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-05-23 02:49:44] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2024-05-23 02:49:44] [INFO ] Flow matrix only has 277 transitions (discarded 123 similar events)
[2024-05-23 02:49:44] [INFO ] Invariant cache hit.
[2024-05-23 02:49:44] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 277/440 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (OVERLAPS) 0/440 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 440/440 variables, and 227 constraints, problems are : Problem set: 0 solved, 398 unsolved in 14460 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/162 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/162 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/163 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/163 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (OVERLAPS) 277/440 variables, 163/166 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 61/227 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 398/625 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 0/440 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Int declared 440/440 variables, and 625 constraints, problems are : Problem set: 0 solved, 398 unsolved in 17884 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
After SMT, in 32962ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 32979ms
Starting structural reductions in LTL mode, iteration 1 : 163/222 places, 400/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33616 ms. Remains : 163/222 places, 400/648 transitions.
Support contains 28 out of 163 places after structural reductions.
[2024-05-23 02:50:17] [INFO ] Flatten gal took : 52 ms
[2024-05-23 02:50:17] [INFO ] Flatten gal took : 36 ms
[2024-05-23 02:50:17] [INFO ] Input system was already deterministic with 400 transitions.
RANDOM walk for 40014 steps (30 resets) in 856 ms. (46 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40004 steps (25 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (20 resets) in 102 ms. (388 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (23 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
[2024-05-23 02:50:18] [INFO ] Flow matrix only has 277 transitions (discarded 123 similar events)
[2024-05-23 02:50:18] [INFO ] Invariant cache hit.
[2024-05-23 02:50:18] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 29/440 variables, and 1 constraints, problems are : Problem set: 3 solved, 0 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 1/3 constraints, State Equation: 0/163 constraints, ReadFeed: 0/61 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 103ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 9 simplifications.
FORMULA FunctionPointer-PT-b032-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 stable transitions
Graph (complete) has 875 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U X(p2))) U p1)||F(G(!p2))))'
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 400
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 154 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 21 place count 154 transition count 378
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 27 place count 148 transition count 364
Iterating global reduction 2 with 6 rules applied. Total rules applied 33 place count 148 transition count 364
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 38 place count 143 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 43 place count 143 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 48 place count 138 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 53 place count 138 transition count 336
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 134 transition count 328
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 65 place count 130 transition count 314
Iterating global reduction 2 with 4 rules applied. Total rules applied 69 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 73 place count 126 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 77 place count 126 transition count 300
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 123 transition count 294
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 123 transition count 294
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 120 transition count 288
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 117 transition count 282
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 114 transition count 276
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 111 transition count 270
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 111 transition count 270
Applied a total of 107 rules in 30 ms. Remains 111 /163 variables (removed 52) and now considering 270/400 (removed 130) transitions.
[2024-05-23 02:50:18] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
// Phase 1: matrix 186 rows 111 cols
[2024-05-23 02:50:18] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:50:18] [INFO ] Implicit Places using invariants in 235 ms returned []
[2024-05-23 02:50:18] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:50:18] [INFO ] Invariant cache hit.
[2024-05-23 02:50:18] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:50:18] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 02:50:18] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:50:18] [INFO ] Invariant cache hit.
[2024-05-23 02:50:18] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 268/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 426 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8594 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16085ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16090ms
Starting structural reductions in LTL mode, iteration 1 : 111/163 places, 270/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16521 ms. Remains : 111/163 places, 270/400 transitions.
Stuttering acceptance computed with spot in 285 ms :[(AND (NOT p1) p2), false, false, p2, false]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-00
Product exploration explored 100000 steps with 33450 reset in 353 ms.
Product exploration explored 100000 steps with 33354 reset in 217 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 107 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p2), false, false, p2, false]
RANDOM walk for 40066 steps (21 resets) in 149 ms. (267 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (26 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (28 resets) in 53 ms. (740 steps per ms) remains 2/2 properties
[2024-05-23 02:50:36] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:50:36] [INFO ] Invariant cache hit.
[2024-05-23 02:50:36] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/170 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 65/235 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/289 variables, 27/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/297 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 2 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 9/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 109/170 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 65/235 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 2/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/289 variables, 27/144 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 8/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 8/297 variables, 8/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/297 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/297 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 160 constraints, problems are : Problem set: 0 solved, 2 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 157 ms.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 270/270 transitions.
Graph (complete) has 451 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 87 transition count 218
Applied a total of 53 rules in 44 ms. Remains 87 /111 variables (removed 24) and now considering 218/270 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 87/111 places, 218/270 transitions.
RANDOM walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/2 properties
[2024-05-23 02:50:36] [INFO ] Flow matrix only has 138 transitions (discarded 80 similar events)
// Phase 1: matrix 138 rows 87 cols
[2024-05-23 02:50:36] [INFO ] Computed 3 invariants in 0 ms
[2024-05-23 02:50:36] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/185 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/218 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/225 variables, 6/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/225 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 225/225 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 120/185 variables, 65/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 33/218 variables, 16/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/225 variables, 6/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/225 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/225 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 225/225 variables, and 114 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 87/87 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 421ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 5 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 87 /87 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 87/87 places, 218/218 transitions.
RANDOM walk for 30943 steps (6 resets) in 84 ms. (364 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F p1), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 22 factoid took 466 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p2), false, false, p2, false]
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p1) p2), false, false, p2, false]
[2024-05-23 02:50:38] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
// Phase 1: matrix 186 rows 111 cols
[2024-05-23 02:50:38] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:50:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-23 02:50:38] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-23 02:50:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:50:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:50:38] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-23 02:50:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:50:38] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:50:38] [INFO ] Computed and/alt/rep : 46/90/42 causal constraints (skipped 142 transitions) in 25 ms.
[2024-05-23 02:50:38] [INFO ] Added : 4 causal constraints over 1 iterations in 70 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-23 02:50:38] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:50:38] [INFO ] Invariant cache hit.
[2024-05-23 02:50:38] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 02:50:38] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:50:38] [INFO ] Invariant cache hit.
[2024-05-23 02:50:38] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:50:38] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 02:50:38] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:50:38] [INFO ] Invariant cache hit.
[2024-05-23 02:50:38] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7299 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 268/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 426 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8625 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16135ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16139ms
Finished structural reductions in LTL mode , in 1 iterations and 16375 ms. Remains : 111/111 places, 270/270 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 111 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) p2), false, false, p2, false]
RANDOM walk for 36010 steps (27 resets) in 77 ms. (461 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F p1), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 22 factoid took 354 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) p2), false, false, p2, false]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p1) p2), false, false, p2, false]
[2024-05-23 02:50:55] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:50:55] [INFO ] Invariant cache hit.
[2024-05-23 02:50:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:50:56] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-23 02:50:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:50:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:50:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:50:56] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-23 02:50:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:50:56] [INFO ] [Nat]Added 45 Read/Feed constraints in 8 ms returned sat
[2024-05-23 02:50:56] [INFO ] Computed and/alt/rep : 46/90/42 causal constraints (skipped 142 transitions) in 15 ms.
[2024-05-23 02:50:56] [INFO ] Added : 4 causal constraints over 1 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) p2), false, false, p2, false]
Product exploration explored 100000 steps with 33411 reset in 151 ms.
Product exploration explored 100000 steps with 33247 reset in 165 ms.
Applying partial POR strategy [false, true, false, true, false]
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) p2), false, false, p2, false]
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 268
Applied a total of 2 rules in 22 ms. Remains 111 /111 variables (removed 0) and now considering 268/270 (removed 2) transitions.
[2024-05-23 02:50:57] [INFO ] Redundant transitions in 10 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-23 02:50:57] [INFO ] Flow matrix only has 185 transitions (discarded 83 similar events)
// Phase 1: matrix 185 rows 111 cols
[2024-05-23 02:50:57] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:50:57] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 185/296 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 6972 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 185/296 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 424 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 16021ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 16024ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 268/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16062 ms. Remains : 111/111 places, 268/270 transitions.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-23 02:51:13] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
// Phase 1: matrix 186 rows 111 cols
[2024-05-23 02:51:13] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:51:13] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 02:51:13] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:51:13] [INFO ] Invariant cache hit.
[2024-05-23 02:51:13] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:51:13] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 02:51:13] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:51:13] [INFO ] Invariant cache hit.
[2024-05-23 02:51:13] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7064 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 268/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 426 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 15922ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 15924ms
Finished structural reductions in LTL mode , in 1 iterations and 16156 ms. Remains : 111/111 places, 270/270 transitions.
Treatment of property FunctionPointer-PT-b032-LTLCardinality-00 finished in 71150 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 400
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 151 transition count 374
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 151 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 29 place count 151 transition count 368
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 37 place count 143 transition count 348
Iterating global reduction 2 with 8 rules applied. Total rules applied 45 place count 143 transition count 348
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 52 place count 136 transition count 332
Iterating global reduction 2 with 7 rules applied. Total rules applied 59 place count 136 transition count 332
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 66 place count 129 transition count 312
Iterating global reduction 2 with 7 rules applied. Total rules applied 73 place count 129 transition count 312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 79 place count 123 transition count 300
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 123 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 90 place count 118 transition count 284
Iterating global reduction 2 with 5 rules applied. Total rules applied 95 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 100 place count 113 transition count 268
Iterating global reduction 2 with 5 rules applied. Total rules applied 105 place count 113 transition count 268
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 109 place count 109 transition count 260
Iterating global reduction 2 with 4 rules applied. Total rules applied 113 place count 109 transition count 260
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 116 place count 106 transition count 254
Iterating global reduction 2 with 3 rules applied. Total rules applied 119 place count 106 transition count 254
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 103 transition count 248
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 128 place count 100 transition count 242
Iterating global reduction 2 with 3 rules applied. Total rules applied 131 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 97 transition count 236
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 97 transition count 236
Applied a total of 137 rules in 28 ms. Remains 97 /163 variables (removed 66) and now considering 236/400 (removed 164) transitions.
[2024-05-23 02:51:29] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-23 02:51:29] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:51:29] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 02:51:29] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:51:29] [INFO ] Invariant cache hit.
[2024-05-23 02:51:29] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:51:29] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-23 02:51:29] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:51:29] [INFO ] Invariant cache hit.
[2024-05-23 02:51:29] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5889 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 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/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12995ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12998ms
Starting structural reductions in LTL mode, iteration 1 : 97/163 places, 236/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13347 ms. Remains : 97/163 places, 236/400 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-02
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 2 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-02 finished in 13484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(p1)&&F(p2))))'
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 400
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 153 transition count 378
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 153 transition count 378
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 153 transition count 372
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 147 transition count 356
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 147 transition count 356
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 41 place count 143 transition count 346
Iterating global reduction 2 with 4 rules applied. Total rules applied 45 place count 143 transition count 346
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 49 place count 139 transition count 334
Iterating global reduction 2 with 4 rules applied. Total rules applied 53 place count 139 transition count 334
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 135 transition count 326
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 135 transition count 326
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 64 place count 132 transition count 316
Iterating global reduction 2 with 3 rules applied. Total rules applied 67 place count 132 transition count 316
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 70 place count 129 transition count 306
Iterating global reduction 2 with 3 rules applied. Total rules applied 73 place count 129 transition count 306
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 76 place count 126 transition count 300
Iterating global reduction 2 with 3 rules applied. Total rules applied 79 place count 126 transition count 300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 81 place count 124 transition count 296
Iterating global reduction 2 with 2 rules applied. Total rules applied 83 place count 124 transition count 296
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 122 transition count 292
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 122 transition count 292
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 120 transition count 288
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 120 transition count 288
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 118 transition count 284
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 118 transition count 284
Applied a total of 95 rules in 31 ms. Remains 118 /163 variables (removed 45) and now considering 284/400 (removed 116) transitions.
[2024-05-23 02:51:43] [INFO ] Flow matrix only has 197 transitions (discarded 87 similar events)
// Phase 1: matrix 197 rows 118 cols
[2024-05-23 02:51:43] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 02:51:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 02:51:43] [INFO ] Flow matrix only has 197 transitions (discarded 87 similar events)
[2024-05-23 02:51:43] [INFO ] Invariant cache hit.
[2024-05-23 02:51:43] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-23 02:51:43] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-23 02:51:43] [INFO ] Flow matrix only has 197 transitions (discarded 87 similar events)
[2024-05-23 02:51:43] [INFO ] Invariant cache hit.
[2024-05-23 02:51:43] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 197/315 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 47/167 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 0/315 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 315/315 variables, and 167 constraints, problems are : Problem set: 0 solved, 282 unsolved in 7809 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 282 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/118 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 197/315 variables, 118/120 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 47/167 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 282/449 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/315 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/315 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 315/315 variables, and 449 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9282 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 118/118 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
After SMT, in 17314ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 17317ms
Starting structural reductions in LTL mode, iteration 1 : 118/163 places, 284/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17576 ms. Remains : 118/163 places, 284/400 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-03
Stuttering criterion allowed to conclude after 138 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-03 finished in 17745 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Graph (complete) has 875 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 152 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 152 transition count 378
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 29 place count 152 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 36 place count 145 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 145 transition count 352
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 50 place count 138 transition count 336
Iterating global reduction 1 with 7 rules applied. Total rules applied 57 place count 138 transition count 336
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 64 place count 131 transition count 316
Iterating global reduction 1 with 7 rules applied. Total rules applied 71 place count 131 transition count 316
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 77 place count 125 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 83 place count 125 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 87 place count 121 transition count 292
Iterating global reduction 1 with 4 rules applied. Total rules applied 91 place count 121 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 95 place count 117 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 99 place count 117 transition count 280
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 102 place count 114 transition count 274
Iterating global reduction 1 with 3 rules applied. Total rules applied 105 place count 114 transition count 274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 107 place count 112 transition count 270
Iterating global reduction 1 with 2 rules applied. Total rules applied 109 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 111 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 113 place count 110 transition count 266
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 115 place count 108 transition count 262
Iterating global reduction 1 with 2 rules applied. Total rules applied 117 place count 108 transition count 262
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 119 place count 106 transition count 258
Iterating global reduction 1 with 2 rules applied. Total rules applied 121 place count 106 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 125 place count 106 transition count 254
Applied a total of 125 rules in 62 ms. Remains 106 /163 variables (removed 57) and now considering 254/400 (removed 146) transitions.
[2024-05-23 02:52:00] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-23 02:52:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:52:00] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-23 02:52:00] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:52:00] [INFO ] Invariant cache hit.
[2024-05-23 02:52:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:52:01] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-23 02:52:01] [INFO ] Redundant transitions in 4 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-23 02:52:01] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:52:01] [INFO ] Invariant cache hit.
[2024-05-23 02:52:01] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (OVERLAPS) 0/278 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 400 constraints, problems are : Problem set: 0 solved, 252 unsolved in 7946 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints]
After SMT, in 14501ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 14504ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/163 places, 254/400 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14909 ms. Remains : 106/163 places, 254/400 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-05
Stuttering criterion allowed to conclude after 454 steps with 1 reset in 5 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-05 finished in 14976 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(G(p1)))))))'
Support contains 2 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 152 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 152 transition count 374
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 152 transition count 368
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 144 transition count 348
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 144 transition count 348
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 137 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 137 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 130 transition count 312
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 130 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 124 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 124 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 119 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 119 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 114 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 114 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 111 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 111 transition count 262
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 108 transition count 256
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 108 transition count 256
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 105 transition count 250
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 105 transition count 250
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 102 transition count 244
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 102 transition count 244
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 131 place count 99 transition count 238
Iterating global reduction 1 with 3 rules applied. Total rules applied 134 place count 99 transition count 238
Applied a total of 134 rules in 31 ms. Remains 99 /163 variables (removed 64) and now considering 238/400 (removed 162) transitions.
[2024-05-23 02:52:15] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
// Phase 1: matrix 162 rows 99 cols
[2024-05-23 02:52:15] [INFO ] Computed 3 invariants in 3 ms
[2024-05-23 02:52:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 02:52:15] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-23 02:52:15] [INFO ] Invariant cache hit.
[2024-05-23 02:52:15] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 02:52:15] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-23 02:52:15] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-23 02:52:15] [INFO ] Invariant cache hit.
[2024-05-23 02:52:15] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 162/261 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/261 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 261/261 variables, and 141 constraints, problems are : Problem set: 0 solved, 236 unsolved in 4894 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (OVERLAPS) 162/261 variables, 99/102 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 39/141 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 236/377 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/261 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 8 (OVERLAPS) 0/261 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 261/261 variables, and 377 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7345 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 12423ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 12427ms
Starting structural reductions in LTL mode, iteration 1 : 99/163 places, 238/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12662 ms. Remains : 99/163 places, 238/400 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 59 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-07 finished in 12870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(F(p2))))'
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 400
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 153 transition count 378
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 153 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 153 transition count 376
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 28 place count 146 transition count 358
Iterating global reduction 2 with 7 rules applied. Total rules applied 35 place count 146 transition count 358
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 41 place count 140 transition count 344
Iterating global reduction 2 with 6 rules applied. Total rules applied 47 place count 140 transition count 344
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 52 place count 135 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 57 place count 135 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 62 place count 130 transition count 318
Iterating global reduction 2 with 5 rules applied. Total rules applied 67 place count 130 transition count 318
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 72 place count 125 transition count 302
Iterating global reduction 2 with 5 rules applied. Total rules applied 77 place count 125 transition count 302
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 81 place count 121 transition count 290
Iterating global reduction 2 with 4 rules applied. Total rules applied 85 place count 121 transition count 290
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 118 transition count 284
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 118 transition count 284
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 116 transition count 280
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 116 transition count 280
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 114 transition count 276
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 114 transition count 276
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 101 place count 112 transition count 272
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 112 transition count 272
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 110 transition count 268
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 110 transition count 268
Applied a total of 107 rules in 18 ms. Remains 110 /163 variables (removed 53) and now considering 268/400 (removed 132) transitions.
[2024-05-23 02:52:28] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
// Phase 1: matrix 184 rows 110 cols
[2024-05-23 02:52:28] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:52:28] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 02:52:28] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2024-05-23 02:52:28] [INFO ] Invariant cache hit.
[2024-05-23 02:52:28] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:52:28] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-05-23 02:52:28] [INFO ] Flow matrix only has 184 transitions (discarded 84 similar events)
[2024-05-23 02:52:28] [INFO ] Invariant cache hit.
[2024-05-23 02:52:28] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/294 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 45/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 157 constraints, problems are : Problem set: 0 solved, 266 unsolved in 7015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 184/294 variables, 110/112 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 45/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 266/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 423 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 110/110 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 15736ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 15739ms
Starting structural reductions in LTL mode, iteration 1 : 110/163 places, 268/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15970 ms. Remains : 110/163 places, 268/400 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-08
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p2), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 17 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b032-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b032-LTLCardinality-08 finished in 16477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||G(p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 400
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 152 transition count 376
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 152 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 27 place count 152 transition count 370
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 34 place count 145 transition count 352
Iterating global reduction 2 with 7 rules applied. Total rules applied 41 place count 145 transition count 352
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 47 place count 139 transition count 338
Iterating global reduction 2 with 6 rules applied. Total rules applied 53 place count 139 transition count 338
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 59 place count 133 transition count 322
Iterating global reduction 2 with 6 rules applied. Total rules applied 65 place count 133 transition count 322
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 70 place count 128 transition count 312
Iterating global reduction 2 with 5 rules applied. Total rules applied 75 place count 128 transition count 312
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 79 place count 124 transition count 300
Iterating global reduction 2 with 4 rules applied. Total rules applied 83 place count 124 transition count 300
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 87 place count 120 transition count 288
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 94 place count 117 transition count 282
Iterating global reduction 2 with 3 rules applied. Total rules applied 97 place count 117 transition count 282
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 99 place count 115 transition count 278
Iterating global reduction 2 with 2 rules applied. Total rules applied 101 place count 115 transition count 278
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 103 place count 113 transition count 274
Iterating global reduction 2 with 2 rules applied. Total rules applied 105 place count 113 transition count 274
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 111 transition count 270
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 111 transition count 270
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 109 transition count 266
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 109 transition count 266
Applied a total of 113 rules in 18 ms. Remains 109 /163 variables (removed 54) and now considering 266/400 (removed 134) transitions.
[2024-05-23 02:52:45] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
// Phase 1: matrix 181 rows 109 cols
[2024-05-23 02:52:45] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:52:45] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 02:52:45] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2024-05-23 02:52:45] [INFO ] Invariant cache hit.
[2024-05-23 02:52:45] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-23 02:52:45] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2024-05-23 02:52:45] [INFO ] Flow matrix only has 181 transitions (discarded 85 similar events)
[2024-05-23 02:52:45] [INFO ] Invariant cache hit.
[2024-05-23 02:52:45] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/290 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (OVERLAPS) 0/290 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Real declared 290/290 variables, and 152 constraints, problems are : Problem set: 0 solved, 264 unsolved in 6989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 264 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (OVERLAPS) 181/290 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 41/152 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 264/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 7 (OVERLAPS) 0/290 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 264 unsolved
No progress, stopping.
After SMT solving in domain Int declared 290/290 variables, and 416 constraints, problems are : Problem set: 0 solved, 264 unsolved in 8347 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 0/0 constraints]
After SMT, in 15526ms problems are : Problem set: 0 solved, 264 unsolved
Search for dead transitions found 0 dead transitions in 15529ms
Starting structural reductions in LTL mode, iteration 1 : 109/163 places, 266/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15763 ms. Remains : 109/163 places, 266/400 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 239 steps with 4 reset in 2 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-09 finished in 15928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 3 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 162 transition count 400
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 153 transition count 380
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 153 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 25 place count 153 transition count 374
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 147 transition count 362
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 147 transition count 362
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 42 place count 142 transition count 352
Iterating global reduction 2 with 5 rules applied. Total rules applied 47 place count 142 transition count 352
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 52 place count 137 transition count 336
Iterating global reduction 2 with 5 rules applied. Total rules applied 57 place count 137 transition count 336
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 133 transition count 328
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 133 transition count 328
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 68 place count 130 transition count 316
Iterating global reduction 2 with 3 rules applied. Total rules applied 71 place count 130 transition count 316
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 74 place count 127 transition count 304
Iterating global reduction 2 with 3 rules applied. Total rules applied 77 place count 127 transition count 304
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 80 place count 124 transition count 298
Iterating global reduction 2 with 3 rules applied. Total rules applied 83 place count 124 transition count 298
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 121 transition count 292
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 121 transition count 292
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 92 place count 118 transition count 286
Iterating global reduction 2 with 3 rules applied. Total rules applied 95 place count 118 transition count 286
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 98 place count 115 transition count 280
Iterating global reduction 2 with 3 rules applied. Total rules applied 101 place count 115 transition count 280
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 104 place count 112 transition count 274
Iterating global reduction 2 with 3 rules applied. Total rules applied 107 place count 112 transition count 274
Applied a total of 107 rules in 21 ms. Remains 112 /163 variables (removed 51) and now considering 274/400 (removed 126) transitions.
[2024-05-23 02:53:00] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
// Phase 1: matrix 186 rows 112 cols
[2024-05-23 02:53:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:53:01] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 02:53:01] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2024-05-23 02:53:01] [INFO ] Invariant cache hit.
[2024-05-23 02:53:01] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:53:01] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 272 sub problems to find dead transitions.
[2024-05-23 02:53:01] [INFO ] Flow matrix only has 186 transitions (discarded 88 similar events)
[2024-05-23 02:53:01] [INFO ] Invariant cache hit.
[2024-05-23 02:53:01] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (OVERLAPS) 0/298 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Real declared 298/298 variables, and 157 constraints, problems are : Problem set: 0 solved, 272 unsolved in 7293 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 272 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 3 (OVERLAPS) 186/298 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 272/429 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 7 (OVERLAPS) 0/298 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 272 unsolved
No progress, stopping.
After SMT solving in domain Int declared 298/298 variables, and 429 constraints, problems are : Problem set: 0 solved, 272 unsolved in 9924 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 0/0 constraints]
After SMT, in 17422ms problems are : Problem set: 0 solved, 272 unsolved
Search for dead transitions found 0 dead transitions in 17424ms
Starting structural reductions in LTL mode, iteration 1 : 112/163 places, 274/400 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17657 ms. Remains : 112/163 places, 274/400 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-11
Stuttering criterion allowed to conclude after 299 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-b032-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLCardinality-11 finished in 17799 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0 U (p1 U X(p2))) U p1)||F(G(!p2))))'
Found a Lengthening insensitive property : FunctionPointer-PT-b032-LTLCardinality-00
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p1) p2), false, false, p2, false]
Support contains 5 out of 163 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 163/163 places, 400/400 transitions.
Graph (complete) has 875 edges and 163 vertex of which 162 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 9 place count 154 transition count 382
Iterating global reduction 0 with 8 rules applied. Total rules applied 17 place count 154 transition count 382
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 21 place count 154 transition count 378
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 27 place count 148 transition count 364
Iterating global reduction 1 with 6 rules applied. Total rules applied 33 place count 148 transition count 364
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 143 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 143 transition count 352
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 138 transition count 336
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 138 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 134 transition count 328
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 134 transition count 328
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 65 place count 130 transition count 314
Iterating global reduction 1 with 4 rules applied. Total rules applied 69 place count 130 transition count 314
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 73 place count 126 transition count 300
Iterating global reduction 1 with 4 rules applied. Total rules applied 77 place count 126 transition count 300
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 80 place count 123 transition count 294
Iterating global reduction 1 with 3 rules applied. Total rules applied 83 place count 123 transition count 294
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 86 place count 120 transition count 288
Iterating global reduction 1 with 3 rules applied. Total rules applied 89 place count 120 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 117 transition count 282
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 117 transition count 282
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 114 transition count 276
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 114 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 111 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 111 transition count 270
Applied a total of 107 rules in 39 ms. Remains 111 /163 variables (removed 52) and now considering 270/400 (removed 130) transitions.
[2024-05-23 02:53:19] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
// Phase 1: matrix 186 rows 111 cols
[2024-05-23 02:53:19] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:53:19] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-23 02:53:19] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:19] [INFO ] Invariant cache hit.
[2024-05-23 02:53:19] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:53:19] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 02:53:19] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:19] [INFO ] Invariant cache hit.
[2024-05-23 02:53:19] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 268 unsolved in 6937 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 268/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 426 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8952 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16098ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16101ms
Starting structural reductions in LI_LTL mode, iteration 1 : 111/163 places, 270/400 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16353 ms. Remains : 111/163 places, 270/400 transitions.
Running random walk in product with property : FunctionPointer-PT-b032-LTLCardinality-00
Product exploration explored 100000 steps with 33271 reset in 159 ms.
Product exploration explored 100000 steps with 33315 reset in 163 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 131 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) p2), false, false, p2, false]
RANDOM walk for 40061 steps (26 resets) in 93 ms. (426 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (28 resets) in 35 ms. (1111 steps per ms) remains 1/2 properties
[2024-05-23 02:53:36] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:36] [INFO ] Invariant cache hit.
[2024-05-23 02:53:36] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 109/170 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/235 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/289 variables, 27/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/297 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 109/170 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/235 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 54/289 variables, 27/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/297 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/297 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/297 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 182ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 270/270 transitions.
Graph (complete) has 451 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 87 transition count 218
Applied a total of 53 rules in 10 ms. Remains 87 /111 variables (removed 24) and now considering 218/270 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 87/111 places, 218/270 transitions.
RANDOM walk for 30265 steps (6 resets) in 53 ms. (560 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p2)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p2)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p2)))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F p1), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 22 factoid took 404 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) p2), false, false, p2, false]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) p2), false, false, p2, false]
[2024-05-23 02:53:37] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:37] [INFO ] Invariant cache hit.
[2024-05-23 02:53:37] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:53:37] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2024-05-23 02:53:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:53:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-23 02:53:37] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-23 02:53:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:53:37] [INFO ] [Nat]Added 45 Read/Feed constraints in 10 ms returned sat
[2024-05-23 02:53:37] [INFO ] Computed and/alt/rep : 46/90/42 causal constraints (skipped 142 transitions) in 18 ms.
[2024-05-23 02:53:37] [INFO ] Added : 4 causal constraints over 1 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-23 02:53:37] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:37] [INFO ] Invariant cache hit.
[2024-05-23 02:53:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:53:37] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:37] [INFO ] Invariant cache hit.
[2024-05-23 02:53:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:53:37] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 02:53:37] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:37] [INFO ] Invariant cache hit.
[2024-05-23 02:53:37] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7023 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 268/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 426 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8686 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 15890ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 15893ms
Finished structural reductions in LTL mode , in 1 iterations and 16115 ms. Remains : 111/111 places, 270/270 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 88 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(AND (NOT p1) p2), false, false, p2, false]
RANDOM walk for 40038 steps (28 resets) in 104 ms. (381 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 30 ms. (1290 steps per ms) remains 1/2 properties
[2024-05-23 02:53:54] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:54] [INFO ] Invariant cache hit.
[2024-05-23 02:53:54] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 109/170 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/235 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 54/289 variables, 27/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/297 variables, 8/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 1 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/61 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 109/170 variables, 61/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 6/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/170 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/235 variables, 15/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 31/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 54/289 variables, 27/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 8/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/289 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/297 variables, 8/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/297 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/297 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 159 constraints, problems are : Problem set: 0 solved, 1 unsolved in 102 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 205ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 20 ms.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 270/270 transitions.
Graph (complete) has 451 edges and 111 vertex of which 87 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 87 transition count 218
Applied a total of 53 rules in 9 ms. Remains 87 /111 variables (removed 24) and now considering 218/270 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 87/111 places, 218/270 transitions.
RANDOM walk for 40000 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
BEST_FIRST walk for 39132 steps (8 resets) in 26 ms. (1449 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND p0 (NOT p1))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND p2 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT p2)), (F (NOT (OR p0 p2 p1))), (F (NOT (OR p2 p1))), (F p1), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1))))]
Knowledge based reduction with 22 factoid took 378 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) p2), false, false, p2, false]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) p2), false, false, p2, false]
[2024-05-23 02:53:55] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:53:55] [INFO ] Invariant cache hit.
[2024-05-23 02:53:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:53:55] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-23 02:53:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-23 02:53:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-23 02:53:55] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-23 02:53:55] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-23 02:53:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:53:55] [INFO ] [Nat]Added 45 Read/Feed constraints in 9 ms returned sat
[2024-05-23 02:53:55] [INFO ] Computed and/alt/rep : 46/90/42 causal constraints (skipped 142 transitions) in 17 ms.
[2024-05-23 02:53:55] [INFO ] Added : 4 causal constraints over 1 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p1) p2)
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) p2), false, false, p2, false]
Product exploration explored 100000 steps with 33325 reset in 156 ms.
Product exploration explored 100000 steps with 33457 reset in 156 ms.
Applying partial POR strategy [false, true, false, true, false]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) p2), false, false, p2, false]
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 111 transition count 268
Applied a total of 2 rules in 15 ms. Remains 111 /111 variables (removed 0) and now considering 268/270 (removed 2) transitions.
[2024-05-23 02:53:56] [INFO ] Redundant transitions in 3 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-23 02:53:56] [INFO ] Flow matrix only has 185 transitions (discarded 83 similar events)
// Phase 1: matrix 185 rows 111 cols
[2024-05-23 02:53:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:53:56] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 185/296 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/296 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 296/296 variables, and 158 constraints, problems are : Problem set: 0 solved, 266 unsolved in 6917 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 185/296 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 266/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/296 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 296/296 variables, and 424 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8726 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 15844ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 15846ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 268/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15868 ms. Remains : 111/111 places, 268/270 transitions.
Support contains 5 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 270/270 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 270/270 (removed 0) transitions.
[2024-05-23 02:54:12] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
// Phase 1: matrix 186 rows 111 cols
[2024-05-23 02:54:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:54:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-23 02:54:12] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:54:12] [INFO ] Invariant cache hit.
[2024-05-23 02:54:12] [INFO ] State equation strengthened by 45 read => feed constraints.
[2024-05-23 02:54:12] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-23 02:54:12] [INFO ] Flow matrix only has 186 transitions (discarded 84 similar events)
[2024-05-23 02:54:12] [INFO ] Invariant cache hit.
[2024-05-23 02:54:12] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/297 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 297/297 variables, and 158 constraints, problems are : Problem set: 0 solved, 268 unsolved in 6976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 268 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 3 (OVERLAPS) 186/297 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 45/158 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 268/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/297 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 297/297 variables, and 426 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8897 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16072ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16075ms
Finished structural reductions in LTL mode , in 1 iterations and 16297 ms. Remains : 111/111 places, 270/270 transitions.
Treatment of property FunctionPointer-PT-b032-LTLCardinality-00 finished in 69689 ms.
[2024-05-23 02:54:28] [INFO ] Flatten gal took : 20 ms
[2024-05-23 02:54:28] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-23 02:54:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 163 places, 400 transitions and 1616 arcs took 6 ms.
Total runtime 285289 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b032

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 163
TRANSITIONS: 400
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.005s]


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


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

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

Process ID: 1456
MODEL NAME: /home/mcc/execution/412/model
163 places, 400 transitions.
Enabling coverability test.

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

BK_STOP 1716432871252

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is FunctionPointer-PT-b032, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r179-tall-171640601100251"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;