Execution Chart

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

Trace from the execution

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

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

=== Now, execution of the tool begins

BK_START 1717189191109

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:59:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:59:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:59:52] [INFO ] Load time of PNML (sax parser for PT used): 113 ms
[2024-05-31 20:59:52] [INFO ] Transformed 306 places.
[2024-05-31 20:59:52] [INFO ] Transformed 840 transitions.
[2024-05-31 20:59:52] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 6 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b032-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b032-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 540
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 540
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 106 place count 189 transition count 490
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 118 place count 177 transition count 466
Iterating global reduction 2 with 12 rules applied. Total rules applied 130 place count 177 transition count 466
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 146 place count 177 transition count 450
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 152 place count 171 transition count 438
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 171 transition count 438
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 163 place count 166 transition count 418
Iterating global reduction 3 with 5 rules applied. Total rules applied 168 place count 166 transition count 418
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 172 place count 162 transition count 410
Iterating global reduction 3 with 4 rules applied. Total rules applied 176 place count 162 transition count 410
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 177 place count 161 transition count 406
Iterating global reduction 3 with 1 rules applied. Total rules applied 178 place count 161 transition count 406
Applied a total of 178 rules in 85 ms. Remains 161 /222 variables (removed 61) and now considering 406/648 (removed 242) transitions.
[2024-05-31 20:59:52] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
// Phase 1: matrix 275 rows 161 cols
[2024-05-31 20:59:52] [INFO ] Computed 2 invariants in 18 ms
[2024-05-31 20:59:53] [INFO ] Implicit Places using invariants in 261 ms returned []
[2024-05-31 20:59:53] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-31 20:59:53] [INFO ] Invariant cache hit.
[2024-05-31 20:59:53] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-05-31 20:59:53] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2024-05-31 20:59:53] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-31 20:59:53] [INFO ] Invariant cache hit.
[2024-05-31 20:59:53] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/436 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 58/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 221 constraints, problems are : Problem set: 0 solved, 404 unsolved in 15109 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (OVERLAPS) 275/436 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 58/221 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 404/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 625 constraints, problems are : Problem set: 0 solved, 404 unsolved in 17312 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
After SMT, in 32990ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 33012ms
Starting structural reductions in LTL mode, iteration 1 : 161/222 places, 406/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33669 ms. Remains : 161/222 places, 406/648 transitions.
Support contains 23 out of 161 places after structural reductions.
[2024-05-31 21:00:26] [INFO ] Flatten gal took : 51 ms
[2024-05-31 21:00:26] [INFO ] Flatten gal took : 25 ms
[2024-05-31 21:00:26] [INFO ] Input system was already deterministic with 406 transitions.
RANDOM walk for 40016 steps (25 resets) in 885 ms. (45 steps per ms) remains 1/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
[2024-05-31 21:00:26] [INFO ] Flow matrix only has 275 transitions (discarded 131 similar events)
[2024-05-31 21:00:26] [INFO ] Invariant cache hit.
[2024-05-31 21:00:27] [INFO ] State equation strengthened by 58 read => feed constraints.
Problem AtomicPropp2 is UNSAT
After SMT solving in domain Real declared 2/436 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/161 constraints, ReadFeed: 0/58 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 28ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 24 stabilizing places and 64 stable transitions
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((G(!p0)||(!p0&&G(F(!p1)))))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 152 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 146 transition count 358
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 146 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 141 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 141 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 136 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 136 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 131 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 131 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 126 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 126 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 111 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 111 transition count 270
Applied a total of 106 rules in 24 ms. Remains 111 /161 variables (removed 50) and now considering 270/406 (removed 136) transitions.
[2024-05-31 21:00:27] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
// Phase 1: matrix 184 rows 111 cols
[2024-05-31 21:00:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:00:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 21:00:27] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-31 21:00:27] [INFO ] Invariant cache hit.
[2024-05-31 21:00:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:00:27] [INFO ] Implicit Places using invariants and state equation in 147 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-31 21:00:27] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-31 21:00:27] [INFO ] Invariant cache hit.
[2024-05-31 21:00:27] [INFO ] State equation strengthened by 43 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) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7245 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 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) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 268/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 424 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8942 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16459ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16464ms
Starting structural reductions in LTL mode, iteration 1 : 111/161 places, 270/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16709 ms. Remains : 111/161 places, 270/406 transitions.
Stuttering acceptance computed with spot in 318 ms :[p0, (AND p1 p0), (AND p1 p0), p0, p0]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-00
Product exploration explored 100000 steps with 932 reset in 461 ms.
Product exploration explored 100000 steps with 975 reset in 332 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) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 94 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 38885 steps (25 resets) in 136 ms. (283 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 233 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 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 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 111 transition count 264
Applied a total of 6 rules in 51 ms. Remains 111 /111 variables (removed 0) and now considering 264/270 (removed 6) transitions.
[2024-05-31 21:00:45] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-31 21:00:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:00:45] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-31 21:00:45] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:00:45] [INFO ] Invariant cache hit.
[2024-05-31 21:00:46] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:00:46] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2024-05-31 21:00:46] [INFO ] Redundant transitions in 11 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-31 21:00:46] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:00:46] [INFO ] Invariant cache hit.
[2024-05-31 21:00:46] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8915 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 16442ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 16445ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 264/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16855 ms. Remains : 111/111 places, 264/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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 39240 steps (40 resets) in 110 ms. (353 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 196 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 172 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 981 reset in 257 ms.
Product exploration explored 100000 steps with 970 reset in 258 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-31 21:01:03] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:01:03] [INFO ] Invariant cache hit.
[2024-05-31 21:01:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 21:01:03] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:01:03] [INFO ] Invariant cache hit.
[2024-05-31 21:01:03] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:01:04] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-31 21:01:04] [INFO ] Redundant transitions in 3 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-31 21:01:04] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:01:04] [INFO ] Invariant cache hit.
[2024-05-31 21:01:04] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7529 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 16470ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 16473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16716 ms. Remains : 111/111 places, 264/264 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-00 finished in 53399 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' '!(G((F(!(p0 U p1))||F(X(X(X(X(p0))))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 144 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 126 transition count 300
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 126 transition count 300
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 120 transition count 288
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 120 transition count 288
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 115 transition count 278
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 115 transition count 278
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 110 transition count 268
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 110 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 107 transition count 262
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 107 transition count 262
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 118 place count 107 transition count 258
Applied a total of 118 rules in 40 ms. Remains 107 /161 variables (removed 54) and now considering 258/406 (removed 148) transitions.
[2024-05-31 21:01:20] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
// Phase 1: matrix 176 rows 107 cols
[2024-05-31 21:01:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:01:20] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-31 21:01:20] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:20] [INFO ] Invariant cache hit.
[2024-05-31 21:01:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:01:21] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2024-05-31 21:01:21] [INFO ] Redundant transitions in 4 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-31 21:01:21] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:21] [INFO ] Invariant cache hit.
[2024-05-31 21:01:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6852 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 8818 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 15869ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 15874ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/161 places, 258/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16344 ms. Remains : 107/161 places, 258/406 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-01
Product exploration explored 100000 steps with 1371 reset in 242 ms.
Product exploration explored 100000 steps with 1360 reset in 236 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 p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 87 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 34102 steps (35 resets) in 122 ms. (277 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (OR p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (OR p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-31 21:01:38] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:38] [INFO ] Invariant cache hit.
[2024-05-31 21:01:38] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 21:01:38] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:38] [INFO ] Invariant cache hit.
[2024-05-31 21:01:38] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:01:38] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-31 21:01:38] [INFO ] Redundant transitions in 2 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-31 21:01:38] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:38] [INFO ] Invariant cache hit.
[2024-05-31 21:01:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6933 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 8760 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 15864ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 15867ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16099 ms. Remains : 107/107 places, 258/258 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 27010 steps (28 resets) in 48 ms. (551 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 7 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1385 reset in 227 ms.
Product exploration explored 100000 steps with 1362 reset in 230 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 258/258 transitions.
Applied a total of 0 rules in 6 ms. Remains 107 /107 variables (removed 0) and now considering 258/258 (removed 0) transitions.
[2024-05-31 21:01:55] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:55] [INFO ] Invariant cache hit.
[2024-05-31 21:01:55] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-31 21:01:55] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:55] [INFO ] Invariant cache hit.
[2024-05-31 21:01:55] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:01:55] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-31 21:01:55] [INFO ] Redundant transitions in 1 ms returned []
Running 256 sub problems to find dead transitions.
[2024-05-31 21:01:55] [INFO ] Flow matrix only has 176 transitions (discarded 82 similar events)
[2024-05-31 21:01:55] [INFO ] Invariant cache hit.
[2024-05-31 21:01:55] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 256/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 405 constraints, problems are : Problem set: 0 solved, 256 unsolved in 8798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
After SMT, in 15764ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 15766ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16016 ms. Remains : 107/107 places, 258/258 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-01 finished in 50724 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(F(p0))||G(p1))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 22 place count 152 transition count 376
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 145 transition count 356
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 145 transition count 356
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 139 transition count 336
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 139 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 133 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 133 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 127 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 127 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 121 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 121 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 116 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 116 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 111 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 111 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 108 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 108 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 107 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 107 transition count 264
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 116 place count 107 transition count 260
Applied a total of 116 rules in 26 ms. Remains 107 /161 variables (removed 54) and now considering 260/406 (removed 146) transitions.
[2024-05-31 21:02:11] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
// Phase 1: matrix 176 rows 107 cols
[2024-05-31 21:02:11] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:02:11] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-31 21:02:11] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:11] [INFO ] Invariant cache hit.
[2024-05-31 21:02:11] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:02:11] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2024-05-31 21:02:11] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 21:02:11] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:11] [INFO ] Invariant cache hit.
[2024-05-31 21:02:11] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6500 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 407 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7826 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14494ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14496ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/161 places, 260/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14753 ms. Remains : 107/161 places, 260/406 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-02
Product exploration explored 100000 steps with 943 reset in 242 ms.
Product exploration explored 100000 steps with 965 reset in 280 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 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 90 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40031 steps (42 resets) in 80 ms. (494 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
[2024-05-31 21:02:26] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:26] [INFO ] Invariant cache hit.
[2024-05-31 21:02:26] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/228 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 32/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/234 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/235 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/235 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/276 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 8/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 4/280 variables, 2/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/280 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 3/283 variables, 2/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 177/228 variables, 70/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 32/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/234 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/234 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/235 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/235 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/235 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 41/276 variables, 30/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/280 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/283 variables, 2/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/283 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/283 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 48383 steps, including 471 resets, run visited all 1 properties in 84 ms. (steps per millisecond=575 )
Parikh walk visited 1 properties in 88 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 11 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-31 21:02:27] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:27] [INFO ] Invariant cache hit.
[2024-05-31 21:02:27] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 21:02:27] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:27] [INFO ] Invariant cache hit.
[2024-05-31 21:02:27] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:02:27] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-31 21:02:28] [INFO ] Redundant transitions in 0 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 21:02:28] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:28] [INFO ] Invariant cache hit.
[2024-05-31 21:02:28] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6807 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 407 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7604 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14596ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14599ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14827 ms. Remains : 107/107 places, 260/260 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 (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 12574 steps (16 resets) in 30 ms. (405 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 9 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 980 reset in 253 ms.
Product exploration explored 100000 steps with 968 reset in 282 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /107 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-31 21:02:43] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:43] [INFO ] Invariant cache hit.
[2024-05-31 21:02:43] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:02:43] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:43] [INFO ] Invariant cache hit.
[2024-05-31 21:02:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:02:43] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-31 21:02:43] [INFO ] Redundant transitions in 0 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 21:02:43] [INFO ] Flow matrix only has 176 transitions (discarded 84 similar events)
[2024-05-31 21:02:43] [INFO ] Invariant cache hit.
[2024-05-31 21:02:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/283 variables, and 149 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6881 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 40/149 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 258/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/283 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/283 variables, and 407 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7696 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 14746ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 14748ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14974 ms. Remains : 107/107 places, 260/260 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-02 finished in 47336 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 (F(p0)&&X(p1))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 26 place count 152 transition count 372
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 32 place count 146 transition count 356
Iterating global reduction 1 with 6 rules applied. Total rules applied 38 place count 146 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 141 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 141 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 136 transition count 324
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 136 transition count 324
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 131 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 131 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 126 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 126 transition count 304
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 82 place count 122 transition count 296
Iterating global reduction 1 with 4 rules applied. Total rules applied 86 place count 122 transition count 296
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 90 place count 118 transition count 288
Iterating global reduction 1 with 4 rules applied. Total rules applied 94 place count 118 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 96 place count 116 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 98 place count 116 transition count 284
Applied a total of 98 rules in 9 ms. Remains 116 /161 variables (removed 45) and now considering 284/406 (removed 122) transitions.
[2024-05-31 21:02:58] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
// Phase 1: matrix 193 rows 116 cols
[2024-05-31 21:02:58] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:02:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 21:02:58] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2024-05-31 21:02:58] [INFO ] Invariant cache hit.
[2024-05-31 21:02:58] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:02:58] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Running 282 sub problems to find dead transitions.
[2024-05-31 21:02:58] [INFO ] Flow matrix only has 193 transitions (discarded 91 similar events)
[2024-05-31 21:02:58] [INFO ] Invariant cache hit.
[2024-05-31 21:02:58] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (OVERLAPS) 0/309 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 161 constraints, problems are : Problem set: 0 solved, 282 unsolved in 8213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 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/116 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 3 (OVERLAPS) 193/309 variables, 116/118 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 43/161 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/309 variables, 282/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/309 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
At refinement iteration 7 (OVERLAPS) 0/309 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 443 constraints, problems are : Problem set: 0 solved, 282 unsolved in 9407 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 116/116 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 282/282 constraints, Known Traps: 0/0 constraints]
After SMT, in 17849ms problems are : Problem set: 0 solved, 282 unsolved
Search for dead transitions found 0 dead transitions in 17852ms
Starting structural reductions in LTL mode, iteration 1 : 116/161 places, 284/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18085 ms. Remains : 116/161 places, 284/406 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-04 finished in 18286 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' '!(G(F(p0)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 33 place count 144 transition count 352
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 144 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 46 place count 138 transition count 332
Iterating global reduction 1 with 6 rules applied. Total rules applied 52 place count 138 transition count 332
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 58 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 64 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 82 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 88 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 110 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 110 transition count 266
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 106 transition count 258
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 106 transition count 258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 105 transition count 256
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 place count 105 transition count 256
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 122 place count 105 transition count 252
Applied a total of 122 rules in 32 ms. Remains 105 /161 variables (removed 56) and now considering 252/406 (removed 154) transitions.
[2024-05-31 21:03:17] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
// Phase 1: matrix 171 rows 105 cols
[2024-05-31 21:03:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:03:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 21:03:17] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:17] [INFO ] Invariant cache hit.
[2024-05-31 21:03:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:03:17] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-31 21:03:17] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 21:03:17] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:17] [INFO ] Invariant cache hit.
[2024-05-31 21:03:17] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6499 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 14331ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 14335ms
Starting structural reductions in SI_LTL mode, iteration 1 : 105/161 places, 252/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14581 ms. Remains : 105/161 places, 252/406 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-05
Product exploration explored 100000 steps with 994 reset in 333 ms.
Product exploration explored 100000 steps with 1057 reset in 270 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12505 steps (16 resets) in 16 ms. (735 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 252/252 transitions.
Applied a total of 0 rules in 9 ms. Remains 105 /105 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-31 21:03:32] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:32] [INFO ] Invariant cache hit.
[2024-05-31 21:03:32] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-31 21:03:32] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:32] [INFO ] Invariant cache hit.
[2024-05-31 21:03:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:03:32] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-31 21:03:32] [INFO ] Redundant transitions in 0 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 21:03:32] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:32] [INFO ] Invariant cache hit.
[2024-05-31 21:03:32] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6465 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7703 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 14329ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 14332ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14550 ms. Remains : 105/105 places, 252/252 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 9215 steps (7 resets) in 12 ms. (708 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1026 reset in 237 ms.
Product exploration explored 100000 steps with 979 reset in 253 ms.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 252/252 transitions.
Applied a total of 0 rules in 5 ms. Remains 105 /105 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-31 21:03:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:48] [INFO ] Invariant cache hit.
[2024-05-31 21:03:48] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 21:03:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:48] [INFO ] Invariant cache hit.
[2024-05-31 21:03:48] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:03:48] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-31 21:03:48] [INFO ] Redundant transitions in 1 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 21:03:48] [INFO ] Flow matrix only has 171 transitions (discarded 81 similar events)
[2024-05-31 21:03:48] [INFO ] Invariant cache hit.
[2024-05-31 21:03:48] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (OVERLAPS) 0/276 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 147 constraints, problems are : Problem set: 0 solved, 250 unsolved in 6337 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (OVERLAPS) 171/276 variables, 105/107 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/276 variables, 40/147 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/276 variables, 250/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 0/276 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 397 constraints, problems are : Problem set: 0 solved, 250 unsolved in 7825 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 105/105 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 0/0 constraints]
After SMT, in 14320ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 14324ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14534 ms. Remains : 105/105 places, 252/252 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-05 finished in 45761 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 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 151 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 143 transition count 350
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 136 transition count 326
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 136 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 129 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 129 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 122 transition count 288
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 122 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 115 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 115 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 109 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 109 transition count 262
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 104 transition count 252
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 104 transition count 252
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 100 transition count 244
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 100 transition count 244
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 127 place count 99 transition count 242
Iterating global reduction 1 with 1 rules applied. Total rules applied 128 place count 99 transition count 242
Applied a total of 128 rules in 12 ms. Remains 99 /161 variables (removed 62) and now considering 242/406 (removed 164) transitions.
[2024-05-31 21:04:02] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2024-05-31 21:04:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:04:02] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 21:04:02] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2024-05-31 21:04:02] [INFO ] Invariant cache hit.
[2024-05-31 21:04:02] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 21:04:02] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-31 21:04:02] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2024-05-31 21:04:02] [INFO ] Invariant cache hit.
[2024-05-31 21:04:02] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/263 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 263/263 variables, and 140 constraints, problems are : Problem set: 0 solved, 240 unsolved in 6066 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (OVERLAPS) 164/263 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 240/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (OVERLAPS) 0/263 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 263/263 variables, and 380 constraints, problems are : Problem set: 0 solved, 240 unsolved in 7277 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/99 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 0/0 constraints]
After SMT, in 13520ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 13528ms
Starting structural reductions in LTL mode, iteration 1 : 99/161 places, 242/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13724 ms. Remains : 99/161 places, 242/406 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 150 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b032-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b032-LTLFireability-06 finished in 14128 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(X(G(p0)))))'
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 150 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 150 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 150 transition count 368
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 142 transition count 346
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 135 transition count 322
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 135 transition count 322
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 65 place count 128 transition count 300
Iterating global reduction 1 with 7 rules applied. Total rules applied 72 place count 128 transition count 300
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 79 place count 121 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 86 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 93 place count 114 transition count 270
Iterating global reduction 1 with 7 rules applied. Total rules applied 100 place count 114 transition count 270
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 106 place count 108 transition count 258
Iterating global reduction 1 with 6 rules applied. Total rules applied 112 place count 108 transition count 258
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 118 place count 102 transition count 246
Iterating global reduction 1 with 6 rules applied. Total rules applied 124 place count 102 transition count 246
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 127 place count 99 transition count 240
Iterating global reduction 1 with 3 rules applied. Total rules applied 130 place count 99 transition count 240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 131 place count 98 transition count 238
Iterating global reduction 1 with 1 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 18 ms. Remains 98 /161 variables (removed 63) and now considering 238/406 (removed 168) transitions.
[2024-05-31 21:04:16] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
// Phase 1: matrix 162 rows 98 cols
[2024-05-31 21:04:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:04:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 21:04:16] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 21:04:16] [INFO ] Invariant cache hit.
[2024-05-31 21:04:17] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-31 21:04:17] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2024-05-31 21:04:17] [INFO ] Flow matrix only has 162 transitions (discarded 76 similar events)
[2024-05-31 21:04:17] [INFO ] Invariant cache hit.
[2024-05-31 21:04:17] [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, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/260 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 260/260 variables, and 139 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5849 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 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, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 162/260 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 39/139 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 236/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/260 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 260/260 variables, and 375 constraints, problems are : Problem set: 0 solved, 236 unsolved in 6956 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 12945ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 12949ms
Starting structural reductions in LTL mode, iteration 1 : 98/161 places, 238/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13314 ms. Remains : 98/161 places, 238/406 transitions.
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-09
Entered a terminal (fully accepting) state of product in 202 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-09 finished in 13468 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&&F(G(p1))))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 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 28 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 144 transition count 350
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 138 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 59 place count 133 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 64 place count 133 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 69 place count 128 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 74 place count 128 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 123 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 123 transition count 292
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 88 place count 119 transition count 284
Iterating global reduction 1 with 4 rules applied. Total rules applied 92 place count 119 transition count 284
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 96 place count 115 transition count 276
Iterating global reduction 1 with 4 rules applied. Total rules applied 100 place count 115 transition count 276
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 112 transition count 270
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 112 transition count 270
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 111 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 111 transition count 268
Applied a total of 108 rules in 23 ms. Remains 111 /161 variables (removed 50) and now considering 268/406 (removed 138) transitions.
[2024-05-31 21:04:30] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
// Phase 1: matrix 183 rows 111 cols
[2024-05-31 21:04:30] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:04:30] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:04:30] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2024-05-31 21:04:30] [INFO ] Invariant cache hit.
[2024-05-31 21:04:30] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:04:30] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 266 sub problems to find dead transitions.
[2024-05-31 21:04:30] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2024-05-31 21:04:30] [INFO ] Invariant cache hit.
[2024-05-31 21:04:30] [INFO ] State equation strengthened by 43 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) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (OVERLAPS) 0/294 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 156 constraints, problems are : Problem set: 0 solved, 266 unsolved in 7203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 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) 183/294 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 266/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 422 constraints, problems are : Problem set: 0 solved, 266 unsolved in 9379 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 16788ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 16790ms
Starting structural reductions in LTL mode, iteration 1 : 111/161 places, 268/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17054 ms. Remains : 111/161 places, 268/406 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1957 steps with 15 reset in 5 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-10 finished in 17209 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(p0))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 376
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 transition count 376
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 24 place count 151 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 143 transition count 350
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 143 transition count 350
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 136 transition count 326
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 136 transition count 326
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 129 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 129 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 122 transition count 288
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 122 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 115 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 115 transition count 274
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 109 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 109 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 103 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 103 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 99 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 99 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 98 transition count 240
Iterating global reduction 1 with 1 rules applied. Total rules applied 130 place count 98 transition count 240
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 98 transition count 238
Applied a total of 132 rules in 30 ms. Remains 98 /161 variables (removed 63) and now considering 238/406 (removed 168) transitions.
[2024-05-31 21:04:47] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
// Phase 1: matrix 160 rows 98 cols
[2024-05-31 21:04:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:04:47] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 21:04:47] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 21:04:47] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-31 21:04:47] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
[2024-05-31 21:04:47] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 21:04:47] [INFO ] Flow matrix only has 160 transitions (discarded 78 similar events)
[2024-05-31 21:04:47] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] State equation strengthened by 37 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, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 236 unsolved in 5838 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 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, 1/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 160/258 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 37/137 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 236/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 7 (OVERLAPS) 0/258 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 373 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7650 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 98/98 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints]
After SMT, in 13630ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 13633ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/161 places, 238/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13895 ms. Remains : 98/161 places, 238/406 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-11
Stuttering criterion allowed to conclude after 102 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-11 finished in 13948 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' '!(G(F(p0)))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 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 28 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 144 transition count 350
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 115 transition count 276
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 115 transition count 276
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 110 transition count 266
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 113 place count 107 transition count 260
Iterating global reduction 1 with 3 rules applied. Total rules applied 116 place count 107 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 117 place count 106 transition count 258
Iterating global reduction 1 with 1 rules applied. Total rules applied 118 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 122 place count 106 transition count 254
Applied a total of 122 rules in 26 ms. Remains 106 /161 variables (removed 55) and now considering 254/406 (removed 152) transitions.
[2024-05-31 21:05:01] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-31 21:05:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:05:01] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-31 21:05:01] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 21:05:01] [INFO ] Invariant cache hit.
[2024-05-31 21:05:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:05:01] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-31 21:05:01] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-31 21:05:01] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-31 21:05:01] [INFO ] Invariant cache hit.
[2024-05-31 21:05: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 6712 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 8051 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 14925ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 14929ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/161 places, 254/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15182 ms. Remains : 106/161 places, 254/406 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-12
Stuttering criterion allowed to conclude after 158 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-12 finished in 15261 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)||G(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 151 transition count 378
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 151 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 28 place count 151 transition count 370
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 35 place count 144 transition count 350
Iterating global reduction 1 with 7 rules applied. Total rules applied 42 place count 144 transition count 350
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 138 transition count 330
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 138 transition count 330
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 60 place count 132 transition count 312
Iterating global reduction 1 with 6 rules applied. Total rules applied 66 place count 132 transition count 312
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 72 place count 126 transition count 298
Iterating global reduction 1 with 6 rules applied. Total rules applied 78 place count 126 transition count 298
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 120 transition count 286
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 120 transition count 286
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 94 place count 116 transition count 278
Iterating global reduction 1 with 4 rules applied. Total rules applied 98 place count 116 transition count 278
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 112 transition count 270
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 112 transition count 270
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 108 place count 110 transition count 266
Iterating global reduction 1 with 2 rules applied. Total rules applied 110 place count 110 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 109 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 109 transition count 264
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 116 place count 109 transition count 260
Applied a total of 116 rules in 25 ms. Remains 109 /161 variables (removed 52) and now considering 260/406 (removed 146) transitions.
[2024-05-31 21:05:16] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
// Phase 1: matrix 178 rows 109 cols
[2024-05-31 21:05:16] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:05:16] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-31 21:05:16] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:16] [INFO ] Invariant cache hit.
[2024-05-31 21:05:16] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:05:17] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2024-05-31 21:05:17] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 21:05:17] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:17] [INFO ] Invariant cache hit.
[2024-05-31 21:05:17] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 7035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8285 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 15517ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 15519ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/161 places, 260/406 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15751 ms. Remains : 109/161 places, 260/406 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-13
Product exploration explored 100000 steps with 915 reset in 296 ms.
Product exploration explored 100000 steps with 960 reset in 298 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 102 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40004 steps (44 resets) in 73 ms. (540 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
[2024-05-31 21:05:33] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:33] [INFO ] Invariant cache hit.
[2024-05-31 21:05:33] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 255/287 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 86/109 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 301 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-31 21:05:33] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:33] [INFO ] Invariant cache hit.
[2024-05-31 21:05:33] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:05:33] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:33] [INFO ] Invariant cache hit.
[2024-05-31 21:05:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:05:34] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2024-05-31 21:05:34] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 21:05:34] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:34] [INFO ] Invariant cache hit.
[2024-05-31 21:05:34] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6943 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8186 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 15315ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 15317ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15525 ms. Remains : 109/109 places, 260/260 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 p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 130 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40019 steps (52 resets) in 57 ms. (689 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
[2024-05-31 21:05:49] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:49] [INFO ] Invariant cache hit.
[2024-05-31 21:05:49] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 92/96 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 255/287 variables, and 86 constraints, problems are : Problem set: 1 solved, 0 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 86/109 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 14 factoid took 310 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 977 reset in 290 ms.
Product exploration explored 100000 steps with 997 reset in 302 ms.
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 260/260 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 260/260 (removed 0) transitions.
[2024-05-31 21:05:50] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:50] [INFO ] Invariant cache hit.
[2024-05-31 21:05:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:05:50] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:50] [INFO ] Invariant cache hit.
[2024-05-31 21:05:50] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-31 21:05:50] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
[2024-05-31 21:05:50] [INFO ] Redundant transitions in 1 ms returned []
Running 258 sub problems to find dead transitions.
[2024-05-31 21:05:50] [INFO ] Flow matrix only has 178 transitions (discarded 82 similar events)
[2024-05-31 21:05:50] [INFO ] Invariant cache hit.
[2024-05-31 21:05:50] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 153 constraints, problems are : Problem set: 0 solved, 258 unsolved in 6894 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 258 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 3 (OVERLAPS) 178/287 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 258/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 7 (OVERLAPS) 0/287 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 258 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 411 constraints, problems are : Problem set: 0 solved, 258 unsolved in 8517 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 0/0 constraints]
After SMT, in 15584ms problems are : Problem set: 0 solved, 258 unsolved
Search for dead transitions found 0 dead transitions in 15588ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15809 ms. Remains : 109/109 places, 260/260 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-13 finished in 49714 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' '!(G((p0||X(p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 150 transition count 374
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 150 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 150 transition count 368
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 36 place count 142 transition count 346
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 142 transition count 346
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 136 transition count 324
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 136 transition count 324
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 130 transition count 304
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 130 transition count 304
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 124 transition count 290
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 124 transition count 290
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 118 transition count 278
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 118 transition count 278
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 112 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 112 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 106 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 106 transition count 254
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 102 transition count 246
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 102 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 101 transition count 244
Iterating global reduction 1 with 1 rules applied. Total rules applied 126 place count 101 transition count 244
Applied a total of 126 rules in 21 ms. Remains 101 /161 variables (removed 60) and now considering 244/406 (removed 162) transitions.
[2024-05-31 21:06:06] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
// Phase 1: matrix 166 rows 101 cols
[2024-05-31 21:06:06] [INFO ] Computed 2 invariants in 1 ms
[2024-05-31 21:06:06] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-31 21:06:06] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-31 21:06:06] [INFO ] Invariant cache hit.
[2024-05-31 21:06:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-31 21:06:06] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-31 21:06:06] [INFO ] Flow matrix only has 166 transitions (discarded 78 similar events)
[2024-05-31 21:06:06] [INFO ] Invariant cache hit.
[2024-05-31 21:06:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/267 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 143 constraints, problems are : Problem set: 0 solved, 242 unsolved in 6054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 166/267 variables, 101/103 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/267 variables, 242/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 7 (OVERLAPS) 0/267 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 267/267 variables, and 385 constraints, problems are : Problem set: 0 solved, 242 unsolved in 7552 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 101/101 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 13757ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 13759ms
Starting structural reductions in LTL mode, iteration 1 : 101/161 places, 244/406 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14001 ms. Remains : 101/161 places, 244/406 transitions.
Stuttering acceptance computed with spot in 73 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-15
Entered a terminal (fully accepting) state of product in 9662 steps with 75 reset in 33 ms.
FORMULA FunctionPointer-PT-b032-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b032-LTLFireability-15 finished in 14119 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((G(!p0)||(!p0&&G(F(!p1)))))))'
Found a Shortening insensitive property : FunctionPointer-PT-b032-LTLFireability-00
Stuttering acceptance computed with spot in 175 ms :[p0, (AND p1 p0), (AND p1 p0), p0, p0]
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 161/161 places, 406/406 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 380
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 380
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 24 place count 152 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 30 place count 146 transition count 358
Iterating global reduction 1 with 6 rules applied. Total rules applied 36 place count 146 transition count 358
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 41 place count 141 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 46 place count 141 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 136 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 136 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 131 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 131 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 126 transition count 300
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 126 transition count 300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 121 transition count 290
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 116 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 116 transition count 280
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 100 place count 112 transition count 272
Iterating global reduction 1 with 4 rules applied. Total rules applied 104 place count 112 transition count 272
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 111 transition count 270
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 111 transition count 270
Applied a total of 106 rules in 21 ms. Remains 111 /161 variables (removed 50) and now considering 270/406 (removed 136) transitions.
[2024-05-31 21:06:20] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
// Phase 1: matrix 184 rows 111 cols
[2024-05-31 21:06:20] [INFO ] Computed 2 invariants in 2 ms
[2024-05-31 21:06:21] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:06:21] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-31 21:06:21] [INFO ] Invariant cache hit.
[2024-05-31 21:06:21] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:06:21] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 268 sub problems to find dead transitions.
[2024-05-31 21:06:21] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-31 21:06:21] [INFO ] Invariant cache hit.
[2024-05-31 21:06:21] [INFO ] State equation strengthened by 43 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) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 268 unsolved in 7257 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 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) 184/295 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 268/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 268 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 424 constraints, problems are : Problem set: 0 solved, 268 unsolved in 8967 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 268/268 constraints, Known Traps: 0/0 constraints]
After SMT, in 16414ms problems are : Problem set: 0 solved, 268 unsolved
Search for dead transitions found 0 dead transitions in 16417ms
Starting structural reductions in LI_LTL mode, iteration 1 : 111/161 places, 270/406 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 16675 ms. Remains : 111/161 places, 270/406 transitions.
Running random walk in product with property : FunctionPointer-PT-b032-LTLFireability-00
Product exploration explored 100000 steps with 927 reset in 260 ms.
Product exploration explored 100000 steps with 939 reset in 273 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) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 89 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40032 steps (36 resets) in 62 ms. (635 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
[2024-05-31 21:06:38] [INFO ] Flow matrix only has 184 transitions (discarded 86 similar events)
[2024-05-31 21:06:38] [INFO ] Invariant cache hit.
[2024-05-31 21:06:38] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 193/249 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/255 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/292 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 3/295 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/295 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 193/249 variables, 77/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 35/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/249 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/249 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/255 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/292 variables, 29/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 8/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/292 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/295 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 288ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 77 ms.
Support contains 3 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.1 ms
Discarding 24 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 87 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 87 transition count 216
Applied a total of 55 rules in 21 ms. Remains 87 /111 variables (removed 24) and now considering 216/270 (removed 54) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 87/111 places, 216/270 transitions.
RANDOM walk for 40024 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 20669 steps (3 resets) in 17 ms. (1148 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 253 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 61 ms :[(AND p0 p1), (AND p0 p1)]
Support contains 3 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 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 111 transition count 264
Applied a total of 6 rules in 13 ms. Remains 111 /111 variables (removed 0) and now considering 264/270 (removed 6) transitions.
[2024-05-31 21:06:39] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
// Phase 1: matrix 181 rows 111 cols
[2024-05-31 21:06:39] [INFO ] Computed 2 invariants in 3 ms
[2024-05-31 21:06:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-31 21:06:39] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:06:39] [INFO ] Invariant cache hit.
[2024-05-31 21:06:39] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:06:39] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-31 21:06:39] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-31 21:06:39] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:06:39] [INFO ] Invariant cache hit.
[2024-05-31 21:06:39] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7113 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8861 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 16156ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 16159ms
Starting structural reductions in SI_LTL mode, iteration 1 : 111/111 places, 264/270 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16406 ms. Remains : 111/111 places, 264/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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 85 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND p0 p1), (AND p0 p1)]
RANDOM walk for 40026 steps (46 resets) in 59 ms. (667 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2024-05-31 21:06:55] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:06:55] [INFO ] Invariant cache hit.
[2024-05-31 21:06:55] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 189/244 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 35/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/250 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 37/287 variables, 29/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 8/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/291 variables, 2/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/291 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/292 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 1 unsolved in 108 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 189/244 variables, 76/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/244 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 35/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/244 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 6/250 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 37/287 variables, 29/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/287 variables, 8/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/287 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/291 variables, 2/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/292 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/292 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/292 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 157 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24288 steps, including 232 resets, run visited all 1 properties in 76 ms. (steps per millisecond=319 )
Parikh walk visited 1 properties in 75 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 (NOT p1)))), (F p0), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 234 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 82 ms :[(AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 80 ms :[(AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 978 reset in 251 ms.
Product exploration explored 100000 steps with 905 reset in 274 ms.
Support contains 3 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 111 /111 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-31 21:06:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:06:57] [INFO ] Invariant cache hit.
[2024-05-31 21:06:57] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-31 21:06:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:06:57] [INFO ] Invariant cache hit.
[2024-05-31 21:06:57] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-31 21:06:57] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2024-05-31 21:06:57] [INFO ] Redundant transitions in 1 ms returned []
Running 262 sub problems to find dead transitions.
[2024-05-31 21:06:57] [INFO ] Flow matrix only has 181 transitions (discarded 83 similar events)
[2024-05-31 21:06:57] [INFO ] Invariant cache hit.
[2024-05-31 21:06:57] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/292 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 156 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 181/292 variables, 111/113 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 43/156 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 262/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 0/292 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 418 constraints, problems are : Problem set: 0 solved, 262 unsolved in 8869 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 111/111 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 16410ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 16413ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16674 ms. Remains : 111/111 places, 264/264 transitions.
Treatment of property FunctionPointer-PT-b032-LTLFireability-00 finished in 53312 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' '!(G((F(!(p0 U p1))||F(X(X(X(X(p0))))))))'
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(F(p0))||G(p1))))'
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' '!(G(F(p0)))'
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)||G(p1))))'
[2024-05-31 21:07:14] [INFO ] Flatten gal took : 20 ms
[2024-05-31 21:07:14] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-31 21:07:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 406 transitions and 1638 arcs took 7 ms.
Total runtime 442098 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : FunctionPointer-PT-b032-LTLFireability-00
Could not compute solution for formula : FunctionPointer-PT-b032-LTLFireability-01
Could not compute solution for formula : FunctionPointer-PT-b032-LTLFireability-02
Could not compute solution for formula : FunctionPointer-PT-b032-LTLFireability-05
Could not compute solution for formula : FunctionPointer-PT-b032-LTLFireability-13

