Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 896K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 11 16:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Apr 11 16:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 391K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b016-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716432288195

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:44:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-23 02:44:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:44:49] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2024-05-23 02:44:49] [INFO ] Transformed 306 places.
[2024-05-23 02:44:49] [INFO ] Transformed 840 transitions.
[2024-05-23 02:44:49] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 200 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FunctionPointer-PT-b016-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b016-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 526
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 526
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 98 place count 189 transition count 484
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 110 place count 177 transition count 460
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 177 transition count 460
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 134 place count 177 transition count 448
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 140 place count 171 transition count 436
Iterating global reduction 3 with 6 rules applied. Total rules applied 146 place count 171 transition count 436
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 151 place count 166 transition count 416
Iterating global reduction 3 with 5 rules applied. Total rules applied 156 place count 166 transition count 416
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 160 place count 162 transition count 408
Iterating global reduction 3 with 4 rules applied. Total rules applied 164 place count 162 transition count 408
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 165 place count 161 transition count 404
Iterating global reduction 3 with 1 rules applied. Total rules applied 166 place count 161 transition count 404
Applied a total of 166 rules in 81 ms. Remains 161 /222 variables (removed 61) and now considering 404/648 (removed 244) transitions.
[2024-05-23 02:44:49] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
// Phase 1: matrix 275 rows 161 cols
[2024-05-23 02:44:49] [INFO ] Computed 2 invariants in 20 ms
[2024-05-23 02:44:50] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-23 02:44:50] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
[2024-05-23 02:44:50] [INFO ] Invariant cache hit.
[2024-05-23 02:44:50] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-05-23 02:44:50] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 536 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2024-05-23 02:44:50] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
[2024-05-23 02:44:50] [INFO ] Invariant cache hit.
[2024-05-23 02:44:50] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (OVERLAPS) 275/436 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 59/222 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (OVERLAPS) 0/436 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 402 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 222 constraints, problems are : Problem set: 0 solved, 402 unsolved in 15051 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 402 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (OVERLAPS) 275/436 variables, 161/163 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 59/222 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 402/624 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 402 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 624 constraints, problems are : Problem set: 0 solved, 402 unsolved in 16312 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 0/0 constraints]
After SMT, in 31919ms problems are : Problem set: 0 solved, 402 unsolved
Search for dead transitions found 0 dead transitions in 31941ms
Starting structural reductions in LTL mode, iteration 1 : 161/222 places, 404/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32576 ms. Remains : 161/222 places, 404/648 transitions.
Support contains 18 out of 161 places after structural reductions.
[2024-05-23 02:45:22] [INFO ] Flatten gal took : 51 ms
[2024-05-23 02:45:22] [INFO ] Flatten gal took : 25 ms
[2024-05-23 02:45:22] [INFO ] Input system was already deterministic with 404 transitions.
RANDOM walk for 40002 steps (43 resets) in 961 ms. (41 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
[2024-05-23 02:45:23] [INFO ] Flow matrix only has 275 transitions (discarded 129 similar events)
[2024-05-23 02:45:23] [INFO ] Invariant cache hit.
[2024-05-23 02:45:23] [INFO ] State equation strengthened by 59 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) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/371 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 59/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/377 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/377 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/378 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 58/436 variables, 43/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/436 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 222 constraints, problems are : Problem set: 0 solved, 1 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 59/59 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) 80/82 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/82 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 289/371 variables, 115/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 59/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/371 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/371 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6/377 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/377 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/378 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 58/436 variables, 43/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/436 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 436/436 variables, and 223 constraints, problems are : Problem set: 0 solved, 1 unsolved in 170 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 161/161 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 312ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 24888 steps, including 311 resets, run visited all 1 properties in 105 ms. (steps per millisecond=237 )
Parikh walk visited 1 properties in 110 ms.
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' '!(F(G((p0&&(G(p1)||X(p2))))))'
Support contains 6 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 404/404 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 154 transition count 386
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 154 transition count 386
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 22 place count 154 transition count 378
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 150 transition count 366
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 150 transition count 366
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 34 place count 146 transition count 352
Iterating global reduction 1 with 4 rules applied. Total rules applied 38 place count 146 transition count 352
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 142 transition count 342
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 142 transition count 342
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 50 place count 138 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 54 place count 138 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 134 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 134 transition count 326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 131 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 131 transition count 320
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 128 transition count 314
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 128 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 127 transition count 312
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 127 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 84 place count 127 transition count 304
Applied a total of 84 rules in 67 ms. Remains 127 /161 variables (removed 34) and now considering 304/404 (removed 100) transitions.
[2024-05-23 02:45:23] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
// Phase 1: matrix 209 rows 127 cols
[2024-05-23 02:45:23] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:45:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:45:23] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:45:23] [INFO ] Invariant cache hit.
[2024-05-23 02:45:24] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-23 02:45:24] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-23 02:45:24] [INFO ] Redundant transitions in 13 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-23 02:45:24] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:45:24] [INFO ] Invariant cache hit.
[2024-05-23 02:45:24] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 209/336 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 47/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 176 constraints, problems are : Problem set: 0 solved, 302 unsolved in 8833 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 209/336 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 47/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 302/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 478 constraints, problems are : Problem set: 0 solved, 302 unsolved in 10317 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 19445ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 19448ms
Starting structural reductions in SI_LTL mode, iteration 1 : 127/161 places, 304/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19784 ms. Remains : 127/161 places, 304/404 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-00
Product exploration explored 100000 steps with 568 reset in 513 ms.
Product exploration explored 100000 steps with 611 reset in 377 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 p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 143 ms. Reduced automaton from 4 states, 16 edges and 3 AP (stutter insensitive) to 3 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40018 steps (50 resets) in 326 ms. (122 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
[2024-05-23 02:45:45] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:45:45] [INFO ] Invariant cache hit.
[2024-05-23 02:45:45] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/133 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf7 is UNSAT
After SMT solving in domain Real declared 296/336 variables, and 106 constraints, problems are : Problem set: 1 solved, 0 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/127 constraints, ReadFeed: 6/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms 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 p2), (X p2), (X (NOT (AND (NOT p1) p0))), (X p0), (X (AND p1 p0)), (X p1), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND p1 p0 p2)), (X (NOT (AND p1 p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 (NOT p2))))), (G (OR p1 p2 (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p1 (NOT p2) (NOT p0)))), (F (NOT (AND p1 p2 p0))), (F (NOT p0)), (F (NOT (AND p1 p0))), (F (NOT p2)), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) p2 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 20 factoid took 425 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 304/304 transitions.
Applied a total of 0 rules in 15 ms. Remains 127 /127 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-23 02:45:46] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:45:46] [INFO ] Invariant cache hit.
[2024-05-23 02:45:46] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 02:45:46] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:45:46] [INFO ] Invariant cache hit.
[2024-05-23 02:45:46] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-23 02:45:46] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-05-23 02:45:46] [INFO ] Redundant transitions in 5 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-23 02:45:46] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:45:46] [INFO ] Invariant cache hit.
[2024-05-23 02:45:46] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 209/336 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 47/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 176 constraints, problems are : Problem set: 0 solved, 302 unsolved in 8890 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 209/336 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 47/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 302/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 478 constraints, problems are : Problem set: 0 solved, 302 unsolved in 10137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 19312ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 19318ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19596 ms. Remains : 127/127 places, 304/304 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 p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 111 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 40005 steps (52 resets) in 139 ms. (285 steps per ms) remains 1/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
[2024-05-23 02:46:06] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:46:06] [INFO ] Invariant cache hit.
[2024-05-23 02:46:06] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 12/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 115/133 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 6/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf3 is UNSAT
After SMT solving in domain Real declared 296/336 variables, and 106 constraints, problems are : Problem set: 1 solved, 0 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 99/127 constraints, ReadFeed: 6/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND (NOT p1) p0))), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (AND p1 p0)), (X p0), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X p1)), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p2 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 22 factoid took 327 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter insensitive) to 3 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 612 reset in 337 ms.
Product exploration explored 100000 steps with 561 reset in 366 ms.
Support contains 6 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 304/304 transitions.
Applied a total of 0 rules in 9 ms. Remains 127 /127 variables (removed 0) and now considering 304/304 (removed 0) transitions.
[2024-05-23 02:46:07] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:46:07] [INFO ] Invariant cache hit.
[2024-05-23 02:46:07] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-23 02:46:07] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:46:07] [INFO ] Invariant cache hit.
[2024-05-23 02:46:07] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-23 02:46:07] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2024-05-23 02:46:07] [INFO ] Redundant transitions in 4 ms returned []
Running 302 sub problems to find dead transitions.
[2024-05-23 02:46:07] [INFO ] Flow matrix only has 209 transitions (discarded 95 similar events)
[2024-05-23 02:46:07] [INFO ] Invariant cache hit.
[2024-05-23 02:46:07] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 209/336 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 47/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 0/336 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 336/336 variables, and 176 constraints, problems are : Problem set: 0 solved, 302 unsolved in 8842 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (OVERLAPS) 209/336 variables, 127/129 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/336 variables, 47/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/336 variables, 302/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (OVERLAPS) 0/336 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Int declared 336/336 variables, and 478 constraints, problems are : Problem set: 0 solved, 302 unsolved in 10253 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 127/127 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints]
After SMT, in 19326ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 19331ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 19599 ms. Remains : 127/127 places, 304/304 transitions.
Treatment of property FunctionPointer-PT-b016-LTLFireability-00 finished in 63427 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((F(p2)&&p1))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 404/404 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 154 transition count 384
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 154 transition count 384
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 154 transition count 380
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 23 place count 149 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 28 place count 149 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 144 transition count 350
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 144 transition count 350
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 43 place count 139 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 48 place count 139 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 134 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 134 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 129 transition count 310
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 129 transition count 310
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 124 transition count 298
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 124 transition count 298
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 119 transition count 288
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 119 transition count 288
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 115 transition count 280
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 115 transition count 280
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 114 transition count 278
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 114 transition count 278
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 99 place count 113 transition count 276
Iterating global reduction 1 with 1 rules applied. Total rules applied 100 place count 113 transition count 276
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 112 transition count 274
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 112 transition count 274
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 108 place count 112 transition count 268
Applied a total of 108 rules in 50 ms. Remains 112 /161 variables (removed 49) and now considering 268/404 (removed 136) transitions.
[2024-05-23 02:46:27] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
// Phase 1: matrix 183 rows 112 cols
[2024-05-23 02:46:27] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 02:46:27] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-23 02:46:27] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2024-05-23 02:46:27] [INFO ] Invariant cache hit.
[2024-05-23 02:46:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-23 02:46:27] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2024-05-23 02:46:27] [INFO ] Redundant transitions in 2 ms returned []
Running 266 sub problems to find dead transitions.
[2024-05-23 02:46:27] [INFO ] Flow matrix only has 183 transitions (discarded 85 similar events)
[2024-05-23 02:46:27] [INFO ] Invariant cache hit.
[2024-05-23 02:46:27] [INFO ] State equation strengthened by 43 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 183/295 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/295 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 157 constraints, problems are : Problem set: 0 solved, 266 unsolved in 7215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 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/112 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 3 (OVERLAPS) 183/295 variables, 112/114 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/295 variables, 43/157 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/295 variables, 266/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
At refinement iteration 7 (OVERLAPS) 0/295 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 266 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 423 constraints, problems are : Problem set: 0 solved, 266 unsolved in 8096 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 112/112 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 266/266 constraints, Known Traps: 0/0 constraints]
After SMT, in 15512ms problems are : Problem set: 0 solved, 266 unsolved
Search for dead transitions found 0 dead transitions in 15515ms
Starting structural reductions in SI_LTL mode, iteration 1 : 112/161 places, 268/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15796 ms. Remains : 112/161 places, 268/404 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-01
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-01 finished in 15957 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, 404/404 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 378
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 378
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 374
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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 138 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 138 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 131 transition count 310
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 131 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 124 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 124 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 117 transition count 280
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 117 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 111 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 111 transition count 266
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 109 place count 106 transition count 256
Iterating global reduction 1 with 5 rules applied. Total rules applied 114 place count 106 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 102 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 102 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 101 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 100 transition count 244
Iterating global reduction 1 with 1 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 22 ms. Remains 99 /161 variables (removed 62) and now considering 242/404 (removed 162) transitions.
[2024-05-23 02:46:43] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
// Phase 1: matrix 164 rows 99 cols
[2024-05-23 02:46:43] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:46:43] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 02:46:43] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2024-05-23 02:46:43] [INFO ] Invariant cache hit.
[2024-05-23 02:46:43] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 02:46:43] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2024-05-23 02:46:43] [INFO ] Flow matrix only has 164 transitions (discarded 78 similar events)
[2024-05-23 02:46:43] [INFO ] Invariant cache hit.
[2024-05-23 02:46:43] [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 5876 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 6893 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 12955ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 12957ms
Starting structural reductions in LTL mode, iteration 1 : 99/161 places, 242/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13164 ms. Remains : 99/161 places, 242/404 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-04
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-04 finished in 13258 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 404/404 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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 137 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 137 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 130 transition count 306
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 130 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 123 transition count 292
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 123 transition count 292
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 116 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 110 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 110 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 104 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 99 transition count 240
Iterating global reduction 1 with 1 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
Applied a total of 134 rules in 30 ms. Remains 97 /161 variables (removed 64) and now considering 236/404 (removed 168) transitions.
[2024-05-23 02:46:56] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-23 02:46:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:46:56] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 02:46:56] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:46:56] [INFO ] Invariant cache hit.
[2024-05-23 02:46:56] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:46:56] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-23 02:46:56] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:46:56] [INFO ] Invariant cache hit.
[2024-05-23 02:46:56] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6707 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12506ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12509ms
Starting structural reductions in LTL mode, iteration 1 : 97/161 places, 236/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12730 ms. Remains : 97/161 places, 236/404 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-05
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-05 finished in 12906 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||G(p1)))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 404/404 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 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 140 transition count 336
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 140 transition count 336
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 56 place count 134 transition count 318
Iterating global reduction 1 with 6 rules applied. Total rules applied 62 place count 134 transition count 318
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 128 transition count 306
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 128 transition count 306
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 122 transition count 292
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 122 transition count 292
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 117 transition count 280
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 117 transition count 280
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 112 transition count 270
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 112 transition count 270
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 109 transition count 264
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 109 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 108 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 108 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 107 transition count 260
Iterating global reduction 1 with 1 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 55 ms. Remains 106 /161 variables (removed 55) and now considering 254/404 (removed 150) transitions.
[2024-05-23 02:47:09] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
// Phase 1: matrix 172 rows 106 cols
[2024-05-23 02:47:09] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 02:47:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 02:47:09] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:09] [INFO ] Invariant cache hit.
[2024-05-23 02:47:09] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:47:09] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-23 02:47:09] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-23 02:47:09] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:09] [INFO ] Invariant cache hit.
[2024-05-23 02:47:09] [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
All remaining problems are real, not stopping.
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 6518 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 7332 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 14018ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 14022ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/161 places, 254/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14312 ms. Remains : 106/161 places, 254/404 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-06
Product exploration explored 100000 steps with 579 reset in 254 ms.
Product exploration explored 100000 steps with 559 reset in 310 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 110 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36472 steps (52 resets) in 85 ms. (424 steps per ms) remains 0/4 properties
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 211 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 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 9 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-23 02:47:24] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:24] [INFO ] Invariant cache hit.
[2024-05-23 02:47:25] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 02:47:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:25] [INFO ] Invariant cache hit.
[2024-05-23 02:47:25] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:47:25] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-23 02:47:25] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-23 02:47:25] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:25] [INFO ] Invariant cache hit.
[2024-05-23 02:47:25] [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
All remaining problems are real, not stopping.
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 6584 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 7275 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 14041ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 14044ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14292 ms. Remains : 106/106 places, 254/254 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 98 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 36624 steps (51 resets) in 74 ms. (488 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 184 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))]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 579 reset in 283 ms.
Product exploration explored 100000 steps with 600 reset in 325 ms.
Support contains 4 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 254/254 transitions.
Applied a total of 0 rules in 15 ms. Remains 106 /106 variables (removed 0) and now considering 254/254 (removed 0) transitions.
[2024-05-23 02:47:40] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:40] [INFO ] Invariant cache hit.
[2024-05-23 02:47:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 02:47:40] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:40] [INFO ] Invariant cache hit.
[2024-05-23 02:47:40] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:47:40] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2024-05-23 02:47:40] [INFO ] Redundant transitions in 1 ms returned []
Running 252 sub problems to find dead transitions.
[2024-05-23 02:47:40] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2024-05-23 02:47:40] [INFO ] Invariant cache hit.
[2024-05-23 02:47:40] [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
All remaining problems are real, not stopping.
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 6463 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 7284 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 13901ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 13905ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14155 ms. Remains : 106/106 places, 254/254 transitions.
Treatment of property FunctionPointer-PT-b016-LTLFireability-06 finished in 45309 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((p0||F(p1)))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 404/404 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 153 transition count 380
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 153 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 20 place count 153 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 26 place count 147 transition count 362
Iterating global reduction 1 with 6 rules applied. Total rules applied 32 place count 147 transition count 362
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 38 place count 141 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 44 place count 141 transition count 342
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 135 transition count 322
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 135 transition count 322
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 129 transition count 310
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 129 transition count 310
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 123 transition count 296
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 123 transition count 296
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 118 transition count 284
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 118 transition count 284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 113 transition count 274
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 113 transition count 274
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 103 place count 110 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 106 place count 110 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 107 place count 109 transition count 266
Iterating global reduction 1 with 1 rules applied. Total rules applied 108 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 107 transition count 262
Applied a total of 112 rules in 12 ms. Remains 107 /161 variables (removed 54) and now considering 262/404 (removed 142) transitions.
[2024-05-23 02:47:54] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
// Phase 1: matrix 178 rows 107 cols
[2024-05-23 02:47:54] [INFO ] Computed 2 invariants in 2 ms
[2024-05-23 02:47:54] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 02:47:54] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-23 02:47:54] [INFO ] Invariant cache hit.
[2024-05-23 02:47:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-23 02:47:54] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2024-05-23 02:47:54] [INFO ] Flow matrix only has 178 transitions (discarded 84 similar events)
[2024-05-23 02:47:54] [INFO ] Invariant cache hit.
[2024-05-23 02:47:54] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/285 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/285 variables, and 151 constraints, problems are : Problem set: 0 solved, 260 unsolved in 6370 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/107 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 178/285 variables, 107/109 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 42/151 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 260/411 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/285 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (OVERLAPS) 0/285 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/285 variables, and 411 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7761 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 107/107 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints]
After SMT, in 14296ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 14298ms
Starting structural reductions in LTL mode, iteration 1 : 107/161 places, 262/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14550 ms. Remains : 107/161 places, 262/404 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-09
Product exploration explored 100000 steps with 33333 reset in 311 ms.
Product exploration explored 100000 steps with 33333 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 p1 p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FunctionPointer-PT-b016-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b016-LTLFireability-09 finished in 15316 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 2 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 404/404 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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 137 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 137 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 130 transition count 306
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 130 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 123 transition count 292
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 123 transition count 292
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 116 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 110 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 110 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 104 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 99 transition count 240
Iterating global reduction 1 with 1 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
Applied a total of 134 rules in 17 ms. Remains 97 /161 variables (removed 64) and now considering 236/404 (removed 168) transitions.
[2024-05-23 02:48:10] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
// Phase 1: matrix 159 rows 97 cols
[2024-05-23 02:48:10] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:48:10] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-23 02:48:10] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:48:10] [INFO ] Invariant cache hit.
[2024-05-23 02:48:10] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:48:10] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-05-23 02:48:10] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2024-05-23 02:48:10] [INFO ] Invariant cache hit.
[2024-05-23 02:48:10] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (OVERLAPS) 0/256 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 370 constraints, problems are : Problem set: 0 solved, 234 unsolved in 6736 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 12611ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 12613ms
Starting structural reductions in LTL mode, iteration 1 : 97/161 places, 236/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12924 ms. Remains : 97/161 places, 236/404 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-10
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-10 finished in 13112 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, 404/404 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 152 transition count 378
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 152 transition count 378
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 374
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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 43 place count 138 transition count 332
Iterating global reduction 1 with 7 rules applied. Total rules applied 50 place count 138 transition count 332
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 57 place count 131 transition count 310
Iterating global reduction 1 with 7 rules applied. Total rules applied 64 place count 131 transition count 310
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 71 place count 124 transition count 296
Iterating global reduction 1 with 7 rules applied. Total rules applied 78 place count 124 transition count 296
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 117 transition count 280
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 117 transition count 280
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 111 transition count 266
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 111 transition count 266
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 105 transition count 254
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 102 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 102 transition count 248
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 101 transition count 246
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 101 transition count 246
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 125 place count 100 transition count 244
Iterating global reduction 1 with 1 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
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 130 place count 99 transition count 240
Applied a total of 130 rules in 42 ms. Remains 99 /161 variables (removed 62) and now considering 240/404 (removed 164) transitions.
[2024-05-23 02:48:23] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
// Phase 1: matrix 163 rows 99 cols
[2024-05-23 02:48:23] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:48:23] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 02:48:23] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-23 02:48:23] [INFO ] Invariant cache hit.
[2024-05-23 02:48:23] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 02:48:23] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-05-23 02:48:23] [INFO ] Redundant transitions in 1 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-23 02:48:23] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-23 02:48:23] [INFO ] Invariant cache hit.
[2024-05-23 02:48:23] [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, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 140 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5767 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: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 238/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 378 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6366 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: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 12292ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 12294ms
Starting structural reductions in SI_LTL mode, iteration 1 : 99/161 places, 240/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12533 ms. Remains : 99/161 places, 240/404 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-11
Product exploration explored 100000 steps with 847 reset in 253 ms.
Product exploration explored 100000 steps with 860 reset in 257 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 178 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1027 steps (2 resets) in 8 ms. (114 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 102 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 99 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 99/99 places, 240/240 transitions.
Applied a total of 0 rules in 16 ms. Remains 99 /99 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2024-05-23 02:48:36] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-23 02:48:36] [INFO ] Invariant cache hit.
[2024-05-23 02:48:36] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 02:48:36] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-23 02:48:36] [INFO ] Invariant cache hit.
[2024-05-23 02:48:36] [INFO ] State equation strengthened by 39 read => feed constraints.
[2024-05-23 02:48:36] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2024-05-23 02:48:37] [INFO ] Redundant transitions in 1 ms returned []
Running 238 sub problems to find dead transitions.
[2024-05-23 02:48:37] [INFO ] Flow matrix only has 163 transitions (discarded 77 similar events)
[2024-05-23 02:48:37] [INFO ] Invariant cache hit.
[2024-05-23 02:48:37] [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, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/262 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 140 constraints, problems are : Problem set: 0 solved, 238 unsolved in 5867 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: 238/238 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 163/262 variables, 99/101 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 39/140 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 238/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/262 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/262 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 378 constraints, problems are : Problem set: 0 solved, 238 unsolved in 6631 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: 238/238 constraints, Known Traps: 0/0 constraints]
After SMT, in 12641ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 12643ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12882 ms. Remains : 99/99 places, 240/240 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 77 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 16292 steps (28 resets) in 33 ms. (479 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 90 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 80 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 784 reset in 259 ms.
Stack based approach found an accepted trace after 12374 steps with 99 reset with depth 488 and stack size 488 in 33 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-11 finished in 27337 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, 404/404 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 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 137 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 137 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 130 transition count 306
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 130 transition count 306
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 75 place count 123 transition count 292
Iterating global reduction 1 with 7 rules applied. Total rules applied 82 place count 123 transition count 292
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 89 place count 116 transition count 276
Iterating global reduction 1 with 7 rules applied. Total rules applied 96 place count 116 transition count 276
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 102 place count 110 transition count 262
Iterating global reduction 1 with 6 rules applied. Total rules applied 108 place count 110 transition count 262
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 114 place count 104 transition count 250
Iterating global reduction 1 with 6 rules applied. Total rules applied 120 place count 104 transition count 250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 124 place count 100 transition count 242
Iterating global reduction 1 with 4 rules applied. Total rules applied 128 place count 100 transition count 242
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 129 place count 99 transition count 240
Iterating global reduction 1 with 1 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
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 97 transition count 236
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 97 transition count 236
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 136 place count 97 transition count 234
Applied a total of 136 rules in 32 ms. Remains 97 /161 variables (removed 64) and now considering 234/404 (removed 170) transitions.
[2024-05-23 02:48:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
// Phase 1: matrix 158 rows 97 cols
[2024-05-23 02:48:50] [INFO ] Computed 2 invariants in 3 ms
[2024-05-23 02:48:50] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 02:48:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:48:50] [INFO ] Invariant cache hit.
[2024-05-23 02:48:50] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:48:50] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-23 02:48:50] [INFO ] Redundant transitions in 1 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 02:48:50] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:48:50] [INFO ] Invariant cache hit.
[2024-05-23 02:48:50] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5638 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 6374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 12152ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/161 places, 234/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12407 ms. Remains : 97/161 places, 234/404 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-12
Product exploration explored 100000 steps with 878 reset in 268 ms.
Product exploration explored 100000 steps with 958 reset in 267 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 67 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 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 13204 steps (14 resets) in 23 ms. (550 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 97 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 97 /97 variables (removed 0) and now considering 234/234 (removed 0) transitions.
[2024-05-23 02:49:03] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:49:03] [INFO ] Invariant cache hit.
[2024-05-23 02:49:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 02:49:03] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:49:03] [INFO ] Invariant cache hit.
[2024-05-23 02:49:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-23 02:49:04] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-23 02:49:04] [INFO ] Redundant transitions in 0 ms returned []
Running 232 sub problems to find dead transitions.
[2024-05-23 02:49:04] [INFO ] Flow matrix only has 158 transitions (discarded 76 similar events)
[2024-05-23 02:49:04] [INFO ] Invariant cache hit.
[2024-05-23 02:49:04] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 136 constraints, problems are : Problem set: 0 solved, 232 unsolved in 5474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (OVERLAPS) 158/255 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 232/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (OVERLAPS) 0/255 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 232 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 368 constraints, problems are : Problem set: 0 solved, 232 unsolved in 6555 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 0/0 constraints]
After SMT, in 12162ms problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 12165ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 12363 ms. Remains : 97/97 places, 234/234 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 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 61 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 22649 steps (28 resets) in 31 ms. (707 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 71 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)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 931 reset in 223 ms.
Stack based approach found an accepted trace after 11549 steps with 102 reset with depth 174 and stack size 174 in 31 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-12 finished in 26555 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||G(p1)))))'
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 404/404 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 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 42 place count 140 transition count 338
Iterating global reduction 1 with 6 rules applied. Total rules applied 48 place count 140 transition count 338
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 134 transition count 320
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 134 transition count 320
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 66 place count 128 transition count 308
Iterating global reduction 1 with 6 rules applied. Total rules applied 72 place count 128 transition count 308
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 78 place count 122 transition count 294
Iterating global reduction 1 with 6 rules applied. Total rules applied 84 place count 122 transition count 294
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 89 place count 117 transition count 282
Iterating global reduction 1 with 5 rules applied. Total rules applied 94 place count 117 transition count 282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 99 place count 112 transition count 272
Iterating global reduction 1 with 5 rules applied. Total rules applied 104 place count 112 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 109 transition count 266
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 109 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 108 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 108 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 107 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 107 transition count 262
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 106 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 120 place count 106 transition count 256
Applied a total of 120 rules in 26 ms. Remains 106 /161 variables (removed 55) and now considering 256/404 (removed 148) transitions.
[2024-05-23 02:49:17] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
// Phase 1: matrix 174 rows 106 cols
[2024-05-23 02:49:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:49:17] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-23 02:49:17] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-23 02:49:17] [INFO ] Invariant cache hit.
[2024-05-23 02:49:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-23 02:49:17] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2024-05-23 02:49:17] [INFO ] Redundant transitions in 1 ms returned []
Running 254 sub problems to find dead transitions.
[2024-05-23 02:49:17] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2024-05-23 02:49:17] [INFO ] Invariant cache hit.
[2024-05-23 02:49:17] [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, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6656 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: 254/254 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (OVERLAPS) 0/280 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 402 constraints, problems are : Problem set: 0 solved, 254 unsolved in 7417 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: 254/254 constraints, Known Traps: 0/0 constraints]
After SMT, in 14245ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 14247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/161 places, 256/404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14492 ms. Remains : 106/161 places, 256/404 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : FunctionPointer-PT-b016-LTLFireability-14
Stuttering criterion allowed to conclude after 154 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b016-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b016-LTLFireability-14 finished in 14579 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)||X(p2))))))'
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||G(p1)))))'
[2024-05-23 02:49:31] [INFO ] Flatten gal took : 22 ms
[2024-05-23 02:49:31] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-23 02:49:31] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 161 places, 404 transitions and 1628 arcs took 6 ms.
Total runtime 282394 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-b016

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1405
MODEL NAME: /home/mcc/execution/410/model
161 places, 404 transitions.
Enabling coverability test.

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

BK_STOP 1716432573478

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b016.tgz
mv FunctionPointer-PT-b016 execution
cd execution
if [ "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 ;