Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 11 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 11 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 11 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 179K 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 GPUForwardProgress-PT-36b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-36b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717199045141

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:44:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 23:44:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:44:06] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-31 23:44:06] [INFO ] Transformed 720 places.
[2024-05-31 23:44:06] [INFO ] Transformed 757 transitions.
[2024-05-31 23:44:06] [INFO ] Found NUPN structural information;
[2024-05-31 23:44:06] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 246 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 75 place count 645 transition count 683
Iterating global reduction 1 with 74 rules applied. Total rules applied 149 place count 645 transition count 683
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 181 place count 613 transition count 651
Iterating global reduction 1 with 32 rules applied. Total rules applied 213 place count 613 transition count 651
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 244 place count 613 transition count 620
Applied a total of 244 rules in 153 ms. Remains 613 /720 variables (removed 107) and now considering 620/757 (removed 137) transitions.
// Phase 1: matrix 620 rows 613 cols
[2024-05-31 23:44:06] [INFO ] Computed 37 invariants in 27 ms
[2024-05-31 23:44:07] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-31 23:44:07] [INFO ] Invariant cache hit.
[2024-05-31 23:44:07] [INFO ] Implicit Places using invariants and state equation in 618 ms returned []
Implicit Place search using SMT with State Equation took 1013 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2024-05-31 23:44:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/612 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 2 (OVERLAPS) 620/1232 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 619 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1232 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 619 unsolved
SMT process timed out in 30322ms, After SMT, problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 30345ms
Starting structural reductions in LTL mode, iteration 1 : 613/720 places, 620/757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31537 ms. Remains : 613/720 places, 620/757 transitions.
Support contains 35 out of 613 places after structural reductions.
[2024-05-31 23:44:38] [INFO ] Flatten gal took : 60 ms
[2024-05-31 23:44:38] [INFO ] Flatten gal took : 31 ms
[2024-05-31 23:44:38] [INFO ] Input system was already deterministic with 620 transitions.
Reduction of identical properties reduced properties to check from 32 to 30
RANDOM walk for 40000 steps (129 resets) in 2121 ms. (18 steps per ms) remains 12/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (11 resets) in 163 ms. (243 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (12 resets) in 140 ms. (283 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (12 resets) in 85 ms. (465 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (13 resets) in 79 ms. (500 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (14 resets) in 89 ms. (444 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (13 resets) in 70 ms. (563 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (13 resets) in 110 ms. (360 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 80 ms. (493 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 105 ms. (377 steps per ms) remains 11/11 properties
[2024-05-31 23:44:39] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 598/612 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 620/1232 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1232 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/1233 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1233 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1233/1233 variables, and 650 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1301 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 598/612 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 620/1232 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1232 variables, 11/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1232 variables, 0/660 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/1233 variables, 1/661 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/1233 variables, 0/661 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1233/1233 variables, and 661 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1561 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 2890ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Finished Parikh walk after 677 steps, including 0 resets, run visited all 11 properties in 21 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 11 properties in 29 ms.
Computed a total of 116 stabilizing places and 116 stable transitions
Graph (complete) has 953 edges and 613 vertex of which 573 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.22 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)&&F(G(p1))&&F(p2))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 501 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 567 transition count 313
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 305 rules applied. Total rules applied 604 place count 270 transition count 305
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 608 place count 267 transition count 304
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 610 place count 266 transition count 303
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 610 place count 266 transition count 229
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 758 place count 192 transition count 229
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 793 place count 157 transition count 194
Iterating global reduction 4 with 35 rules applied. Total rules applied 828 place count 157 transition count 194
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 1040 place count 51 transition count 88
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1074 place count 17 transition count 20
Iterating global reduction 4 with 34 rules applied. Total rules applied 1108 place count 17 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1110 place count 16 transition count 20
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1112 place count 14 transition count 18
Applied a total of 1112 rules in 55 ms. Remains 14 /613 variables (removed 599) and now considering 18/620 (removed 602) transitions.
[2024-05-31 23:44:43] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-31 23:44:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:44:43] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 23:44:43] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:44:43] [INFO ] Invariant cache hit.
[2024-05-31 23:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:44:43] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-31 23:44:43] [INFO ] Redundant transitions in 10 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 23:44:43] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-31 23:44:43] [INFO ] Invariant cache hit.
[2024-05-31 23:44:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 3/30 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 15 constraints, problems are : Problem set: 0 solved, 15 unsolved in 113 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 3/30 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 12/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 30 constraints, problems are : Problem set: 0 solved, 15 unsolved in 132 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 253ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 253ms
Starting structural reductions in SI_LTL mode, iteration 1 : 14/613 places, 18/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 367 ms. Remains : 14/613 places, 18/620 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-01
Stuttering criterion allowed to conclude after 20 steps with 3 reset in 5 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-01 finished in 715 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(((p1 U p2)&&(p3 U p4)) U p2)))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 498 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 291 transitions
Trivial Post-agglo rules discarded 291 transitions
Performed 291 trivial Post agglomeration. Transition count delta: 291
Iterating post reduction 0 with 291 rules applied. Total rules applied 293 place count 567 transition count 319
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 298 rules applied. Total rules applied 591 place count 276 transition count 312
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 595 place count 273 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 596 place count 272 transition count 311
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 596 place count 272 transition count 236
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 746 place count 197 transition count 236
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 781 place count 162 transition count 201
Iterating global reduction 4 with 35 rules applied. Total rules applied 816 place count 162 transition count 201
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 1 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1034 place count 53 transition count 92
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 1066 place count 21 transition count 28
Iterating global reduction 4 with 32 rules applied. Total rules applied 1098 place count 21 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1102 place count 19 transition count 28
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 1104 place count 19 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1105 place count 18 transition count 27
Applied a total of 1105 rules in 57 ms. Remains 18 /613 variables (removed 595) and now considering 27/620 (removed 593) transitions.
[2024-05-31 23:44:44] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 18 cols
[2024-05-31 23:44:44] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:44:44] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 23:44:44] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-31 23:44:44] [INFO ] Invariant cache hit.
[2024-05-31 23:44:44] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 23:44:44] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-31 23:44:44] [INFO ] Redundant transitions in 11 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-31 23:44:44] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-31 23:44:44] [INFO ] Invariant cache hit.
[2024-05-31 23:44:44] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 24/41 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/43 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 27 constraints, problems are : Problem set: 0 solved, 25 unsolved in 202 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 24/41 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/42 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 52 constraints, problems are : Problem set: 0 solved, 25 unsolved in 289 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 500ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/613 places, 27/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 633 ms. Remains : 18/613 places, 27/620 transitions.
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p4))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-02
Product exploration explored 100000 steps with 39999 reset in 150 ms.
Product exploration explored 100000 steps with 40017 reset in 118 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/18 stabilizing places and 8/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) p3), (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3)))), (X (NOT p2)), (X p3), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3))), (X (NOT (AND (NOT p0) (NOT p4) (NOT p3)))), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p4) p3)), (X (NOT (AND (NOT p0) (NOT p4) p3))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (AND (NOT p0) (NOT p4) p3))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))))]
Knowledge based reduction with 17 factoid took 846 ms. Reduced automaton from 3 states, 6 edges and 5 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 7 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) p3), (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3)))), (X (NOT p2)), (X p3), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3))), (X (NOT (AND (NOT p0) (NOT p4) (NOT p3)))), (X (NOT p1)), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1 p4) (AND (NOT p0) (NOT p2) p1 p3))))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p4))), (X (X (NOT (AND (NOT p0) (NOT p2) p1 (NOT p4) p3)))), (X (X (NOT (AND (NOT p0) (NOT p4) (NOT p3))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p4) p3)), (X (NOT (AND (NOT p0) (NOT p4) p3))), (X p0), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (AND (NOT p0) (NOT p4) p3))), (X (X (NOT (AND (NOT p0) (NOT p4) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p4) (NOT p3)))))), (F p0)]
Knowledge based reduction with 17 factoid took 806 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 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
[2024-05-31 23:44:47] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-31 23:44:47] [INFO ] Invariant cache hit.
[2024-05-31 23:44:47] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-31 23:44:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 23:44:47] [INFO ] [Real]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-05-31 23:44:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:47] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-31 23:44:47] [INFO ] [Nat]Added 9 Read/Feed constraints in 0 ms returned sat
[2024-05-31 23:44:47] [INFO ] Computed and/alt/rep : 25/50/23 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-31 23:44:47] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 18 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 27/27 (removed 0) transitions.
[2024-05-31 23:44:47] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-31 23:44:47] [INFO ] Invariant cache hit.
[2024-05-31 23:44:47] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-31 23:44:47] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-31 23:44:47] [INFO ] Invariant cache hit.
[2024-05-31 23:44:47] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 23:44:47] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-31 23:44:47] [INFO ] Redundant transitions in 11 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-31 23:44:47] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-31 23:44:47] [INFO ] Invariant cache hit.
[2024-05-31 23:44:47] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 24/41 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 25 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/43 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 27 constraints, problems are : Problem set: 0 solved, 25 unsolved in 195 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (OVERLAPS) 24/41 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 25/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 1/42 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/42 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (OVERLAPS) 1/43 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/43 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 9 (OVERLAPS) 0/43 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 52 constraints, problems are : Problem set: 0 solved, 25 unsolved in 283 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 488ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 488ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 566 ms. Remains : 18/18 places, 27/27 transitions.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/18 stabilizing places and 8/27 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 161 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 62 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 188 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
[2024-05-31 23:44:48] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-31 23:44:48] [INFO ] Invariant cache hit.
[2024-05-31 23:44:48] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-31 23:44:48] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 23:44:48] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2024-05-31 23:44:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 23:44:48] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-31 23:44:48] [INFO ] [Nat]Added 9 Read/Feed constraints in 0 ms returned sat
[2024-05-31 23:44:48] [INFO ] Computed and/alt/rep : 25/50/23 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 23:44:48] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 40014 reset in 49 ms.
Product exploration explored 100000 steps with 40031 reset in 144 ms.
Support contains 1 out of 18 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 18/18 places, 27/27 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 26
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 17 transition count 23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 14 transition count 23
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 10 transition count 19
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 20 place count 10 transition count 15
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 23 place count 7 transition count 9
Iterating global reduction 3 with 3 rules applied. Total rules applied 26 place count 7 transition count 9
Applied a total of 26 rules in 2 ms. Remains 7 /18 variables (removed 11) and now considering 9/27 (removed 18) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-31 23:44:48] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:44:48] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 23:44:48] [INFO ] Invariant cache hit.
[2024-05-31 23:44:48] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-31 23:44:48] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-31 23:44:48] [INFO ] Redundant transitions in 9 ms returned []
Running 7 sub problems to find dead transitions.
[2024-05-31 23:44:48] [INFO ] Invariant cache hit.
[2024-05-31 23:44:48] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/15 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 1/16 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 11 constraints, problems are : Problem set: 0 solved, 7 unsolved in 51 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8/14 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/15 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/16 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 7 unsolved in 55 ms.
Refiners :[State Equation: 7/7 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 108ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 108ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/18 places, 9/27 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 7/18 places, 9/27 transitions.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-02 finished in 4863 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 109 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-31 23:44:49] [INFO ] Computed 37 invariants in 9 ms
[2024-05-31 23:44:49] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 23:44:49] [INFO ] Invariant cache hit.
[2024-05-31 23:44:49] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-31 23:44:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 1.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 1.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 1.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 1.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 1.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 1.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 1.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1238 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60217ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60222ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60845 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 142 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-03 finished in 61005 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 506 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 567 transition count 314
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 306 rules applied. Total rules applied 604 place count 271 transition count 304
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 610 place count 267 transition count 302
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 612 place count 265 transition count 302
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 612 place count 265 transition count 228
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 760 place count 191 transition count 228
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 797 place count 154 transition count 191
Iterating global reduction 4 with 37 rules applied. Total rules applied 834 place count 154 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 834 place count 154 transition count 190
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 836 place count 153 transition count 190
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 1050 place count 46 transition count 83
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1084 place count 12 transition count 15
Iterating global reduction 4 with 34 rules applied. Total rules applied 1118 place count 12 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1120 place count 11 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1121 place count 10 transition count 13
Applied a total of 1121 rules in 38 ms. Remains 10 /613 variables (removed 603) and now considering 13/620 (removed 607) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-31 23:45:49] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:45:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 23:45:49] [INFO ] Invariant cache hit.
[2024-05-31 23:45:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:45:49] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-31 23:45:50] [INFO ] Redundant transitions in 10 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-31 23:45:50] [INFO ] Invariant cache hit.
[2024-05-31 23:45:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 3/22 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/23 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 11 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 12/19 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 3/22 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 7/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/23 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/23 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 19 constraints, problems are : Problem set: 0 solved, 8 unsolved in 61 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/613 places, 13/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 10/613 places, 13/620 transitions.
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-04
Stuttering criterion allowed to conclude after 49 steps with 4 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-04 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0&&X(X((p1||G(F(p2))))))))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 67 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-31 23:45:50] [INFO ] Computed 37 invariants in 8 ms
[2024-05-31 23:45:50] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-31 23:45:50] [INFO ] Invariant cache hit.
[2024-05-31 23:45:50] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-31 23:45:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1238 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60181ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60699 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 377 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-05
Product exploration explored 100000 steps with 16688 reset in 143 ms.
Product exploration explored 100000 steps with 16635 reset in 141 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.8 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Detected a total of 111/600 stabilizing places and 111/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (130 resets) in 382 ms. (104 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (16 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
[2024-05-31 23:46:52] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 594/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 594/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 6 (OVERLAPS) 1/1202 variables, 1/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1202 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1202 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 639 constraints, problems are : Problem set: 1 solved, 1 unsolved in 355 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 677ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 164 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=164 )
Parikh walk visited 1 properties in 2 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 8 states, 12 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 302 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Applied a total of 0 rules in 15 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2024-05-31 23:46:53] [INFO ] Invariant cache hit.
[2024-05-31 23:46:53] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 23:46:53] [INFO ] Invariant cache hit.
[2024-05-31 23:46:54] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-31 23:46:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1238 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60178ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60184ms
Finished structural reductions in LTL mode , in 1 iterations and 60688 ms. Remains : 600/600 places, 602/602 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.7 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Detected a total of 111/600 stabilizing places and 111/602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (129 resets) in 92 ms. (430 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2024-05-31 23:47:54] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 595/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 595/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1201 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/1202 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1202 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1202 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 599ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 164 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=82 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 8 states, 11 edges and 3 AP (stutter sensitive) to 8 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 258 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 267 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 16641 reset in 116 ms.
Product exploration explored 100000 steps with 16674 reset in 122 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 445 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 out of 600 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Graph (trivial) has 485 edges and 600 vertex of which 6 / 600 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 929 edges and 595 vertex of which 555 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 287 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 287 rules applied. Total rules applied 289 place count 555 transition count 593
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 38 Pre rules applied. Total rules applied 289 place count 555 transition count 595
Deduced a syphon composed of 325 places in 1 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 327 place count 555 transition count 595
Discarding 212 places :
Symmetric choice reduction at 1 with 212 rule applications. Total rules 539 place count 343 transition count 383
Deduced a syphon composed of 148 places in 0 ms
Iterating global reduction 1 with 212 rules applied. Total rules applied 751 place count 343 transition count 383
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 786 place count 308 transition count 348
Deduced a syphon composed of 113 places in 0 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 821 place count 308 transition count 348
Performed 110 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 223 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 931 place count 308 transition count 349
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 933 place count 308 transition count 347
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1010 place count 231 transition count 269
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1087 place count 231 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 147 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1088 place count 231 transition count 269
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1089 place count 230 transition count 268
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1090 place count 230 transition count 268
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1126 place count 230 transition count 374
Discarding 69 places :
Symmetric choice reduction at 2 with 69 rule applications. Total rules 1195 place count 161 transition count 236
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 2 with 69 rules applied. Total rules applied 1264 place count 161 transition count 236
Discarding 99 places :
Symmetric choice reduction at 2 with 99 rule applications. Total rules 1363 place count 62 transition count 71
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 2 with 99 rules applied. Total rules applied 1462 place count 62 transition count 71
Deduced a syphon composed of 47 places in 0 ms
Applied a total of 1462 rules in 130 ms. Remains 62 /600 variables (removed 538) and now considering 71/602 (removed 531) transitions.
[2024-05-31 23:47:57] [INFO ] Redundant transitions in 85 ms returned []
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 62 cols
[2024-05-31 23:47:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:47:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 70 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
At refinement iteration 1 (OVERLAPS) 70/131 variables, 61/61 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/131 variables, 1/62 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/62 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/132 variables, 1/63 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/63 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/64 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/64 constraints. Problems are: Problem set: 52 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 64 constraints, problems are : Problem set: 52 solved, 18 unsolved in 804 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 52 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 69/83 variables, 14/14 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 1/15 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 18/33 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/33 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 49/132 variables, 48/81 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/81 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 1/133 variables, 1/82 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/82 constraints. Problems are: Problem set: 52 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/82 constraints. Problems are: Problem set: 52 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 82 constraints, problems are : Problem set: 52 solved, 18 unsolved in 406 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 1233ms problems are : Problem set: 52 solved, 18 unsolved
Search for dead transitions found 52 dead transitions in 1235ms
Found 52 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 52 transitions
Dead transitions reduction (with SMT) removed 52 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/600 places, 19/602 transitions.
Graph (complete) has 44 edges and 62 vertex of which 15 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.0 ms
Discarding 47 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 15 /62 variables (removed 47) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/600 places, 19/602 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1476 ms. Remains : 15/600 places, 19/602 transitions.
Support contains 5 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Applied a total of 0 rules in 15 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-31 23:47:58] [INFO ] Computed 37 invariants in 2 ms
[2024-05-31 23:47:59] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-31 23:47:59] [INFO ] Invariant cache hit.
[2024-05-31 23:47:59] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-31 23:47:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1238 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60166ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60172ms
Finished structural reductions in LTL mode , in 1 iterations and 60787 ms. Remains : 600/600 places, 602/602 transitions.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 189481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((G(p1) U (G(p1)&&p2))))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 41 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-31 23:48:59] [INFO ] Invariant cache hit.
[2024-05-31 23:48:59] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-31 23:48:59] [INFO ] Invariant cache hit.
[2024-05-31 23:49:00] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 452 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-31 23:49:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
SMT process timed out in 30141ms, After SMT, problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 30147ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30642 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-07
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-07 finished in 30899 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 45 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-31 23:49:30] [INFO ] Invariant cache hit.
[2024-05-31 23:49:30] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-31 23:49:30] [INFO ] Invariant cache hit.
[2024-05-31 23:49:31] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-31 23:49:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1238 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60180ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60776 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-09
Entered a terminal (fully accepting) state of product in 71 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-09 finished in 60877 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(((p1&&G(p2))||p0))&&(p3||G(p1)))))'
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 604 transition count 611
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 604 transition count 611
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 21 place count 604 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 601 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 601 transition count 605
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 601 transition count 603
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 600 transition count 602
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 600 transition count 602
Applied a total of 31 rules in 54 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-31 23:50:31] [INFO ] Invariant cache hit.
[2024-05-31 23:50:31] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-05-31 23:50:31] [INFO ] Invariant cache hit.
[2024-05-31 23:50:32] [INFO ] Implicit Places using invariants and state equation in 389 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-31 23:50:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1201 variables, 0/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 1/1202 variables, 1/1238 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 1238 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints]
After SMT, in 60193ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60891 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-10
Entered a terminal (fully accepting) state of product in 24932 steps with 82 reset in 52 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-10 finished in 61159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1))))'
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 505 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 315
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 305 rules applied. Total rules applied 602 place count 272 transition count 305
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 607 place count 268 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 608 place count 267 transition count 304
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 608 place count 267 transition count 230
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 756 place count 193 transition count 230
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 793 place count 156 transition count 193
Iterating global reduction 4 with 37 rules applied. Total rules applied 830 place count 156 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 830 place count 156 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 832 place count 155 transition count 192
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1050 place count 46 transition count 83
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 1083 place count 13 transition count 17
Iterating global reduction 4 with 33 rules applied. Total rules applied 1116 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1118 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1119 place count 11 transition count 15
Applied a total of 1119 rules in 40 ms. Remains 11 /613 variables (removed 602) and now considering 15/620 (removed 605) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-05-31 23:51:32] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:51:32] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 23:51:32] [INFO ] Invariant cache hit.
[2024-05-31 23:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:32] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-31 23:51:32] [INFO ] Redundant transitions in 11 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 23:51:32] [INFO ] Invariant cache hit.
[2024-05-31 23:51:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 3/25 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 1/26 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 73 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 3/25 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 1/26 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/26 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 119 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 197ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/613 places, 15/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 11/613 places, 15/620 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-11
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-11 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 504 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 567 transition count 316
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 304 rules applied. Total rules applied 600 place count 273 transition count 306
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 606 place count 269 transition count 304
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 608 place count 267 transition count 304
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 608 place count 267 transition count 229
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 758 place count 192 transition count 229
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 795 place count 155 transition count 192
Iterating global reduction 4 with 37 rules applied. Total rules applied 832 place count 155 transition count 192
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 832 place count 155 transition count 191
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 834 place count 154 transition count 191
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 0 ms
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 4 with 212 rules applied. Total rules applied 1046 place count 48 transition count 85
Discarding 34 places :
Symmetric choice reduction at 4 with 34 rule applications. Total rules 1080 place count 14 transition count 17
Iterating global reduction 4 with 34 rules applied. Total rules applied 1114 place count 14 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1116 place count 13 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1117 place count 12 transition count 15
Applied a total of 1117 rules in 29 ms. Remains 12 /613 variables (removed 601) and now considering 15/620 (removed 605) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-31 23:51:33] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:51:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 23:51:33] [INFO ] Invariant cache hit.
[2024-05-31 23:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:33] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-31 23:51:33] [INFO ] Redundant transitions in 24 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-31 23:51:33] [INFO ] Invariant cache hit.
[2024-05-31 23:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4/26 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/27 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/27 variables, and 13 constraints, problems are : Problem set: 0 solved, 9 unsolved in 79 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 14/22 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 4/26 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/26 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/27 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/27 variables, and 22 constraints, problems are : Problem set: 0 solved, 9 unsolved in 80 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 173ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/613 places, 15/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 279 ms. Remains : 12/613 places, 15/620 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-12
Stuttering criterion allowed to conclude after 34 steps with 7 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-12 finished in 330 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 U !p1))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 504 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 315
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 305 rules applied. Total rules applied 602 place count 272 transition count 305
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 608 place count 268 transition count 303
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 610 place count 266 transition count 303
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 73 Pre rules applied. Total rules applied 610 place count 266 transition count 230
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 756 place count 193 transition count 230
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 793 place count 156 transition count 193
Iterating global reduction 4 with 37 rules applied. Total rules applied 830 place count 156 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 830 place count 156 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 832 place count 155 transition count 192
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 1048 place count 47 transition count 84
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 1080 place count 15 transition count 20
Iterating global reduction 4 with 32 rules applied. Total rules applied 1112 place count 15 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1114 place count 14 transition count 19
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1115 place count 14 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1116 place count 13 transition count 18
Applied a total of 1116 rules in 26 ms. Remains 13 /613 variables (removed 600) and now considering 18/620 (removed 602) transitions.
// Phase 1: matrix 18 rows 13 cols
[2024-05-31 23:51:33] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:51:33] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 23:51:33] [INFO ] Invariant cache hit.
[2024-05-31 23:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:51:33] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-31 23:51:33] [INFO ] Redundant transitions in 12 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-31 23:51:33] [INFO ] Invariant cache hit.
[2024-05-31 23:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 4/30 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 11 unsolved in 87 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 17/26 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 4/30 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 9/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 25 constraints, problems are : Problem set: 0 solved, 11 unsolved in 95 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 187ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 188ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/613 places, 18/620 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 275 ms. Remains : 13/613 places, 18/620 transitions.
Stuttering acceptance computed with spot in 143 ms :[p1, p1]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-13
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-13 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 605 transition count 612
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 605 transition count 612
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 19 place count 605 transition count 609
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 603 transition count 607
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 603 transition count 607
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 603 transition count 606
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 602 transition count 605
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 602 transition count 605
Applied a total of 26 rules in 44 ms. Remains 602 /613 variables (removed 11) and now considering 605/620 (removed 15) transitions.
// Phase 1: matrix 605 rows 602 cols
[2024-05-31 23:51:33] [INFO ] Computed 37 invariants in 5 ms
[2024-05-31 23:51:33] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 23:51:33] [INFO ] Invariant cache hit.
[2024-05-31 23:51:34] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-05-31 23:51:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (OVERLAPS) 1/1207 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1207/1207 variables, and 639 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1206 variables, 0/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 5 (OVERLAPS) 1/1207 variables, 1/1243 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1207/1207 variables, and 1243 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints]
After SMT, in 60189ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60196ms
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 605/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 602/613 places, 605/620 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-14
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-14 finished in 60862 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(F((!p0 U (G(!p0)||(!p0&&(p1 U (p2||G(p1))))))))))'
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 606 transition count 613
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 606 transition count 613
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 15 place count 606 transition count 612
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 603 transition count 609
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 603 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 23 place count 603 transition count 607
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 24 place count 602 transition count 606
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 602 transition count 606
Applied a total of 25 rules in 49 ms. Remains 602 /613 variables (removed 11) and now considering 606/620 (removed 14) transitions.
// Phase 1: matrix 606 rows 602 cols
[2024-05-31 23:52:34] [INFO ] Computed 37 invariants in 7 ms
[2024-05-31 23:52:34] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-31 23:52:34] [INFO ] Invariant cache hit.
[2024-05-31 23:52:35] [INFO ] Implicit Places using invariants and state equation in 379 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-31 23:52:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Error getting values : (error "ParserException while parsing response: ((s1 3.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 0.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 timeout
1.0)
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
SMT process timed out in 30134ms, After SMT, problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 30145ms
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 606/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30740 ms. Remains : 602/613 places, 606/620 transitions.
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0, (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-15
Product exploration explored 100000 steps with 324 reset in 221 ms.
Product exploration explored 100000 steps with 327 reset in 283 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 939 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 98 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (130 resets) in 256 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (14 resets) in 176 ms. (226 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 72 ms. (547 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 72 ms. (548 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 143 ms. (277 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (12 resets) in 82 ms. (481 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 294964 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :4 out of 7
Probabilistic random walk after 294964 steps, saw 139672 distinct states, run finished after 3004 ms. (steps per millisecond=98 ) properties seen :4
[2024-05-31 23:53:09] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 506/601 variables, 34/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/1208 variables, 1/639 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 639 constraints, problems are : Problem set: 1 solved, 2 unsolved in 438 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 506/601 variables, 34/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 2/640 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1207 variables, 0/640 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/1208 variables, 1/641 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1208 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 641 constraints, problems are : Problem set: 1 solved, 2 unsolved in 368 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 814ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 168 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=42 )
Parikh walk visited 2 properties in 4 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (G (OR (NOT p0) (NOT p1) p2))]
False Knowledge obtained : [(F p0), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR (NOT p0) p1 p2))), (F p1), (F p2), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
Knowledge based reduction with 7 factoid took 387 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Applied a total of 0 rules in 10 ms. Remains 602 /602 variables (removed 0) and now considering 606/606 (removed 0) transitions.
[2024-05-31 23:53:11] [INFO ] Invariant cache hit.
[2024-05-31 23:53:11] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-31 23:53:11] [INFO ] Invariant cache hit.
[2024-05-31 23:53:11] [INFO ] Implicit Places using invariants and state equation in 367 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-31 23:53:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
SMT process timed out in 30127ms, After SMT, problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 30135ms
Finished structural reductions in LTL mode , in 1 iterations and 30669 ms. Remains : 602/602 places, 606/606 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 939 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (130 resets) in 615 ms. (64 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (12 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 104 ms. (380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
[2024-05-31 23:53:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 506/601 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/1208 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/1208 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 639 constraints, problems are : Problem set: 0 solved, 3 unsolved in 492 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 92/95 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 506/601 variables, 34/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1207 variables, 3/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1207 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/1208 variables, 1/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1208 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1208 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 642 constraints, problems are : Problem set: 0 solved, 3 unsolved in 468 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 967ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 190 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 7 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F p1), (F p2), (F p0), (F (NOT (OR (NOT p0) p2)))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 179 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 189 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 329 reset in 195 ms.
Product exploration explored 100000 steps with 325 reset in 315 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 182 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Graph (trivial) has 489 edges and 602 vertex of which 6 / 602 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 933 edges and 597 vertex of which 557 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 286 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 286 rules applied. Total rules applied 288 place count 557 transition count 597
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 40 Pre rules applied. Total rules applied 288 place count 557 transition count 601
Deduced a syphon composed of 326 places in 1 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 328 place count 557 transition count 601
Discarding 210 places :
Symmetric choice reduction at 1 with 210 rule applications. Total rules 538 place count 347 transition count 391
Deduced a syphon composed of 151 places in 1 ms
Iterating global reduction 1 with 210 rules applied. Total rules applied 748 place count 347 transition count 391
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 783 place count 312 transition count 356
Deduced a syphon composed of 116 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 818 place count 312 transition count 356
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 112 rules applied. Total rules applied 930 place count 312 transition count 357
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 932 place count 312 transition count 355
Discarding 77 places :
Symmetric choice reduction at 2 with 77 rule applications. Total rules 1009 place count 235 transition count 277
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 77 rules applied. Total rules applied 1086 place count 235 transition count 277
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1087 place count 235 transition count 277
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1088 place count 234 transition count 276
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1089 place count 234 transition count 276
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -107
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 2 with 36 rules applied. Total rules applied 1125 place count 234 transition count 383
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 1195 place count 164 transition count 243
Deduced a syphon composed of 149 places in 0 ms
Iterating global reduction 2 with 70 rules applied. Total rules applied 1265 place count 164 transition count 243
Discarding 96 places :
Symmetric choice reduction at 2 with 96 rule applications. Total rules 1361 place count 68 transition count 83
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 96 rules applied. Total rules applied 1457 place count 68 transition count 83
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 1457 rules in 63 ms. Remains 68 /602 variables (removed 534) and now considering 83/606 (removed 523) transitions.
[2024-05-31 23:53:45] [INFO ] Redundant transitions in 11 ms returned []
Running 82 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 68 cols
[2024-05-31 23:53:45] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:53:45] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
At refinement iteration 1 (OVERLAPS) 82/149 variables, 67/67 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 12/79 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 0/79 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1/150 variables, 1/80 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/80 constraints. Problems are: Problem set: 59 solved, 23 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/81 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 0/81 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 0/151 variables, 0/81 constraints. Problems are: Problem set: 59 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 81 constraints, problems are : Problem set: 59 solved, 23 unsolved in 549 ms.
Refiners :[State Equation: 68/68 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 59 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 1 (OVERLAPS) 81/95 variables, 14/14 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 12/26 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 23/49 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/49 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 55/150 variables, 54/103 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/103 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/104 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/104 constraints. Problems are: Problem set: 59 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/104 constraints. Problems are: Problem set: 59 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 104 constraints, problems are : Problem set: 59 solved, 23 unsolved in 531 ms.
Refiners :[State Equation: 68/68 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 23/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 1099ms problems are : Problem set: 59 solved, 23 unsolved
Search for dead transitions found 59 dead transitions in 1100ms
Found 59 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 59 transitions
Dead transitions reduction (with SMT) removed 59 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 68/602 places, 24/606 transitions.
Graph (complete) has 52 edges and 68 vertex of which 15 are kept as prefixes of interest. Removing 53 places using SCC suffix rule.1 ms
Discarding 53 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 15 /68 variables (removed 53) and now considering 24/24 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/602 places, 24/606 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1190 ms. Remains : 15/602 places, 24/606 transitions.
Support contains 3 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 606/606 transitions.
Applied a total of 0 rules in 14 ms. Remains 602 /602 variables (removed 0) and now considering 606/606 (removed 0) transitions.
// Phase 1: matrix 606 rows 602 cols
[2024-05-31 23:53:46] [INFO ] Computed 37 invariants in 7 ms
[2024-05-31 23:53:46] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-31 23:53:46] [INFO ] Invariant cache hit.
[2024-05-31 23:53:47] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-31 23:53:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 2 (OVERLAPS) 606/1207 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1207 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 605 unsolved
SMT process timed out in 30130ms, After SMT, problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 30137ms
Finished structural reductions in LTL mode , in 1 iterations and 30667 ms. Remains : 602/602 places, 606/606 transitions.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-15 finished in 102615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||(((p1 U p2)&&(p3 U p4)) U 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' '!(X(X(G((p0&&X(X((p1||G(F(p2))))))))))'
Found a Lengthening insensitive property : GPUForwardProgress-PT-36b-LTLFireability-05
Stuttering acceptance computed with spot in 326 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))), true, (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 5 out of 613 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 502 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 298 place count 567 transition count 314
Reduce places removed 296 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 306 rules applied. Total rules applied 604 place count 271 transition count 304
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 608 place count 267 transition count 304
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 74 Pre rules applied. Total rules applied 608 place count 267 transition count 230
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 756 place count 193 transition count 230
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 793 place count 156 transition count 193
Iterating global reduction 3 with 37 rules applied. Total rules applied 830 place count 156 transition count 193
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 1044 place count 49 transition count 86
Discarding 33 places :
Symmetric choice reduction at 3 with 33 rule applications. Total rules 1077 place count 16 transition count 20
Iterating global reduction 3 with 33 rules applied. Total rules applied 1110 place count 16 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1112 place count 15 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1113 place count 14 transition count 18
Applied a total of 1113 rules in 44 ms. Remains 14 /613 variables (removed 599) and now considering 18/620 (removed 602) transitions.
// Phase 1: matrix 18 rows 14 cols
[2024-05-31 23:54:17] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:54:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 23:54:17] [INFO ] Invariant cache hit.
[2024-05-31 23:54:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:54:17] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 14 sub problems to find dead transitions.
[2024-05-31 23:54:17] [INFO ] Invariant cache hit.
[2024-05-31 23:54:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/31 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 1/32 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 15 constraints, problems are : Problem set: 0 solved, 14 unsolved in 108 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 17/27 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/31 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 12/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 29 constraints, problems are : Problem set: 0 solved, 14 unsolved in 208 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 324ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 324ms
Starting structural reductions in LI_LTL mode, iteration 1 : 14/613 places, 18/620 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 466 ms. Remains : 14/613 places, 18/620 transitions.
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-05
Stuttering criterion allowed to conclude after 41 steps with 5 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 908 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-05 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
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(F((!p0 U (G(!p0)||(!p0&&(p1 U (p2||G(p1))))))))))'
Found a Shortening insensitive property : GPUForwardProgress-PT-36b-LTLFireability-15
Stuttering acceptance computed with spot in 193 ms :[p0, p0, p0, (AND (NOT p2) (NOT p1) p0)]
Support contains 3 out of 613 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 613/613 places, 620/620 transitions.
Graph (trivial) has 503 edges and 613 vertex of which 6 / 613 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 947 edges and 608 vertex of which 568 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 567 transition count 315
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 301 rules applied. Total rules applied 598 place count 272 transition count 309
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 601 place count 270 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 602 place count 269 transition count 308
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 74 Pre rules applied. Total rules applied 602 place count 269 transition count 234
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 750 place count 195 transition count 234
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 787 place count 158 transition count 197
Iterating global reduction 4 with 37 rules applied. Total rules applied 824 place count 158 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 824 place count 158 transition count 196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 826 place count 157 transition count 196
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 107
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 1040 place count 50 transition count 89
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 1072 place count 18 transition count 25
Iterating global reduction 4 with 32 rules applied. Total rules applied 1104 place count 18 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 1110 place count 15 transition count 24
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1114 place count 15 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1115 place count 14 transition count 23
Applied a total of 1115 rules in 23 ms. Remains 14 /613 variables (removed 599) and now considering 23/620 (removed 597) transitions.
[2024-05-31 23:54:18] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 14 cols
[2024-05-31 23:54:18] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 23:54:18] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 23:54:18] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-05-31 23:54:18] [INFO ] Invariant cache hit.
[2024-05-31 23:54:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:54:18] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Running 13 sub problems to find dead transitions.
[2024-05-31 23:54:18] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2024-05-31 23:54:18] [INFO ] Invariant cache hit.
[2024-05-31 23:54:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/34 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 1/35 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/35 variables, and 15 constraints, problems are : Problem set: 0 solved, 13 unsolved in 99 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/34 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 10/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/34 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 1/35 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/35 variables, and 28 constraints, problems are : Problem set: 0 solved, 13 unsolved in 109 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 213ms
Starting structural reductions in LI_LTL mode, iteration 1 : 14/613 places, 23/620 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 300 ms. Remains : 14/613 places, 23/620 transitions.
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-15
Stuttering criterion allowed to conclude after 229 steps with 15 reset in 0 ms.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-15 finished in 641 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 23:54:18] [INFO ] Flatten gal took : 28 ms
[2024-05-31 23:54:18] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 23:54:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 613 places, 620 transitions and 1601 arcs took 10 ms.
Total runtime 612697 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA GPUForwardProgress-PT-36b-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-36b-LTLFireability-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA GPUForwardProgress-PT-36b-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717200633493

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name GPUForwardProgress-PT-36b-LTLFireability-02
ltl formula formula --ltl=/tmp/1856/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 613 places, 620 transitions and 1601 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1856/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1856/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1856/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.010 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1856/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 615 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 614, there are 710 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~296 levels ~10000 states ~30816 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~20000 states ~60968 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~40000 states ~116340 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~80000 states ~234696 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~160000 states ~491316 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~320000 states ~1000404 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~640000 states ~2149740 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~1280000 states ~4452632 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~2560000 states ~9531140 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~5120000 states ~19699952 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~10240000 states ~40041092 transitions
pnml2lts-mc( 1/ 4): ~295 levels ~20480000 states ~85157236 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33540113
pnml2lts-mc( 0/ 4): unique states count: 33541185
pnml2lts-mc( 0/ 4): unique transitions count: 141765363
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 108210933
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33541204
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1181
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33541204 states 141765405 transitions, fanout: 4.227
pnml2lts-mc( 0/ 4): Total exploration time 542.490 sec (542.470 sec minimum, 542.480 sec on average)
pnml2lts-mc( 0/ 4): States per second: 61828, Transitions per second: 261324
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 260.1MB, 8.1 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/6.0%
pnml2lts-mc( 0/ 4): Stored 632 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 260.1MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-36b-LTLFireability-05
ltl formula formula --ltl=/tmp/1856/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 613 places, 620 transitions and 1601 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1856/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1856/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1856/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1856/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 615 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 614, there are 659 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~298 levels ~10000 states ~40060 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~20000 states ~82208 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~40000 states ~173056 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~80000 states ~380976 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~160000 states ~787128 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~320000 states ~1729604 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~640000 states ~3723408 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~1280000 states ~7810996 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~2560000 states ~16157868 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~5120000 states ~33758440 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~10240000 states ~71814348 transitions
pnml2lts-mc( 0/ 4): ~298 levels ~20480000 states ~147311496 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 22400283
pnml2lts-mc( 0/ 4): unique states count: 27479810
pnml2lts-mc( 0/ 4): unique transitions count: 199487049
pnml2lts-mc( 0/ 4): - self-loop count: 358
pnml2lts-mc( 0/ 4): - claim dead count: 143456597
pnml2lts-mc( 0/ 4): - claim found count: 21713618
pnml2lts-mc( 0/ 4): - claim success count: 27479825
pnml2lts-mc( 0/ 4): - cum. max stack depth: 2217569
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27479825 states 199487128 transitions, fanout: 7.259
pnml2lts-mc( 0/ 4): Total exploration time 404.570 sec (404.560 sec minimum, 404.568 sec on average)
pnml2lts-mc( 0/ 4): States per second: 67924, Transitions per second: 493084
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 267.6MB, 8.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/18.0%
pnml2lts-mc( 0/ 4): Stored 632 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 267.6MB (~256.0MB paged-in)
ltl formula name GPUForwardProgress-PT-36b-LTLFireability-15
ltl formula formula --ltl=/tmp/1856/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 613 places, 620 transitions and 1601 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.030 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1856/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1856/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1856/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1856/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 614 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 614, there are 656 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~298 levels ~10000 states ~79824 transitions
pnml2lts-mc( 1/ 4): ~298 levels ~20000 states ~165544 transitions
pnml2lts-mc( 1/ 4): ~298 levels ~40000 states ~347328 transitions
pnml2lts-mc( 1/ 4): ~298 levels ~80000 states ~763200 transitions
pnml2lts-mc( 1/ 4): ~298 levels ~160000 states ~1584376 transitions
pnml2lts-mc( 1/ 4): ~298 levels ~320000 states ~3403112 transitions
pnml2lts-mc( 1/ 4): ~298 levels ~640000 states ~7234112 transitions
pnml2lts-mc( 1/ 4): ~298 levels ~1280000 states ~14909152 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~230424!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 900963
pnml2lts-mc( 0/ 4): unique states count: 1582992
pnml2lts-mc( 0/ 4): unique transitions count: 20539498
pnml2lts-mc( 0/ 4): - self-loop count: 284
pnml2lts-mc( 0/ 4): - claim dead count: 10145415
pnml2lts-mc( 0/ 4): - claim found count: 5772649
pnml2lts-mc( 0/ 4): - claim success count: 1583004
pnml2lts-mc( 0/ 4): - cum. max stack depth: 423548
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1583005 states 20539559 transitions, fanout: 12.975
pnml2lts-mc( 0/ 4): Total exploration time 25.320 sec (25.320 sec minimum, 25.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 62520, Transitions per second: 811199
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 22.4MB, 8.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 8.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 632 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 22.4MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is GPUForwardProgress-PT-36b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r496-tall-171640603800604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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