BK_STOP 1717189690192

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FunctionPointer-PT-b032-LTLFireability-00
ltl formula formula --ltl=/tmp/1737/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 161 places, 406 transitions and 1638 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1737/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1737/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1737/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1737/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 162 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 162, there are 416 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~32828 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~65328 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~130328 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~260328 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~520328 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~1040328 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~2080328 transitions
pnml2lts-mc( 3/ 4): ~320000 levels ~1280000 states ~4160328 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2271
pnml2lts-mc( 0/ 4): unique states count: 1989740
pnml2lts-mc( 0/ 4): unique transitions count: 7960623
pnml2lts-mc( 0/ 4): - self-loop count: 2271
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 385619
pnml2lts-mc( 0/ 4): - claim success count: 1989745
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1811031
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1989745 states 7960642 transitions, fanout: 4.001
pnml2lts-mc( 0/ 4): Total exploration time 13.120 sec (13.080 sec minimum, 13.100 sec on average)
pnml2lts-mc( 0/ 4): States per second: 151657, Transitions per second: 606756
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 119.9MB, 17.2 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 21.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 409 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 119.9MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-b032-LTLFireability-01
ltl formula formula --ltl=/tmp/1737/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 161 places, 406 transitions and 1638 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1737/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1737/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1737/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1737/ltl_1_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 163 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 162, there are 417 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~36896 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~72896 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~151424 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~301424 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~601424 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~1201424 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~2401424 transitions
pnml2lts-mc( 0/ 4): ~320000 levels ~1280000 states ~4801424 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1616757
pnml2lts-mc( 0/ 4): unique transitions count: 6431293
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 1616762
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1616762
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1616762 states 6431307 transitions, fanout: 3.978
pnml2lts-mc( 0/ 4): Total exploration time 8.580 sec (8.570 sec minimum, 8.573 sec on average)
pnml2lts-mc( 0/ 4): States per second: 188434, Transitions per second: 749570
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 112.8MB, 18.5 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 409 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 112.8MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-b032-LTLFireability-02
ltl formula formula --ltl=/tmp/1737/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 161 places, 406 transitions and 1638 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1737/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1737/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1737/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1737/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 162 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 162, there are 421 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~2500 levels ~10000 states ~41068 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~82316 transitions
pnml2lts-mc( 3/ 4): ~10000 levels ~40000 states ~164792 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~329792 transitions
pnml2lts-mc( 3/ 4): ~40000 levels ~160000 states ~659792 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~1319792 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~2639792 transitions
pnml2lts-mc( 3/ 4): ~320000 levels ~1280000 states ~5279792 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 1748240
pnml2lts-mc( 0/ 4): unique transitions count: 8200348
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 395335
pnml2lts-mc( 0/ 4): - claim success count: 1748276
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1748276
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1748276 states 8200486 transitions, fanout: 4.691
pnml2lts-mc( 0/ 4): Total exploration time 9.540 sec (9.510 sec minimum, 9.517 sec on average)
pnml2lts-mc( 0/ 4): States per second: 183257, Transitions per second: 859590
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 121.3MB, 16.9 B/state, compr.: 2.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 22.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 409 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 121.3MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-b032-LTLFireability-05
ltl formula formula --ltl=/tmp/1737/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 161 places, 406 transitions and 1638 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1737/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1737/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1737/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1737/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 163 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 162, there are 409 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~31068 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~61068 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~121068 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~241068 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~481068 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~961068 transitions
pnml2lts-mc( 0/ 4): ~160000 levels ~640000 states ~1921068 transitions
pnml2lts-mc( 0/ 4): ~320000 levels ~1280000 states ~3841068 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 2028919
pnml2lts-mc( 0/ 4): unique transitions count: 7239941
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 164225
pnml2lts-mc( 0/ 4): - claim success count: 2028924
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1940160
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2028924 states 7239957 transitions, fanout: 3.568
pnml2lts-mc( 0/ 4): Total exploration time 10.190 sec (10.170 sec minimum, 10.177 sec on average)
pnml2lts-mc( 0/ 4): States per second: 199109, Transitions per second: 710496
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 115.7MB, 17.9 B/state, compr.: 2.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 409 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 115.7MB (~256.0MB paged-in)
ltl formula name FunctionPointer-PT-b032-LTLFireability-13
ltl formula formula --ltl=/tmp/1737/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 161 places, 406 transitions and 1638 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1737/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1737/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1737/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1737/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 162 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 162, there are 419 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~58368 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~118368 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~238368 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~478368 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~958368 transitions
pnml2lts-mc( 3/ 4): ~80000 levels ~320000 states ~1921620 transitions
pnml2lts-mc( 3/ 4): ~160000 levels ~640000 states ~3841620 transitions
pnml2lts-mc( 3/ 4): ~320000 levels ~1280000 states ~7681620 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 11887
pnml2lts-mc( 0/ 4): unique states count: 2089746
pnml2lts-mc( 0/ 4): unique transitions count: 16338215
pnml2lts-mc( 0/ 4): - self-loop count: 23774
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1416173
pnml2lts-mc( 0/ 4): - claim success count: 2089783
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1974248
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2089783 states 16338355 transitions, fanout: 7.818
pnml2lts-mc( 0/ 4): Total exploration time 11.780 sec (11.740 sec minimum, 11.752 sec on average)
pnml2lts-mc( 0/ 4): States per second: 177401, Transitions per second: 1386957
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 117.3MB, 17.6 B/state, compr.: 2.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 20.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 409 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 117.3MB (~256.0MB paged-in)

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="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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