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.r180-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 itstools
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 r180-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 1716514175245

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 01:29:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 01:29:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 01:29:36] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2024-05-24 01:29:36] [INFO ] Transformed 720 places.
[2024-05-24 01:29:36] [INFO ] Transformed 757 transitions.
[2024-05-24 01:29:36] [INFO ] Found NUPN structural information;
[2024-05-24 01:29:36] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 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 139 ms. Remains 613 /720 variables (removed 107) and now considering 620/757 (removed 137) transitions.
// Phase 1: matrix 620 rows 613 cols
[2024-05-24 01:29:36] [INFO ] Computed 37 invariants in 27 ms
[2024-05-24 01:29:37] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-24 01:29:37] [INFO ] Invariant cache hit.
[2024-05-24 01:29:37] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Running 619 sub problems to find dead transitions.
[2024-05-24 01:29:37] [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 30290ms, After SMT, problems are : Problem set: 0 solved, 619 unsolved
Search for dead transitions found 0 dead transitions in 30310ms
Starting structural reductions in LTL mode, iteration 1 : 613/720 places, 620/757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31287 ms. Remains : 613/720 places, 620/757 transitions.
Support contains 35 out of 613 places after structural reductions.
[2024-05-24 01:30:08] [INFO ] Flatten gal took : 60 ms
[2024-05-24 01:30:08] [INFO ] Flatten gal took : 32 ms
[2024-05-24 01:30:08] [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 2888 ms. (13 steps per ms) remains 10/30 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (13 resets) in 125 ms. (317 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (13 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (12 resets) in 97 ms. (408 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (13 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (12 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (13 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
[2024-05-24 01:30:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 601/612 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 620/1232 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1232 variables, 0/649 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/1233 variables, 1/650 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/1233 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1233/1233 variables, and 650 constraints, problems are : Problem set: 0 solved, 9 unsolved in 768 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 613/613 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 601/612 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/612 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 620/1232 variables, 612/649 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1232 variables, 9/658 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1232 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 1/1233 variables, 1/659 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/1233 variables, 0/659 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1233/1233 variables, and 659 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1352 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 613/613 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 2147ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 2 different solutions.
Finished Parikh walk after 891 steps, including 0 resets, run visited all 9 properties in 21 ms. (steps per millisecond=42 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 30 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.26 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.3 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 1 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 60 ms. Remains 14 /613 variables (removed 599) and now considering 18/620 (removed 602) transitions.
[2024-05-24 01:30:12] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
// Phase 1: matrix 17 rows 14 cols
[2024-05-24 01:30:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:30:12] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-24 01:30:12] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 01:30:12] [INFO ] Invariant cache hit.
[2024-05-24 01:30:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:30:12] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-24 01:30:12] [INFO ] Redundant transitions in 13 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-24 01:30:12] [INFO ] Flow matrix only has 17 transitions (discarded 1 similar events)
[2024-05-24 01:30:12] [INFO ] Invariant cache hit.
[2024-05-24 01:30:12] [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 109 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 134 ms.
Refiners :[State Equation: 14/14 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 252ms 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 382 ms. Remains : 14/613 places, 18/620 transitions.
Stuttering acceptance computed with spot in 292 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 4 steps with 0 reset in 3 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-01 finished in 740 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 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 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 0 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 53 ms. Remains 18 /613 variables (removed 595) and now considering 27/620 (removed 593) transitions.
[2024-05-24 01:30:13] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
// Phase 1: matrix 25 rows 18 cols
[2024-05-24 01:30:13] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 01:30:13] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 01:30:13] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 01:30:13] [INFO ] Invariant cache hit.
[2024-05-24 01:30:13] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 01:30:13] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 01:30:13] [INFO ] Redundant transitions in 11 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-24 01:30:13] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 01:30:13] [INFO ] Invariant cache hit.
[2024-05-24 01:30:13] [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 194 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 290 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 493ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 494ms
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 612 ms. Remains : 18/613 places, 27/620 transitions.
Stuttering acceptance computed with spot in 133 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 40034 reset in 196 ms.
Product exploration explored 100000 steps with 39975 reset in 115 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 764 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 6 steps (0 resets) in 4 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 838 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2024-05-24 01:30:15] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 01:30:15] [INFO ] Invariant cache hit.
[2024-05-24 01:30:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 01:30:15] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 01:30:15] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2024-05-24 01:30:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:30:15] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 01:30:15] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 01:30:15] [INFO ] Computed and/alt/rep : 25/50/23 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 01:30:15] [INFO ] Added : 0 causal constraints over 0 iterations in 6 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-24 01:30:15] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 01:30:15] [INFO ] Invariant cache hit.
[2024-05-24 01:30:16] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 01:30:16] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 01:30:16] [INFO ] Invariant cache hit.
[2024-05-24 01:30:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 01:30:16] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 01:30:16] [INFO ] Redundant transitions in 11 ms returned []
Running 25 sub problems to find dead transitions.
[2024-05-24 01:30:16] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 01:30:16] [INFO ] Invariant cache hit.
[2024-05-24 01:30:16] [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 186 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 259 ms.
Refiners :[State Equation: 18/18 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 454ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 455ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 538 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 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 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 353 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-24 01:30:17] [INFO ] Flow matrix only has 25 transitions (discarded 2 similar events)
[2024-05-24 01:30:17] [INFO ] Invariant cache hit.
[2024-05-24 01:30:17] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 01:30:17] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-24 01:30:17] [INFO ] [Real]Added 9 Read/Feed constraints in 4 ms returned sat
[2024-05-24 01:30:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 01:30:17] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-24 01:30:17] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-24 01:30:17] [INFO ] Computed and/alt/rep : 25/50/23 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 01:30:17] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 40016 reset in 50 ms.
Product exploration explored 100000 steps with 40006 reset in 142 ms.
Built C files in :
/tmp/ltsmin11840146887596788564
[2024-05-24 01:30:17] [INFO ] Computing symmetric may disable matrix : 27 transitions.
[2024-05-24 01:30:17] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:30:17] [INFO ] Computing symmetric may enable matrix : 27 transitions.
[2024-05-24 01:30:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:30:17] [INFO ] Computing Do-Not-Accords matrix : 27 transitions.
[2024-05-24 01:30:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 01:30:17] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11840146887596788564
Running compilation step : cd /tmp/ltsmin11840146887596788564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin11840146887596788564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11840146887596788564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1467602783765180537.hoa' '--buchi-type=spotba'
LTSmin run took 74 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-02 finished in 5029 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 107 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-24 01:30:18] [INFO ] Computed 37 invariants in 10 ms
[2024-05-24 01:30:18] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-05-24 01:30:18] [INFO ] Invariant cache hit.
[2024-05-24 01:30:18] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-24 01:30:18] [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 30033 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 60222ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60948 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 110 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 61075 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 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.5 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 0 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 41 ms. Remains 10 /613 variables (removed 603) and now considering 13/620 (removed 607) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-24 01:31:19] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:31:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-24 01:31:19] [INFO ] Invariant cache hit.
[2024-05-24 01:31:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:31:19] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-24 01:31:19] [INFO ] Redundant transitions in 12 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 01:31:19] [INFO ] Invariant cache hit.
[2024-05-24 01:31:19] [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 63 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 62 ms.
Refiners :[State Equation: 10/10 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 157ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 158ms
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 337 ms. Remains : 10/613 places, 13/620 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-04
Stuttering criterion allowed to conclude after 32 steps with 3 reset in 7 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-04 finished in 391 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 49 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-24 01:31:19] [INFO ] Computed 37 invariants in 3 ms
[2024-05-24 01:31:19] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-24 01:31:19] [INFO ] Invariant cache hit.
[2024-05-24 01:31:20] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-24 01:31:20] [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 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 1.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 1.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 1.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 1.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 1.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 1.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 1.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 1.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 1.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 1.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 1.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 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 30032 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 60179ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60189ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60765 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 283 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 16691 reset in 130 ms.
Product exploration explored 100000 steps with 16646 reset in 126 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.6 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 98 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 283 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 (128 resets) in 250 ms. (159 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (14 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
[2024-05-24 01:32:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 226/228 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 371/599 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (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 250 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 226/228 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 371/599 variables, 25/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1201 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Int declared 1202/1202 variables, and 638 constraints, problems are : Problem set: 1 solved, 0 unsolved in 222 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 479ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (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 198 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 269 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 284 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 13 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2024-05-24 01:32:22] [INFO ] Invariant cache hit.
[2024-05-24 01:32:22] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-05-24 01:32:22] [INFO ] Invariant cache hit.
[2024-05-24 01:32:23] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-24 01:32:23] [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 30016 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 60154ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60160ms
Finished structural reductions in LTL mode , in 1 iterations and 60618 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.5 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 97 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 269 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 81 ms. (487 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
[2024-05-24 01:33:23] [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 233 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 307 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 547ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 181 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 2 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 201 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 281 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 273 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 16659 reset in 114 ms.
Product exploration explored 100000 steps with 16704 reset in 128 ms.
Applying partial POR strategy [false, false, false, true, false, true, true, true]
Stuttering acceptance computed with spot in 247 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 2 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.5 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 1 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 112 ms. Remains 62 /600 variables (removed 538) and now considering 71/602 (removed 531) transitions.
[2024-05-24 01:33:25] [INFO ] Redundant transitions in 22 ms returned []
Running 70 sub problems to find dead transitions.
// Phase 1: matrix 71 rows 62 cols
[2024-05-24 01:33:25] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 01:33:25] [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 417 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 364 ms.
Refiners :[State Equation: 62/62 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 18/70 constraints, Known Traps: 0/0 constraints]
After SMT, in 791ms problems are : Problem set: 52 solved, 18 unsolved
Search for dead transitions found 52 dead transitions in 794ms
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 2 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 934 ms. Remains : 15/600 places, 19/602 transitions.
Built C files in :
/tmp/ltsmin18010638585101428766
[2024-05-24 01:33:26] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18010638585101428766
Running compilation step : cd /tmp/ltsmin18010638585101428766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1037 ms.
Running link step : cd /tmp/ltsmin18010638585101428766;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin18010638585101428766;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9733191079102610998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 13 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
// Phase 1: matrix 602 rows 600 cols
[2024-05-24 01:33:41] [INFO ] Computed 37 invariants in 2 ms
[2024-05-24 01:33:42] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-05-24 01:33:42] [INFO ] Invariant cache hit.
[2024-05-24 01:33:42] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-24 01:33:42] [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: (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 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
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 60159ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60164ms
Finished structural reductions in LTL mode , in 1 iterations and 60619 ms. Remains : 600/600 places, 602/602 transitions.
Built C files in :
/tmp/ltsmin10413743230002128610
[2024-05-24 01:34:42] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10413743230002128610
Running compilation step : cd /tmp/ltsmin10413743230002128610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1001 ms.
Running link step : cd /tmp/ltsmin10413743230002128610;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10413743230002128610;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1716496769662608684.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 01:34:57] [INFO ] Flatten gal took : 26 ms
[2024-05-24 01:34:57] [INFO ] Flatten gal took : 25 ms
[2024-05-24 01:34:57] [INFO ] Time to serialize gal into /tmp/LTL16573761732796108257.gal : 5 ms
[2024-05-24 01:34:57] [INFO ] Time to serialize properties into /tmp/LTL16557290740859300689.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16573761732796108257.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18079889021912292349.hoa' '-atoms' '/tmp/LTL16557290740859300689.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16557290740859300689.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18079889021912292349.hoa
Detected timeout of ITS tools.
[2024-05-24 01:35:12] [INFO ] Flatten gal took : 21 ms
[2024-05-24 01:35:12] [INFO ] Flatten gal took : 20 ms
[2024-05-24 01:35:12] [INFO ] Time to serialize gal into /tmp/LTL12171769346254639312.gal : 4 ms
[2024-05-24 01:35:12] [INFO ] Time to serialize properties into /tmp/LTL8828199266932465987.ltl : 11 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12171769346254639312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8828199266932465987.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X(("(p26==0)")||(G(F("(p193==0)"))))))&&("(((p193==0)||(p624==0))||((p701==0)||(p716==0)))"))))))
Formula 0 simplified : XXF(!"(((p193==0)||(p624==0))||((p701==0)||(p716==0)))" | XX(!"(p26==0)" & FG!"(p193==0)"))
Detected timeout of ITS tools.
[2024-05-24 01:35:27] [INFO ] Flatten gal took : 23 ms
[2024-05-24 01:35:27] [INFO ] Applying decomposition
[2024-05-24 01:35:28] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9784974431625722206.txt' '-o' '/tmp/graph9784974431625722206.bin' '-w' '/tmp/graph9784974431625722206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9784974431625722206.bin' '-l' '-1' '-v' '-w' '/tmp/graph9784974431625722206.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:35:28] [INFO ] Decomposing Gal with order
[2024-05-24 01:35:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:35:28] [INFO ] Removed a total of 187 redundant transitions.
[2024-05-24 01:35:28] [INFO ] Flatten gal took : 65 ms
[2024-05-24 01:35:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 6 ms.
[2024-05-24 01:35:28] [INFO ] Time to serialize gal into /tmp/LTL14948066516479819784.gal : 10 ms
[2024-05-24 01:35:28] [INFO ] Time to serialize properties into /tmp/LTL12475804086241687873.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14948066516479819784.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12475804086241687873.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(G((X(X(("(i16.i2.u10.p26==0)")||(G(F("(i9.i1.u72.p193==0)"))))))&&("(((i9.i1.u72.p193==0)||(i34.i1.u225.p624==0))||((i38.i1.u24...197
Formula 0 simplified : XXF(!"(((i9.i1.u72.p193==0)||(i34.i1.u225.p624==0))||((i38.i1.u249.p701==0)||(i38.i1.u253.p716==0)))" | XX(!"(i16.i2.u10.p26==0)" & ...181
Reverse transition relation is NOT exact ! Due to transitions t546, i1.t541, i1.i1.u15.t534, i2.t528, i2.i2.t519, i3.t512, i3.i2.t505, i4.t498, i4.i1.u40.t...1179
Computing Next relation with stutter on 3.00189e+17 deadlock states
298 unique states visited
298 strongly connected components in search stack
299 transitions explored
298 items max in DFS search stack
1368 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,13.7432,442500,1,0,912856,372,5577,1.33548e+06,159,1216,1577013
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-05 finished in 263874 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 48 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-24 01:35:43] [INFO ] Invariant cache hit.
[2024-05-24 01:35:43] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-24 01:35:43] [INFO ] Invariant cache hit.
[2024-05-24 01:35:43] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-24 01:35:43] [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 30021 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 60189ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60197ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60759 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 177 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 2 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-07 finished in 60964 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 47 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-24 01:36:44] [INFO ] Invariant cache hit.
[2024-05-24 01:36:44] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-24 01:36:44] [INFO ] Invariant cache hit.
[2024-05-24 01:36:44] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-24 01:36:44] [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 30030 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 60170ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60710 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 122 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 65 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 60848 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 45 ms. Remains 600 /613 variables (removed 13) and now considering 602/620 (removed 18) transitions.
[2024-05-24 01:37:45] [INFO ] Invariant cache hit.
[2024-05-24 01:37:45] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-24 01:37:45] [INFO ] Invariant cache hit.
[2024-05-24 01:37:45] [INFO ] Implicit Places using invariants and state equation in 304 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2024-05-24 01:37:45] [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 30016 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 30030 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 60169ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 600/613 places, 602/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60667 ms. Remains : 600/613 places, 602/620 transitions.
Stuttering acceptance computed with spot in 214 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 11211 steps with 35 reset in 24 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-10 finished in 60925 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 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.3 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 28 ms. Remains 11 /613 variables (removed 602) and now considering 15/620 (removed 605) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-05-24 01:38:46] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:38:46] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 01:38:46] [INFO ] Invariant cache hit.
[2024-05-24 01:38:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:38:46] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 01:38:46] [INFO ] Redundant transitions in 10 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-24 01:38:46] [INFO ] Invariant cache hit.
[2024-05-24 01:38:46] [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 67 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 85 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 156ms
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 245 ms. Remains : 11/613 places, 15/620 transitions.
Stuttering acceptance computed with spot in 268 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 5 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 525 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 0 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 24 ms. Remains 12 /613 variables (removed 601) and now considering 15/620 (removed 605) transitions.
// Phase 1: matrix 15 rows 12 cols
[2024-05-24 01:38:46] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:38:46] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-24 01:38:46] [INFO ] Invariant cache hit.
[2024-05-24 01:38:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:38:46] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-24 01:38:46] [INFO ] Redundant transitions in 10 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-24 01:38:46] [INFO ] Invariant cache hit.
[2024-05-24 01:38:46] [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 96 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 77 ms.
Refiners :[State Equation: 12/12 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 190ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 190ms
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 272 ms. Remains : 12/613 places, 15/620 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-12 finished in 308 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.6 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 30 ms. Remains 13 /613 variables (removed 600) and now considering 18/620 (removed 602) transitions.
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 01:38:46] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:38:47] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-05-24 01:38:47] [INFO ] Invariant cache hit.
[2024-05-24 01:38:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 01:38:47] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-24 01:38:47] [INFO ] Redundant transitions in 9 ms returned []
Running 11 sub problems to find dead transitions.
[2024-05-24 01:38:47] [INFO ] Invariant cache hit.
[2024-05-24 01:38:47] [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 99 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 91 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 0 solved, 11 unsolved
Search for dead transitions found 0 dead transitions in 207ms
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 396 ms. Remains : 13/613 places, 18/620 transitions.
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLFireability-13
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-13 finished in 477 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 50 ms. Remains 602 /613 variables (removed 11) and now considering 605/620 (removed 15) transitions.
// Phase 1: matrix 605 rows 602 cols
[2024-05-24 01:38:47] [INFO ] Computed 37 invariants in 5 ms
[2024-05-24 01:38:47] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-24 01:38:47] [INFO ] Invariant cache hit.
[2024-05-24 01:38:47] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2024-05-24 01:38:47] [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 "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30013 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 30026 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 60171ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60176ms
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 605/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60672 ms. Remains : 602/613 places, 605/620 transitions.
Stuttering acceptance computed with spot in 100 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 60793 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-24 01:39:48] [INFO ] Computed 37 invariants in 5 ms
[2024-05-24 01:39:48] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-24 01:39:48] [INFO ] Invariant cache hit.
[2024-05-24 01:39:48] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 494 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-24 01:39:48] [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
At refinement iteration 4 (OVERLAPS) 1/1208 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 639 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
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, 605/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1207 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 5 (OVERLAPS) 1/1208 variables, 1/1244 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 1244 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Starting structural reductions in LTL mode, iteration 1 : 602/613 places, 606/620 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60729 ms. Remains : 602/613 places, 606/620 transitions.
Stuttering acceptance computed with spot in 178 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 328 reset in 194 ms.
Product exploration explored 100000 steps with 327 reset in 246 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.2 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 107 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 169 ms :[p0, p0, p0, (AND p0 (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (130 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 106 ms. (373 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (13 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 208 ms. (191 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 214 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 100 ms. (396 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (12 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 335306 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :4 out of 7
Probabilistic random walk after 335306 steps, saw 149514 distinct states, run finished after 3004 ms. (steps per millisecond=111 ) properties seen :4
[2024-05-24 01:40:53] [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 397 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 320 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 727ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 164 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=54 )
Parikh walk visited 2 properties in 3 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 247 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 228 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 135 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-24 01:40:54] [INFO ] Invariant cache hit.
[2024-05-24 01:40:54] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-24 01:40:54] [INFO ] Invariant cache hit.
[2024-05-24 01:40:55] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-24 01:40:55] [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
At refinement iteration 4 (OVERLAPS) 1/1208 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 639 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
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, 605/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1207 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 5 (OVERLAPS) 1/1208 variables, 1/1244 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 1244 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints]
After SMT, in 60147ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Finished structural reductions in LTL mode , in 1 iterations and 60634 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.3 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 96 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 151 ms :[p0, p0, p0, (AND p0 (NOT p2))]
RANDOM walk for 40000 steps (131 resets) in 334 ms. (119 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (13 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (12 resets) in 39 ms. (1000 steps per ms) remains 3/3 properties
[2024-05-24 01:41:55] [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 505 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 423 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 933ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 186 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=23 )
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 8 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 265 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 168 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 154 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, (AND p0 (NOT p2))]
Product exploration explored 100000 steps with 327 reset in 190 ms.
Product exploration explored 100000 steps with 323 reset in 296 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 158 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.2 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 0 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 0 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 52 ms. Remains 68 /602 variables (removed 534) and now considering 83/606 (removed 523) transitions.
[2024-05-24 01:41:58] [INFO ] Redundant transitions in 14 ms returned []
Running 82 sub problems to find dead transitions.
// Phase 1: matrix 83 rows 68 cols
[2024-05-24 01:41:58] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 01:41:58] [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 592 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 510 ms.
Refiners :[State Equation: 68/68 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 23/82 constraints, Known Traps: 0/0 constraints]
After SMT, in 1112ms problems are : Problem set: 59 solved, 23 unsolved
Search for dead transitions found 59 dead transitions in 1113ms
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.0 ms
Discarding 53 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 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 1195 ms. Remains : 15/602 places, 24/606 transitions.
Built C files in :
/tmp/ltsmin10459425546784854352
[2024-05-24 01:41:59] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10459425546784854352
Running compilation step : cd /tmp/ltsmin10459425546784854352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1026 ms.
Running link step : cd /tmp/ltsmin10459425546784854352;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10459425546784854352;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3638237070144501305.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 16 ms. Remains 602 /602 variables (removed 0) and now considering 606/606 (removed 0) transitions.
// Phase 1: matrix 606 rows 602 cols
[2024-05-24 01:42:14] [INFO ] Computed 37 invariants in 2 ms
[2024-05-24 01:42:14] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-24 01:42:14] [INFO ] Invariant cache hit.
[2024-05-24 01:42:14] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 605 sub problems to find dead transitions.
[2024-05-24 01:42:15] [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
At refinement iteration 4 (OVERLAPS) 1/1208 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1208/1208 variables, and 639 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 605 unsolved
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, 605/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1207 variables, 0/1243 constraints. Problems are: Problem set: 0 solved, 605 unsolved
At refinement iteration 5 (OVERLAPS) 1/1208 variables, 1/1244 constraints. Problems are: Problem set: 0 solved, 605 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1208/1208 variables, and 1244 constraints, problems are : Problem set: 0 solved, 605 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/602 constraints, PredecessorRefiner: 605/605 constraints, Known Traps: 0/0 constraints]
After SMT, in 60170ms problems are : Problem set: 0 solved, 605 unsolved
Search for dead transitions found 0 dead transitions in 60179ms
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 602/602 places, 606/606 transitions.
Built C files in :
/tmp/ltsmin18438548261390466646
[2024-05-24 01:43:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18438548261390466646
Running compilation step : cd /tmp/ltsmin18438548261390466646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1004 ms.
Running link step : cd /tmp/ltsmin18438548261390466646;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin18438548261390466646;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11836598833286919957.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 01:43:30] [INFO ] Flatten gal took : 16 ms
[2024-05-24 01:43:30] [INFO ] Flatten gal took : 15 ms
[2024-05-24 01:43:30] [INFO ] Time to serialize gal into /tmp/LTL14440081124990551122.gal : 3 ms
[2024-05-24 01:43:30] [INFO ] Time to serialize properties into /tmp/LTL5886514005735671971.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14440081124990551122.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3462958330316798792.hoa' '-atoms' '/tmp/LTL5886514005735671971.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL5886514005735671971.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3462958330316798792.hoa
Detected timeout of ITS tools.
[2024-05-24 01:43:45] [INFO ] Flatten gal took : 13 ms
[2024-05-24 01:43:45] [INFO ] Flatten gal took : 13 ms
[2024-05-24 01:43:45] [INFO ] Time to serialize gal into /tmp/LTL16361321646086649118.gal : 4 ms
[2024-05-24 01:43:45] [INFO ] Time to serialize properties into /tmp/LTL14408397241318119447.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16361321646086649118.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14408397241318119447.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("((p105==1)&&(p507==1))"))U((G(!("((p105==1)&&(p507==1))")))||((!("((p105==1)&&(p507==1))"))&&(("(p57==1)")U(("((p105==1)&...193
Formula 0 simplified : XXG((!"(p57==1)" M !"((p105==1)&&(p57==1))") U "((p105==1)&&(p507==1))")
Detected timeout of ITS tools.
[2024-05-24 01:44:00] [INFO ] Flatten gal took : 12 ms
[2024-05-24 01:44:00] [INFO ] Applying decomposition
[2024-05-24 01:44:00] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph4300783558575478926.txt' '-o' '/tmp/graph4300783558575478926.bin' '-w' '/tmp/graph4300783558575478926.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph4300783558575478926.bin' '-l' '-1' '-v' '-w' '/tmp/graph4300783558575478926.weights' '-q' '0' '-e' '0.001'
[2024-05-24 01:44:00] [INFO ] Decomposing Gal with order
[2024-05-24 01:44:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 01:44:00] [INFO ] Removed a total of 190 redundant transitions.
[2024-05-24 01:44:00] [INFO ] Flatten gal took : 27 ms
[2024-05-24 01:44:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 01:44:00] [INFO ] Time to serialize gal into /tmp/LTL12815999060827534008.gal : 7 ms
[2024-05-24 01:44:00] [INFO ] Time to serialize properties into /tmp/LTL3495125639315984429.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12815999060827534008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3495125639315984429.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((!("((i5.i1.u40.p105==1)&&(i28.i0.u188.p507==1))"))U((G(!("((i5.i1.u40.p105==1)&&(i28.i0.u188.p507==1))")))||((!("((i5.i1.u40...299
Formula 0 simplified : XXG((!"(i3.i1.u23.p57==1)" M !"((i5.i1.u40.p105==1)&&(i3.i1.u23.p57==1))") U "((i5.i1.u40.p105==1)&&(i28.i0.u188.p507==1))")
Reverse transition relation is NOT exact ! Due to transitions t546, i2.t541, i2.i1.u21.t534, i3.i0.t519, i3.i0.t528, i4.i0.t505, i4.i0.u29.t512, i5.t498, i...1137
Computing Next relation with stutter on 3.00189e+17 deadlock states
298 unique states visited
297 strongly connected components in search stack
300 transitions explored
298 items max in DFS search stack
1115 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.2058,314972,1,0,622894,326,6044,793642,155,968,1469433
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-36b-LTLFireability-15 finished in 265126 ms.
All properties solved by simple procedures.
Total runtime 876939 ms.

BK_STOP 1716515053331

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="itstools"
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 itstools"
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 r180-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 ;