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-171640603600540.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-20b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r180-tall-171640603600540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K Apr 11 22:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 11 22:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 22:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 103K 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-20b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-20b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716509687182

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-20b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 00:14:48] [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 00:14:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 00:14:48] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-24 00:14:48] [INFO ] Transformed 416 places.
[2024-05-24 00:14:48] [INFO ] Transformed 437 transitions.
[2024-05-24 00:14:48] [INFO ] Found NUPN structural information;
[2024-05-24 00:14:48] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 416/416 places, 437/437 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 437
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 43 place count 373 transition count 395
Iterating global reduction 1 with 42 rules applied. Total rules applied 85 place count 373 transition count 395
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 356 transition count 378
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 356 transition count 378
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 134 place count 356 transition count 363
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 135 place count 355 transition count 362
Iterating global reduction 2 with 1 rules applied. Total rules applied 136 place count 355 transition count 362
Applied a total of 136 rules in 107 ms. Remains 355 /416 variables (removed 61) and now considering 362/437 (removed 75) transitions.
// Phase 1: matrix 362 rows 355 cols
[2024-05-24 00:14:48] [INFO ] Computed 21 invariants in 22 ms
[2024-05-24 00:14:49] [INFO ] Implicit Places using invariants in 271 ms returned []
[2024-05-24 00:14:49] [INFO ] Invariant cache hit.
[2024-05-24 00:14:49] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2024-05-24 00:14:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/716 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (OVERLAPS) 1/717 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (OVERLAPS) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 376 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22103 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/354 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/716 variables, 361/736 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/716 variables, 0/736 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (OVERLAPS) 1/717 variables, 1/737 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/717 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 0/717 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 361 unsolved
No progress, stopping.
After SMT solving in domain Int declared 717/717 variables, and 737 constraints, problems are : Problem set: 0 solved, 361 unsolved in 22711 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 0/0 constraints]
After SMT, in 44949ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 44981ms
Starting structural reductions in LTL mode, iteration 1 : 355/416 places, 362/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45632 ms. Remains : 355/416 places, 362/437 transitions.
Support contains 30 out of 355 places after structural reductions.
[2024-05-24 00:15:34] [INFO ] Flatten gal took : 56 ms
[2024-05-24 00:15:34] [INFO ] Flatten gal took : 22 ms
[2024-05-24 00:15:34] [INFO ] Input system was already deterministic with 362 transitions.
Support contains 29 out of 355 places (down from 30) after GAL structural reductions.
RANDOM walk for 40000 steps (220 resets) in 1083 ms. (36 steps per ms) remains 1/27 properties
BEST_FIRST walk for 40002 steps (26 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2024-05-24 00:15:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 309/354 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/717 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/717 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 717/717 variables, and 376 constraints, problems are : Problem set: 0 solved, 1 unsolved in 348 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/45 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 309/354 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 362/716 variables, 354/375 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/716 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/716 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/717 variables, 1/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/717 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/717 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 717/717 variables, and 377 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 355/355 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Parikh walk visited 1 properties in 6 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Graph (complete) has 551 edges and 355 vertex of which 331 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.15 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&&X(G(p1))))) U (p0||X(F(p2)))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 348 transition count 353
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 346 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 346 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 346 transition count 349
Applied a total of 22 rules in 22 ms. Remains 346 /355 variables (removed 9) and now considering 349/362 (removed 13) transitions.
// Phase 1: matrix 349 rows 346 cols
[2024-05-24 00:15:36] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 00:15:36] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-05-24 00:15:36] [INFO ] Invariant cache hit.
[2024-05-24 00:15:36] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-24 00:15:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 1/695 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 367 constraints, problems are : Problem set: 0 solved, 348 unsolved in 19983 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 348/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 1/695 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 715 constraints, problems are : Problem set: 0 solved, 348 unsolved in 22309 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
After SMT, in 42356ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 42361ms
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 349/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42870 ms. Remains : 346/355 places, 349/362 transitions.
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 538 edges and 346 vertex of which 322 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/346 stabilizing places and 63/349 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT (AND p0 (NOT p2)))), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1)))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-00 finished in 43722 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((X(p1)||p0)))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 25 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 00:16:19] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 00:16:19] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-05-24 00:16:19] [INFO ] Invariant cache hit.
[2024-05-24 00:16:20] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:16:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19278 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22746 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42099ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42104ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42527 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-02 finished in 42636 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 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 348 transition count 353
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 346 transition count 351
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 346 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 346 transition count 349
Applied a total of 22 rules in 21 ms. Remains 346 /355 variables (removed 9) and now considering 349/362 (removed 13) transitions.
// Phase 1: matrix 349 rows 346 cols
[2024-05-24 00:17:02] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 00:17:02] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-24 00:17:02] [INFO ] Invariant cache hit.
[2024-05-24 00:17:02] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Running 348 sub problems to find dead transitions.
[2024-05-24 00:17:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (OVERLAPS) 1/695 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (OVERLAPS) 0/695 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Real declared 695/695 variables, and 367 constraints, problems are : Problem set: 0 solved, 348 unsolved in 19880 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 348 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 2 (OVERLAPS) 349/694 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/694 variables, 348/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/694 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 5 (OVERLAPS) 1/695 variables, 1/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
At refinement iteration 7 (OVERLAPS) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 348 unsolved
No progress, stopping.
After SMT solving in domain Int declared 695/695 variables, and 715 constraints, problems are : Problem set: 0 solved, 348 unsolved in 22721 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 348/348 constraints, Known Traps: 0/0 constraints]
After SMT, in 42652ms problems are : Problem set: 0 solved, 348 unsolved
Search for dead transitions found 0 dead transitions in 42655ms
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 349/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42973 ms. Remains : 346/355 places, 349/362 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-03
Entered a terminal (fully accepting) state of product in 36461 steps with 204 reset in 83 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-03 finished in 43157 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 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 11 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 00:17:45] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 00:17:45] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 00:17:45] [INFO ] Invariant cache hit.
[2024-05-24 00:17:45] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:17:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19494 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 21868 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41414ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41418ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41752 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-04 finished in 41850 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 345 transition count 350
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 345 transition count 350
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 345 transition count 348
Applied a total of 24 rules in 16 ms. Remains 345 /355 variables (removed 10) and now considering 348/362 (removed 14) transitions.
// Phase 1: matrix 348 rows 345 cols
[2024-05-24 00:18:27] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 00:18:27] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-24 00:18:27] [INFO ] Invariant cache hit.
[2024-05-24 00:18:27] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 347 sub problems to find dead transitions.
[2024-05-24 00:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/692 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (OVERLAPS) 1/693 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/693 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (OVERLAPS) 0/693 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Real declared 693/693 variables, and 366 constraints, problems are : Problem set: 0 solved, 347 unsolved in 19385 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 347 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 2 (OVERLAPS) 348/692 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/692 variables, 347/712 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 5 (OVERLAPS) 1/693 variables, 1/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/693 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
At refinement iteration 7 (OVERLAPS) 0/693 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 347 unsolved
No progress, stopping.
After SMT solving in domain Int declared 693/693 variables, and 713 constraints, problems are : Problem set: 0 solved, 347 unsolved in 23526 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 347/347 constraints, Known Traps: 0/0 constraints]
After SMT, in 42959ms problems are : Problem set: 0 solved, 347 unsolved
Search for dead transitions found 0 dead transitions in 42962ms
Starting structural reductions in LTL mode, iteration 1 : 345/355 places, 348/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43252 ms. Remains : 345/355 places, 348/362 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 113 ms.
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 537 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 10 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-05 finished in 43569 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))))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 13 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 00:19:10] [INFO ] Computed 21 invariants in 3 ms
[2024-05-24 00:19:10] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-24 00:19:11] [INFO ] Invariant cache hit.
[2024-05-24 00:19:11] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:19:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19378 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22456 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41882ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41885ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42232 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-06
Product exploration explored 100000 steps with 970 reset in 123 ms.
Product exploration explored 100000 steps with 964 reset in 154 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.7 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 374 steps (0 resets) in 10 ms. (34 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 00:19:53] [INFO ] Invariant cache hit.
[2024-05-24 00:19:54] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 00:19:54] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-24 00:19:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:19:54] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 5 ms returned sat
[2024-05-24 00:19:54] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-05-24 00:19:54] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 19 ms.
[2024-05-24 00:19:56] [INFO ] Added : 326 causal constraints over 66 iterations in 1721 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 4 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-05-24 00:19:56] [INFO ] Invariant cache hit.
[2024-05-24 00:19:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-24 00:19:56] [INFO ] Invariant cache hit.
[2024-05-24 00:19:56] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:19:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19463 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22376 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41898ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41902ms
Finished structural reductions in LTL mode , in 1 iterations and 42210 ms. Remains : 344/344 places, 346/346 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.8 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 423 steps (0 resets) in 5 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 108 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-24 00:20:38] [INFO ] Invariant cache hit.
[2024-05-24 00:20:39] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 00:20:39] [INFO ] [Real]Absence check using state equation in 126 ms returned sat
[2024-05-24 00:20:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:20:39] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 00:20:39] [INFO ] [Nat]Absence check using state equation in 125 ms returned sat
[2024-05-24 00:20:39] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 19 ms.
[2024-05-24 00:20:41] [INFO ] Added : 326 causal constraints over 66 iterations in 1629 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 965 reset in 153 ms.
Product exploration explored 100000 steps with 977 reset in 159 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 281 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 8 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 315 transition count 337
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 162 place count 315 transition count 339
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 315 transition count 339
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 300 place count 199 transition count 223
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 416 place count 199 transition count 223
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 435 place count 180 transition count 204
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 454 place count 180 transition count 204
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 132 places in 1 ms
Iterating global reduction 1 with 66 rules applied. Total rules applied 520 place count 180 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 522 place count 180 transition count 203
Discarding 47 places :
Symmetric choice reduction at 2 with 47 rule applications. Total rules 569 place count 133 transition count 155
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 2 with 47 rules applied. Total rules applied 616 place count 133 transition count 155
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 617 place count 133 transition count 155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 618 place count 132 transition count 154
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 619 place count 132 transition count 154
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 639 place count 132 transition count 213
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 677 place count 94 transition count 137
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 715 place count 94 transition count 137
Discarding 54 places :
Symmetric choice reduction at 2 with 54 rule applications. Total rules 769 place count 40 transition count 47
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 54 rules applied. Total rules applied 823 place count 40 transition count 47
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 823 rules in 99 ms. Remains 40 /344 variables (removed 304) and now considering 47/346 (removed 299) transitions.
[2024-05-24 00:20:41] [INFO ] Redundant transitions in 22 ms returned []
Running 46 sub problems to find dead transitions.
// Phase 1: matrix 47 rows 40 cols
[2024-05-24 00:20:41] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:20:41] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 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 TDEAD15 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 TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 1 (OVERLAPS) 46/85 variables, 39/39 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 8/47 constraints. Problems are: Problem set: 35 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/47 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 1/86 variables, 1/48 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/48 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 1/87 variables, 1/49 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/49 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/87 variables, 0/49 constraints. Problems are: Problem set: 35 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 49 constraints, problems are : Problem set: 35 solved, 11 unsolved in 260 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 45/53 variables, 8/8 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 8/16 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 11/27 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/27 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 33/86 variables, 32/59 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/86 variables, 0/59 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 1/87 variables, 1/60 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/87 variables, 0/60 constraints. Problems are: Problem set: 35 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 0/87 variables, 0/60 constraints. Problems are: Problem set: 35 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 60 constraints, problems are : Problem set: 35 solved, 11 unsolved in 183 ms.
Refiners :[State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 11/46 constraints, Known Traps: 0/0 constraints]
After SMT, in 453ms problems are : Problem set: 35 solved, 11 unsolved
Search for dead transitions found 35 dead transitions in 453ms
Found 35 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 35 transitions
Dead transitions reduction (with SMT) removed 35 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 40/344 places, 12/346 transitions.
Graph (complete) has 30 edges and 40 vertex of which 9 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 9 /40 variables (removed 31) and now considering 12/12 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/344 places, 12/346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 592 ms. Remains : 9/344 places, 12/346 transitions.
Built C files in :
/tmp/ltsmin16175755392939770695
[2024-05-24 00:20:42] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16175755392939770695
Running compilation step : cd /tmp/ltsmin16175755392939770695;'/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 742 ms.
Running link step : cd /tmp/ltsmin16175755392939770695;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16175755392939770695;'/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/stateBased10606375427579335629.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 16 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 00:20:57] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 00:20:57] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-24 00:20:57] [INFO ] Invariant cache hit.
[2024-05-24 00:20:57] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:20:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19636 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22455 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42146ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42149ms
Finished structural reductions in LTL mode , in 1 iterations and 42495 ms. Remains : 344/344 places, 346/346 transitions.
Built C files in :
/tmp/ltsmin8242321594058846341
[2024-05-24 00:21:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8242321594058846341
Running compilation step : cd /tmp/ltsmin8242321594058846341;'/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 535 ms.
Running link step : cd /tmp/ltsmin8242321594058846341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8242321594058846341;'/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/stateBased4879154443967575633.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 00:21:55] [INFO ] Flatten gal took : 17 ms
[2024-05-24 00:21:55] [INFO ] Flatten gal took : 15 ms
[2024-05-24 00:21:55] [INFO ] Time to serialize gal into /tmp/LTL6005326866593032099.gal : 5 ms
[2024-05-24 00:21:55] [INFO ] Time to serialize properties into /tmp/LTL1318694834640165363.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/LTL6005326866593032099.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2746107532747327705.hoa' '-atoms' '/tmp/LTL1318694834640165363.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...317
Loading property file /tmp/LTL1318694834640165363.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2746107532747327705.hoa
Detected timeout of ITS tools.
[2024-05-24 00:22:10] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:22:10] [INFO ] Flatten gal took : 14 ms
[2024-05-24 00:22:10] [INFO ] Time to serialize gal into /tmp/LTL2205083521051745245.gal : 3 ms
[2024-05-24 00:22:10] [INFO ] Time to serialize properties into /tmp/LTL11783469205932170301.ltl : 2 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/LTL2205083521051745245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11783469205932170301.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(F("(p214==1)")))))
Formula 0 simplified : XXG!"(p214==1)"
Detected timeout of ITS tools.
[2024-05-24 00:22:25] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:22:25] [INFO ] Applying decomposition
[2024-05-24 00:22:25] [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/graph16015419795144624815.txt' '-o' '/tmp/graph16015419795144624815.bin' '-w' '/tmp/graph16015419795144624815.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16015419795144624815.bin' '-l' '-1' '-v' '-w' '/tmp/graph16015419795144624815.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:22:25] [INFO ] Decomposing Gal with order
[2024-05-24 00:22:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:22:25] [INFO ] Removed a total of 104 redundant transitions.
[2024-05-24 00:22:25] [INFO ] Flatten gal took : 51 ms
[2024-05-24 00:22:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2024-05-24 00:22:25] [INFO ] Time to serialize gal into /tmp/LTL16819806529262888203.gal : 5 ms
[2024-05-24 00:22:25] [INFO ] Time to serialize properties into /tmp/LTL12903775605556407197.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/LTL16819806529262888203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12903775605556407197.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(F("(i11.u76.p214==1)")))))
Formula 0 simplified : XXG!"(i11.u76.p214==1)"
Reverse transition relation is NOT exact ! Due to transitions t320, i1.t315, i1.u10.t308, i2.t302, i2.u16.t294, i3.t287, i3.u22.t278, i4.t271, i4.u33.t264,...665
Computing Next relation with stutter on 6.97252e+09 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
124 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,1.27074,66532,1,0,120464,300,3542,129253,158,859,247641
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-06 finished in 196164 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(X(p1))||G(p2)||F(p3))))'
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 29 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
[2024-05-24 00:22:27] [INFO ] Invariant cache hit.
[2024-05-24 00:22:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-24 00:22:27] [INFO ] Invariant cache hit.
[2024-05-24 00:22:27] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:22:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19481 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22208 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 41735ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 41739ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42082 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p3) (NOT p1)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-08
Product exploration explored 100000 steps with 656 reset in 132 ms.
Product exploration explored 100000 steps with 658 reset in 138 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0)), (X p2), (X (NOT p3)), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 119 ms. Reduced automaton from 8 states, 12 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
RANDOM walk for 40000 steps (224 resets) in 220 ms. (180 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40001 steps (26 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
[2024-05-24 00:23:10] [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) 59/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 282/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 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) 59/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 282/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 690/690 variables, and 366 constraints, problems are : Problem set: 1 solved, 0 unsolved in 136 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 307ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p3) (NOT p1) p2 (NOT p0)), (X p2), (X (NOT p3)), (X (AND (NOT p0) p2 (NOT p3))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X p2)), (X (X (NOT p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (G (OR p2 p3 p1))]
False Knowledge obtained : [(F p3), (F (NOT (AND p2 (NOT p3) (NOT p1)))), (F p1), (F (NOT (OR p2 p3))), (F (NOT p2)), (F (NOT (AND p2 (NOT p3))))]
Knowledge based reduction with 11 factoid took 241 ms. Reduced automaton from 6 states, 8 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 245 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Support contains 2 out of 344 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 7 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
[2024-05-24 00:23:11] [INFO ] Invariant cache hit.
[2024-05-24 00:23:11] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 00:23:11] [INFO ] Invariant cache hit.
[2024-05-24 00:23:11] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19522 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22637 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42208ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42212ms
Finished structural reductions in LTL mode , in 1 iterations and 42559 ms. Remains : 344/344 places, 346/346 transitions.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
RANDOM walk for 30956 steps (172 resets) in 442 ms. (69 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p3) p2 (NOT p1))]
False Knowledge obtained : [(F (NOT (OR p2 p3))), (F p3), (F p1), (F (NOT p2)), (F (NOT (AND (NOT p1) (NOT p3)))), (F (NOT (AND p2 (NOT p3))))]
Knowledge based reduction with 1 factoid took 166 ms. Reduced automaton from 6 states, 7 edges and 3 AP (stutter sensitive) to 6 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 248 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 222 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 656 reset in 138 ms.
Product exploration explored 100000 steps with 661 reset in 146 ms.
Applying partial POR strategy [true, true, false, false, false, false]
Stuttering acceptance computed with spot in 210 ms :[(NOT p3), (AND (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1))]
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 280 edges and 344 vertex of which 6 / 344 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 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Discarding 24 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 160 rules applied. Total rules applied 162 place count 315 transition count 337
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 162 place count 315 transition count 339
Deduced a syphon composed of 182 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 184 place count 315 transition count 339
Discarding 116 places :
Symmetric choice reduction at 1 with 116 rule applications. Total rules 300 place count 199 transition count 223
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 1 with 116 rules applied. Total rules applied 416 place count 199 transition count 223
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 435 place count 180 transition count 204
Deduced a syphon composed of 66 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 454 place count 180 transition count 204
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 65 rules applied. Total rules applied 519 place count 180 transition count 205
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 521 place count 180 transition count 203
Discarding 46 places :
Symmetric choice reduction at 2 with 46 rule applications. Total rules 567 place count 134 transition count 156
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 46 rules applied. Total rules applied 613 place count 134 transition count 156
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 614 place count 134 transition count 156
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 615 place count 133 transition count 155
Deduced a syphon composed of 85 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 616 place count 133 transition count 155
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 636 place count 133 transition count 213
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 673 place count 96 transition count 139
Deduced a syphon composed of 85 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 710 place count 96 transition count 139
Discarding 51 places :
Symmetric choice reduction at 2 with 51 rule applications. Total rules 761 place count 45 transition count 54
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 812 place count 45 transition count 54
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 812 rules in 64 ms. Remains 45 /344 variables (removed 299) and now considering 54/346 (removed 292) transitions.
[2024-05-24 00:23:55] [INFO ] Redundant transitions in 11 ms returned []
Running 53 sub problems to find dead transitions.
// Phase 1: matrix 54 rows 45 cols
[2024-05-24 00:23:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 00:23:55] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 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 TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
At refinement iteration 1 (OVERLAPS) 53/97 variables, 44/44 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 10/54 constraints. Problems are: Problem set: 39 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/54 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/98 variables, 1/55 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/98 variables, 0/55 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 1/99 variables, 1/56 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/99 variables, 0/56 constraints. Problems are: Problem set: 39 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 56 constraints, problems are : Problem set: 39 solved, 14 unsolved in 258 ms.
Refiners :[State Equation: 45/45 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 39 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 52/62 variables, 10/10 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 10/20 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 14/34 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/34 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 36/98 variables, 35/69 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/69 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 1/99 variables, 1/70 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/70 constraints. Problems are: Problem set: 39 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/70 constraints. Problems are: Problem set: 39 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 70 constraints, problems are : Problem set: 39 solved, 14 unsolved in 250 ms.
Refiners :[State Equation: 45/45 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 14/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 520ms problems are : Problem set: 39 solved, 14 unsolved
Search for dead transitions found 39 dead transitions in 521ms
Found 39 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 45/344 places, 15/346 transitions.
Graph (complete) has 38 edges and 45 vertex of which 11 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.0 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /45 variables (removed 34) and now considering 15/15 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/344 places, 15/346 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 607 ms. Remains : 11/344 places, 15/346 transitions.
Built C files in :
/tmp/ltsmin13274502069196063742
[2024-05-24 00:23:56] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13274502069196063742
Running compilation step : cd /tmp/ltsmin13274502069196063742;'/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 572 ms.
Running link step : cd /tmp/ltsmin13274502069196063742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin13274502069196063742;'/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/stateBased14172580394796653553.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Applied a total of 0 rules in 8 ms. Remains 344 /344 variables (removed 0) and now considering 346/346 (removed 0) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 00:24:11] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 00:24:11] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-05-24 00:24:11] [INFO ] Invariant cache hit.
[2024-05-24 00:24:11] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:24:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19994 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22320 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42366ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42370ms
Finished structural reductions in LTL mode , in 1 iterations and 42708 ms. Remains : 344/344 places, 346/346 transitions.
Built C files in :
/tmp/ltsmin9887332960770456703
[2024-05-24 00:24:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9887332960770456703
Running compilation step : cd /tmp/ltsmin9887332960770456703;'/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 544 ms.
Running link step : cd /tmp/ltsmin9887332960770456703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin9887332960770456703;'/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/stateBased2067308617862546463.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 00:25:09] [INFO ] Flatten gal took : 20 ms
[2024-05-24 00:25:09] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:25:09] [INFO ] Time to serialize gal into /tmp/LTL17964688369155683237.gal : 2 ms
[2024-05-24 00:25:09] [INFO ] Time to serialize properties into /tmp/LTL17409062225120962412.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/LTL17964688369155683237.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9041345237110045220.hoa' '-atoms' '/tmp/LTL17409062225120962412.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...319
Loading property file /tmp/LTL17409062225120962412.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9041345237110045220.hoa
Detected timeout of ITS tools.
[2024-05-24 00:25:24] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:25:24] [INFO ] Flatten gal took : 9 ms
[2024-05-24 00:25:24] [INFO ] Time to serialize gal into /tmp/LTL508114532831988929.gal : 2 ms
[2024-05-24 00:25:24] [INFO ] Time to serialize properties into /tmp/LTL6765837597733530195.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/LTL508114532831988929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6765837597733530195.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...274
Read 1 LTL properties
Checking formula 0 : !((X(((X(X("(p67==1)")))||(G("(p67==0)")))||((F("(p88==1)"))||("(((p230==1)&&(p397==1))&&(p412==1))")))))
Formula 0 simplified : X(!"(((p230==1)&&(p397==1))&&(p412==1))" & XX!"(p67==1)" & F!"(p67==0)" & G!"(p88==1)")
Detected timeout of ITS tools.
[2024-05-24 00:25:39] [INFO ] Flatten gal took : 11 ms
[2024-05-24 00:25:39] [INFO ] Applying decomposition
[2024-05-24 00:25:39] [INFO ] Flatten gal took : 9 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/graph10311993771184370671.txt' '-o' '/tmp/graph10311993771184370671.bin' '-w' '/tmp/graph10311993771184370671.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10311993771184370671.bin' '-l' '-1' '-v' '-w' '/tmp/graph10311993771184370671.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:25:39] [INFO ] Decomposing Gal with order
[2024-05-24 00:25:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:25:39] [INFO ] Removed a total of 49 redundant transitions.
[2024-05-24 00:25:39] [INFO ] Flatten gal took : 19 ms
[2024-05-24 00:25:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 00:25:39] [INFO ] Time to serialize gal into /tmp/LTL16747932922410707907.gal : 5 ms
[2024-05-24 00:25:39] [INFO ] Time to serialize properties into /tmp/LTL14566009541678478707.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/LTL16747932922410707907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14566009541678478707.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(X("(i3.u24.p67==1)")))||(G("(i3.u24.p67==0)")))||((F("(i4.u34.p88==1)"))||("(((i12.u85.p230==1)&&(i21.u144.p397==1))&&(i21.u1...173
Formula 0 simplified : X(!"(((i12.u85.p230==1)&&(i21.u144.p397==1))&&(i21.u144.p412==1))" & XX!"(i3.u24.p67==1)" & F!"(i3.u24.p67==0)" & G!"(i4.u34.p88==1)...157
Detected timeout of ITS tools.
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-08 finished in 207730 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 U G(p1)))||F(p2)))'
Support contains 5 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 348 transition count 355
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 348 transition count 355
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 348 transition count 353
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 345 transition count 350
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 345 transition count 350
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 345 transition count 347
Applied a total of 25 rules in 17 ms. Remains 345 /355 variables (removed 10) and now considering 347/362 (removed 15) transitions.
// Phase 1: matrix 347 rows 345 cols
[2024-05-24 00:25:54] [INFO ] Computed 21 invariants in 5 ms
[2024-05-24 00:25:54] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-24 00:25:54] [INFO ] Invariant cache hit.
[2024-05-24 00:25:55] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
Running 346 sub problems to find dead transitions.
[2024-05-24 00:25:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (OVERLAPS) 1/692 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/692 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (OVERLAPS) 0/692 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Real declared 692/692 variables, and 366 constraints, problems are : Problem set: 0 solved, 346 unsolved in 19722 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 346 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/344 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 2 (OVERLAPS) 347/691 variables, 344/365 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/691 variables, 346/711 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/691 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 5 (OVERLAPS) 1/692 variables, 1/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
At refinement iteration 7 (OVERLAPS) 0/692 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 346 unsolved
No progress, stopping.
After SMT solving in domain Int declared 692/692 variables, and 712 constraints, problems are : Problem set: 0 solved, 346 unsolved in 24613 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 346/346 constraints, Known Traps: 0/0 constraints]
After SMT, in 44382ms problems are : Problem set: 0 solved, 346 unsolved
Search for dead transitions found 0 dead transitions in 44385ms
Starting structural reductions in LTL mode, iteration 1 : 345/355 places, 347/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44667 ms. Remains : 345/355 places, 347/362 transitions.
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-09
Stuttering criterion allowed to conclude after 19317 steps with 111 reset in 55 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-09 finished in 44927 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))&&F((G(F(p1))||(p2&&F(p1))))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 295 edges and 355 vertex of which 6 / 355 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 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 168 transitions
Trivial Post-agglo rules discarded 168 transitions
Performed 168 trivial Post agglomeration. Transition count delta: 168
Iterating post reduction 0 with 168 rules applied. Total rules applied 170 place count 325 transition count 184
Reduce places removed 168 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 176 rules applied. Total rules applied 346 place count 157 transition count 176
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 350 place count 154 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 351 place count 153 transition count 175
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 41 Pre rules applied. Total rules applied 351 place count 153 transition count 134
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 433 place count 112 transition count 134
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 453 place count 92 transition count 114
Iterating global reduction 4 with 20 rules applied. Total rules applied 473 place count 92 transition count 114
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 591 place count 33 transition count 55
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 608 place count 16 transition count 21
Iterating global reduction 4 with 17 rules applied. Total rules applied 625 place count 16 transition count 21
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 1
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 629 place count 14 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 630 place count 13 transition count 19
Applied a total of 630 rules in 23 ms. Remains 13 /355 variables (removed 342) and now considering 19/362 (removed 343) transitions.
[2024-05-24 00:26:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-24 00:26:39] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:26:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 00:26:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 00:26:39] [INFO ] Invariant cache hit.
[2024-05-24 00:26:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:26:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 00:26:39] [INFO ] Redundant transitions in 10 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-24 00:26:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-24 00:26:39] [INFO ] Invariant cache hit.
[2024-05-24 00:26:39] [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) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 2/30 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 1/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 112 ms.
Refiners :[State Equation: 13/13 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) 17/28 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 11/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/31 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 120 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 245ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 245ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/355 places, 19/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 329 ms. Remains : 13/355 places, 19/362 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-10
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-10 finished in 512 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)&&(p0||G((p1||X(G(p0))))))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 16 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 00:26:40] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 00:26:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-24 00:26:40] [INFO ] Invariant cache hit.
[2024-05-24 00:26:40] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:26:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19435 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22902 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42387ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42390ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42715 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), false, true]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-11
Stuttering criterion allowed to conclude after 202 steps with 1 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-11 finished in 42907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 297 edges and 355 vertex of which 6 / 355 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 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 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 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 325 transition count 181
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 180 rules applied. Total rules applied 353 place count 154 transition count 172
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 356 place count 151 transition count 172
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 356 place count 151 transition count 129
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 442 place count 108 transition count 129
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 462 place count 88 transition count 109
Iterating global reduction 3 with 20 rules applied. Total rules applied 482 place count 88 transition count 109
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 0 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 602 place count 28 transition count 49
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 620 place count 10 transition count 13
Iterating global reduction 3 with 18 rules applied. Total rules applied 638 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 640 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 641 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 642 place count 8 transition count 11
Applied a total of 642 rules in 30 ms. Remains 8 /355 variables (removed 347) and now considering 11/362 (removed 351) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-24 00:27:23] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 00:27:23] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 00:27:23] [INFO ] Invariant cache hit.
[2024-05-24 00:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:27:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-24 00:27:23] [INFO ] Redundant transitions in 9 ms returned []
Running 6 sub problems to find dead transitions.
[2024-05-24 00:27:23] [INFO ] Invariant cache hit.
[2024-05-24 00:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 58 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 107ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 107ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/355 places, 11/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 8/355 places, 11/362 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-12
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-12 finished in 262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Graph (trivial) has 296 edges and 355 vertex of which 6 / 355 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 545 edges and 350 vertex of which 326 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 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 170 transitions
Trivial Post-agglo rules discarded 170 transitions
Performed 170 trivial Post agglomeration. Transition count delta: 170
Iterating post reduction 0 with 170 rules applied. Total rules applied 172 place count 325 transition count 182
Reduce places removed 170 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 177 rules applied. Total rules applied 349 place count 155 transition count 175
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 352 place count 153 transition count 174
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 353 place count 152 transition count 174
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 44 Pre rules applied. Total rules applied 353 place count 152 transition count 130
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 441 place count 108 transition count 130
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 460 place count 89 transition count 111
Iterating global reduction 4 with 19 rules applied. Total rules applied 479 place count 89 transition count 111
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 597 place count 30 transition count 52
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 616 place count 11 transition count 14
Iterating global reduction 4 with 19 rules applied. Total rules applied 635 place count 11 transition count 14
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 637 place count 9 transition count 12
Applied a total of 637 rules in 27 ms. Remains 9 /355 variables (removed 346) and now considering 12/362 (removed 350) transitions.
// Phase 1: matrix 12 rows 9 cols
[2024-05-24 00:27:23] [INFO ] Computed 0 invariants in 0 ms
[2024-05-24 00:27:23] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-24 00:27:23] [INFO ] Invariant cache hit.
[2024-05-24 00:27:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:27:23] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-24 00:27:23] [INFO ] Redundant transitions in 9 ms returned []
Running 8 sub problems to find dead transitions.
[2024-05-24 00:27:23] [INFO ] Invariant cache hit.
[2024-05-24 00:27:23] [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) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/21 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 10 constraints, problems are : Problem set: 0 solved, 8 unsolved in 53 ms.
Refiners :[State Equation: 9/9 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) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/21 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/21 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 67 ms.
Refiners :[State Equation: 9/9 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 123ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 123ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/355 places, 12/362 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 198 ms. Remains : 9/355 places, 12/362 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-13
Stuttering criterion allowed to conclude after 48 steps with 7 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-13 finished in 282 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 347 transition count 354
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 347 transition count 354
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 347 transition count 352
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 344 transition count 349
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 344 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 344 transition count 346
Applied a total of 27 rules in 17 ms. Remains 344 /355 variables (removed 11) and now considering 346/362 (removed 16) transitions.
// Phase 1: matrix 346 rows 344 cols
[2024-05-24 00:27:23] [INFO ] Computed 21 invariants in 4 ms
[2024-05-24 00:27:23] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-24 00:27:23] [INFO ] Invariant cache hit.
[2024-05-24 00:27:24] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Running 345 sub problems to find dead transitions.
[2024-05-24 00:27:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 345 unsolved in 19709 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 2 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 345/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/689 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 5 (OVERLAPS) 1/690 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
At refinement iteration 7 (OVERLAPS) 0/690 variables, 0/710 constraints. Problems are: Problem set: 0 solved, 345 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 710 constraints, problems are : Problem set: 0 solved, 345 unsolved in 22710 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 345/345 constraints, Known Traps: 0/0 constraints]
After SMT, in 42474ms problems are : Problem set: 0 solved, 345 unsolved
Search for dead transitions found 0 dead transitions in 42477ms
Starting structural reductions in LTL mode, iteration 1 : 344/355 places, 346/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42809 ms. Remains : 344/355 places, 346/362 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-14
Product exploration explored 100000 steps with 1455 reset in 133 ms.
Product exploration explored 100000 steps with 1455 reset in 198 ms.
Computed a total of 63 stabilizing places and 63 stable transitions
Graph (complete) has 535 edges and 344 vertex of which 320 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 40000 steps (224 resets) in 98 ms. (404 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (27 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
[2024-05-24 00:28:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 292/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/690 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/690 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 365 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 292/343 variables, 19/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 346/689 variables, 343/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/689 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/690 variables, 1/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/690 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 162 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 339ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 279 edges and 344 vertex of which 6 / 344 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 528 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.1 ms
Discarding 24 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 160 transitions
Trivial Post-agglo rules discarded 160 transitions
Performed 160 trivial Post agglomeration. Transition count delta: 160
Iterating post reduction 0 with 162 rules applied. Total rules applied 164 place count 315 transition count 174
Reduce places removed 160 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 161 rules applied. Total rules applied 325 place count 155 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 326 place count 154 transition count 173
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 326 place count 154 transition count 131
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 410 place count 112 transition count 131
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 431 place count 91 transition count 110
Iterating global reduction 3 with 21 rules applied. Total rules applied 452 place count 91 transition count 110
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 452 place count 91 transition count 109
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 454 place count 90 transition count 109
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 576 place count 29 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 77 edges and 29 vertex of which 28 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 3 with 2 rules applied. Total rules applied 578 place count 28 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 579 place count 28 transition count 46
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 596 place count 11 transition count 12
Iterating global reduction 5 with 17 rules applied. Total rules applied 613 place count 11 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 616 place count 9 transition count 11
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 12 edges and 9 vertex of which 8 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 5 with 2 rules applied. Total rules applied 618 place count 8 transition count 10
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 619 place count 8 transition count 9
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 620 place count 8 transition count 9
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 621 place count 8 transition count 8
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 622 place count 7 transition count 7
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 3 rules applied. Total rules applied 625 place count 6 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 626 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 626 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 628 place count 4 transition count 4
Applied a total of 628 rules in 19 ms. Remains 4 /344 variables (removed 340) and now considering 4/346 (removed 342) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 4/344 places, 4/346 transitions.
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 9 factoid took 241 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-24 00:28:08] [INFO ] Invariant cache hit.
[2024-05-24 00:28:08] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 00:28:08] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2024-05-24 00:28:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:28:08] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 6 ms returned sat
[2024-05-24 00:28:08] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-05-24 00:28:08] [INFO ] Computed and/alt/rep : 340/446/340 causal constraints (skipped 5 transitions) in 18 ms.
[2024-05-24 00:28:10] [INFO ] Added : 316 causal constraints over 64 iterations in 1539 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 2 out of 344 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 344/344 places, 346/346 transitions.
Graph (trivial) has 279 edges and 344 vertex of which 6 / 344 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 529 edges and 339 vertex of which 315 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.3 ms
Discarding 24 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 159 transitions
Trivial Post-agglo rules discarded 159 transitions
Performed 159 trivial Post agglomeration. Transition count delta: 159
Iterating post reduction 0 with 159 rules applied. Total rules applied 161 place count 314 transition count 177
Reduce places removed 159 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 160 rules applied. Total rules applied 321 place count 155 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 322 place count 154 transition count 176
Performed 43 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 43 Pre rules applied. Total rules applied 322 place count 154 transition count 133
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 408 place count 111 transition count 133
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 427 place count 92 transition count 114
Iterating global reduction 3 with 19 rules applied. Total rules applied 446 place count 92 transition count 114
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 568 place count 31 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 569 place count 31 transition count 52
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 587 place count 13 transition count 17
Iterating global reduction 4 with 18 rules applied. Total rules applied 605 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 607 place count 12 transition count 16
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 608 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 609 place count 11 transition count 15
Applied a total of 609 rules in 24 ms. Remains 11 /344 variables (removed 333) and now considering 15/346 (removed 331) transitions.
[2024-05-24 00:28:10] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
// Phase 1: matrix 14 rows 11 cols
[2024-05-24 00:28:10] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 00:28:10] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 00:28:10] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 00:28:10] [INFO ] Invariant cache hit.
[2024-05-24 00:28:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:28:10] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-24 00:28:10] [INFO ] Redundant transitions in 11 ms returned []
Running 9 sub problems to find dead transitions.
[2024-05-24 00:28:10] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 00:28:10] [INFO ] Invariant cache hit.
[2024-05-24 00:28:10] [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) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 74 ms.
Refiners :[State Equation: 11/11 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) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 73 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 169ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 169ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/344 places, 15/346 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 11/344 places, 15/346 transitions.
Computed a total of 5 stabilizing places and 7 stable transitions
Computed a total of 5 stabilizing places and 7 stable transitions
Detected a total of 5/11 stabilizing places and 7/15 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 6 factoid took 595 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 79 steps (7 resets) in 7 ms. (9 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 6 factoid took 758 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-24 00:28:12] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2024-05-24 00:28:12] [INFO ] Invariant cache hit.
[2024-05-24 00:28:12] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-24 00:28:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 00:28:12] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-24 00:28:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 00:28:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-24 00:28:12] [INFO ] Computed and/alt/rep : 9/21/9 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-24 00:28:12] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering criterion allowed to conclude after 6 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-14 finished in 48803 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||G(p2))))))'
Support contains 3 out of 355 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 355/355 places, 362/362 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 349 transition count 356
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 349 transition count 356
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 346 transition count 353
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 346 transition count 353
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 346 transition count 350
Applied a total of 21 rules in 16 ms. Remains 346 /355 variables (removed 9) and now considering 350/362 (removed 12) transitions.
// Phase 1: matrix 350 rows 346 cols
[2024-05-24 00:28:12] [INFO ] Computed 21 invariants in 2 ms
[2024-05-24 00:28:12] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-24 00:28:12] [INFO ] Invariant cache hit.
[2024-05-24 00:28:12] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 349 sub problems to find dead transitions.
[2024-05-24 00:28:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/695 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (OVERLAPS) 1/696 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (OVERLAPS) 0/696 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Real declared 696/696 variables, and 367 constraints, problems are : Problem set: 0 solved, 349 unsolved in 19832 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 349 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 2 (OVERLAPS) 350/695 variables, 345/366 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/695 variables, 349/715 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/695 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 5 (OVERLAPS) 1/696 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/696 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
At refinement iteration 7 (OVERLAPS) 0/696 variables, 0/716 constraints. Problems are: Problem set: 0 solved, 349 unsolved
No progress, stopping.
After SMT solving in domain Int declared 696/696 variables, and 716 constraints, problems are : Problem set: 0 solved, 349 unsolved in 24892 ms.
Refiners :[Generalized P Invariants (flows): 21/21 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 349/349 constraints, Known Traps: 0/0 constraints]
After SMT, in 44776ms problems are : Problem set: 0 solved, 349 unsolved
Search for dead transitions found 0 dead transitions in 44779ms
Starting structural reductions in LTL mode, iteration 1 : 346/355 places, 350/362 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45056 ms. Remains : 346/355 places, 350/362 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-15
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-15 finished in 45186 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(X(p1))||G(p2)||F(p3))))'
[2024-05-24 00:28:57] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12721358570568958817
[2024-05-24 00:28:57] [INFO ] Applying decomposition
[2024-05-24 00:28:57] [INFO ] Computing symmetric may disable matrix : 362 transitions.
[2024-05-24 00:28:57] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:28:57] [INFO ] Computing symmetric may enable matrix : 362 transitions.
[2024-05-24 00:28:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:28:57] [INFO ] Flatten gal took : 9 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/graph15674740147858133623.txt' '-o' '/tmp/graph15674740147858133623.bin' '-w' '/tmp/graph15674740147858133623.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15674740147858133623.bin' '-l' '-1' '-v' '-w' '/tmp/graph15674740147858133623.weights' '-q' '0' '-e' '0.001'
[2024-05-24 00:28:57] [INFO ] Decomposing Gal with order
[2024-05-24 00:28:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 00:28:57] [INFO ] Computing Do-Not-Accords matrix : 362 transitions.
[2024-05-24 00:28:57] [INFO ] Removed a total of 105 redundant transitions.
[2024-05-24 00:28:57] [INFO ] Computation of Completed DNA matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 00:28:57] [INFO ] Flatten gal took : 18 ms
[2024-05-24 00:28:57] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12721358570568958817
Running compilation step : cd /tmp/ltsmin12721358570568958817;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '720' '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'
[2024-05-24 00:28:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-24 00:28:57] [INFO ] Time to serialize gal into /tmp/LTLFireability274084643290982069.gal : 4 ms
[2024-05-24 00:28:57] [INFO ] Time to serialize properties into /tmp/LTLFireability7874755664116168303.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/LTLFireability274084643290982069.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7874755664116168303.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...275
Read 1 LTL properties
Checking formula 0 : !((X((("(((i12.i1.u86.p230==1)&&(i21.i1.u150.p397==1))&&(i21.i1.u148.p412==1))")||(X(X("(i3.i0.u26.p67==1)"))))||((G("(i3.i0.u26.p67==...191
Formula 0 simplified : X(!"(((i12.i1.u86.p230==1)&&(i21.i1.u150.p397==1))&&(i21.i1.u148.p412==1))" & XX!"(i3.i0.u26.p67==1)" & F!"(i3.i0.u26.p67==0)" & G!"...175
Reverse transition relation is NOT exact ! Due to transitions t320, i1.t315, i1.i2.t308, i2.t303, i2.i0.u21.t295, i3.i1.t278, i3.i1.t287, i4.t271, i4.i1.u3...723
Computing Next relation with stutter on 6.97252e+09 deadlock states
Compilation finished in 831 ms.
Running link step : cd /tmp/ltsmin12721358570568958817;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12721358570568958817;'/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' '--ltl' 'X(((LTLAPp0==true)||X(X((LTLAPp1==true)))||[]((LTLAPp2==true))||<>((LTLAPp3==true))))' '--buchi-type=spotba'
169 unique states visited
169 strongly connected components in search stack
170 transitions explored
169 items max in DFS search stack
288 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,2.92502,94236,1,0,193756,401,4053,220736,160,1465,296593
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 855816 ms.

BK_STOP 1716510544154

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-20b"
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-20b, 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-171640603600540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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