Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K 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.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 22:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Apr 11 22:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 22:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 22:13 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 122K 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-24b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-24b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717198181173

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-24b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:29:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:29:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:29:42] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-31 23:29:42] [INFO ] Transformed 492 places.
[2024-05-31 23:29:42] [INFO ] Transformed 517 transitions.
[2024-05-31 23:29:42] [INFO ] Found NUPN structural information;
[2024-05-31 23:29:42] [INFO ] Parsed PT model containing 492 places and 517 transitions and 1277 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 492 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 492/492 places, 517/517 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 491 transition count 517
Discarding 50 places :
Symmetric choice reduction at 1 with 50 rule applications. Total rules 51 place count 441 transition count 467
Iterating global reduction 1 with 50 rules applied. Total rules applied 101 place count 441 transition count 467
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 126 place count 416 transition count 442
Iterating global reduction 1 with 25 rules applied. Total rules applied 151 place count 416 transition count 442
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 173 place count 416 transition count 420
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 174 place count 415 transition count 419
Iterating global reduction 2 with 1 rules applied. Total rules applied 175 place count 415 transition count 419
Applied a total of 175 rules in 129 ms. Remains 415 /492 variables (removed 77) and now considering 419/517 (removed 98) transitions.
// Phase 1: matrix 419 rows 415 cols
[2024-05-31 23:29:42] [INFO ] Computed 25 invariants in 24 ms
[2024-05-31 23:29:43] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-31 23:29:43] [INFO ] Invariant cache hit.
[2024-05-31 23:29:43] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-05-31 23:29:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 419/833 variables, 414/439 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/833 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (OVERLAPS) 1/834 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/834 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (OVERLAPS) 0/834 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 440 constraints, problems are : Problem set: 0 solved, 418 unsolved in 28511 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 418 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 419/833 variables, 414/439 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/833 variables, 418/857 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/833 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (OVERLAPS) 1/834 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/834 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 7 (OVERLAPS) 0/834 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 418 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 858 constraints, problems are : Problem set: 0 solved, 418 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 0/0 constraints]
After SMT, in 58694ms problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 58709ms
Starting structural reductions in LTL mode, iteration 1 : 415/492 places, 419/517 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59417 ms. Remains : 415/492 places, 419/517 transitions.
Support contains 19 out of 415 places after structural reductions.
[2024-05-31 23:30:42] [INFO ] Flatten gal took : 60 ms
[2024-05-31 23:30:42] [INFO ] Flatten gal took : 25 ms
[2024-05-31 23:30:42] [INFO ] Input system was already deterministic with 419 transitions.
RANDOM walk for 40000 steps (186 resets) in 1545 ms. (25 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40003 steps (22 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (22 resets) in 139 ms. (285 steps per ms) remains 2/2 properties
[2024-05-31 23:30:43] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 384/388 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/414 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 419/833 variables, 414/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/834 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/834 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/834 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 834/834 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 224 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 384/388 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 26/414 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 419/833 variables, 414/439 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/833 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/833 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/834 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/834 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/834 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 834/834 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 258 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 489ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 945 steps, including 6 resets, run visited all 2 properties in 5 ms. (steps per millisecond=189 )
Parikh walk visited 2 properties in 11 ms.
Computed a total of 79 stabilizing places and 79 stable transitions
Graph (complete) has 644 edges and 415 vertex of which 387 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.16 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)))'
Support contains 3 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 419/419 transitions.
Graph (trivial) has 338 edges and 415 vertex of which 6 / 415 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 638 edges and 410 vertex of which 382 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.2 ms
Discarding 28 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 196 transitions
Trivial Post-agglo rules discarded 196 transitions
Performed 196 trivial Post agglomeration. Transition count delta: 196
Iterating post reduction 0 with 196 rules applied. Total rules applied 198 place count 381 transition count 213
Reduce places removed 196 places and 0 transitions.
Iterating post reduction 1 with 196 rules applied. Total rules applied 394 place count 185 transition count 213
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 51 Pre rules applied. Total rules applied 394 place count 185 transition count 162
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 496 place count 134 transition count 162
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 519 place count 111 transition count 139
Iterating global reduction 2 with 23 rules applied. Total rules applied 542 place count 111 transition count 139
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 688 place count 38 transition count 66
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 689 place count 38 transition count 65
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 711 place count 16 transition count 22
Iterating global reduction 3 with 22 rules applied. Total rules applied 733 place count 16 transition count 22
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 3 with 4 rules applied. Total rules applied 737 place count 14 transition count 21
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 739 place count 14 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 740 place count 13 transition count 20
Applied a total of 740 rules in 46 ms. Remains 13 /415 variables (removed 402) and now considering 20/419 (removed 399) transitions.
[2024-05-31 23:30:43] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 13 cols
[2024-05-31 23:30:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:30:43] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 23:30:43] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:30:43] [INFO ] Invariant cache hit.
[2024-05-31 23:30:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:30:43] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-31 23:30:43] [INFO ] Redundant transitions in 9 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-31 23:30:43] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-31 23:30:43] [INFO ] Invariant cache hit.
[2024-05-31 23:30:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 1/32 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 14 constraints, problems are : Problem set: 0 solved, 12 unsolved in 113 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 18/28 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 3/31 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 7/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 1/32 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/32 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 26 constraints, problems are : Problem set: 0 solved, 12 unsolved in 93 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 218ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/415 places, 20/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 326 ms. Remains : 13/415 places, 20/419 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLCardinality-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLCardinality-00 finished in 527 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(((X(F(p1))||p0) U (!p1||G(p2))))))'
Support contains 5 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 419/419 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 411 transition count 415
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 411 transition count 415
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 411 transition count 414
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 410 transition count 413
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 410 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 410 transition count 412
Applied a total of 12 rules in 24 ms. Remains 410 /415 variables (removed 5) and now considering 412/419 (removed 7) transitions.
// Phase 1: matrix 412 rows 410 cols
[2024-05-31 23:30:44] [INFO ] Computed 25 invariants in 7 ms
[2024-05-31 23:30:44] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 23:30:44] [INFO ] Invariant cache hit.
[2024-05-31 23:30:44] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2024-05-31 23:30:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 412/821 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/821 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (OVERLAPS) 1/822 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/822 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (OVERLAPS) 0/822 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 411 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 435 constraints, problems are : Problem set: 0 solved, 411 unsolved in 27067 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/409 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/409 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 412/821 variables, 409/434 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/821 variables, 411/845 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 0/845 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 5 (OVERLAPS) 1/822 variables, 1/846 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 7 (OVERLAPS) 0/822 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 411 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 846 constraints, problems are : Problem set: 0 solved, 411 unsolved in 29148 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 410/410 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 0/0 constraints]
After SMT, in 56313ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 56320ms
Starting structural reductions in LTL mode, iteration 1 : 410/415 places, 412/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56662 ms. Remains : 410/415 places, 412/419 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p1), (AND p1 (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLCardinality-01
Stuttering criterion allowed to conclude after 201 steps with 0 reset in 5 ms.
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLCardinality-01 finished in 56903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(X((X(G(p0))&&p1))) U p2)||X(p1))))'
Support contains 6 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 419/419 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 410 transition count 414
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 410 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 410 transition count 413
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 409 transition count 412
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 409 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 409 transition count 411
Applied a total of 14 rules in 20 ms. Remains 409 /415 variables (removed 6) and now considering 411/419 (removed 8) transitions.
// Phase 1: matrix 411 rows 409 cols
[2024-05-31 23:31:41] [INFO ] Computed 25 invariants in 4 ms
[2024-05-31 23:31:41] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-31 23:31:41] [INFO ] Invariant cache hit.
[2024-05-31 23:31:41] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2024-05-31 23:31:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (OVERLAPS) 1/820 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (OVERLAPS) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 434 constraints, problems are : Problem set: 0 solved, 410 unsolved in 26684 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 410/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 1/820 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 844 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
After SMT, in 56786ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 56791ms
Starting structural reductions in LTL mode, iteration 1 : 409/415 places, 411/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57174 ms. Remains : 409/415 places, 411/419 transitions.
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLCardinality-02
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 164 ms.
Computed a total of 76 stabilizing places and 76 stable transitions
Graph (complete) has 636 edges and 409 vertex of which 381 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.6 ms
Computed a total of 76 stabilizing places and 76 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 21 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLCardinality-02 finished in 57913 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (G(p0) U p1)))'
Support contains 3 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 419/419 transitions.
Graph (trivial) has 339 edges and 415 vertex of which 6 / 415 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 638 edges and 410 vertex of which 382 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.1 ms
Discarding 28 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 197 transitions
Trivial Post-agglo rules discarded 197 transitions
Performed 197 trivial Post agglomeration. Transition count delta: 197
Iterating post reduction 0 with 197 rules applied. Total rules applied 199 place count 381 transition count 212
Reduce places removed 197 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 199 rules applied. Total rules applied 398 place count 184 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 399 place count 183 transition count 210
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 52 Pre rules applied. Total rules applied 399 place count 183 transition count 158
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 3 with 104 rules applied. Total rules applied 503 place count 131 transition count 158
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 526 place count 108 transition count 135
Iterating global reduction 3 with 23 rules applied. Total rules applied 549 place count 108 transition count 135
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 689 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 690 place count 38 transition count 64
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 712 place count 16 transition count 21
Iterating global reduction 4 with 22 rules applied. Total rules applied 734 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 738 place count 14 transition count 20
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 740 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 741 place count 13 transition count 19
Applied a total of 741 rules in 39 ms. Remains 13 /415 variables (removed 402) and now considering 19/419 (removed 400) transitions.
[2024-05-31 23:32:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
// Phase 1: matrix 18 rows 13 cols
[2024-05-31 23:32:39] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 23:32:39] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-31 23:32:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-31 23:32:39] [INFO ] Invariant cache hit.
[2024-05-31 23:32:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:32:39] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-31 23:32:39] [INFO ] Redundant transitions in 9 ms returned []
Running 15 sub problems to find dead transitions.
[2024-05-31 23:32:39] [INFO ] Flow matrix only has 18 transitions (discarded 1 similar events)
[2024-05-31 23:32:39] [INFO ] Invariant cache hit.
[2024-05-31 23:32: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 103 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, 6/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 2/30 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/30 variables, 9/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 118 ms.
Refiners :[State Equation: 13/13 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 231ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 231ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/415 places, 19/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 13/415 places, 19/419 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLCardinality-05 finished in 561 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 2 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 419/419 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 410 transition count 414
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 410 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 410 transition count 413
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 409 transition count 412
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 409 transition count 412
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 409 transition count 411
Applied a total of 14 rules in 22 ms. Remains 409 /415 variables (removed 6) and now considering 411/419 (removed 8) transitions.
// Phase 1: matrix 411 rows 409 cols
[2024-05-31 23:32:39] [INFO ] Computed 25 invariants in 3 ms
[2024-05-31 23:32:39] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-31 23:32:39] [INFO ] Invariant cache hit.
[2024-05-31 23:32:40] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
Running 410 sub problems to find dead transitions.
[2024-05-31 23:32:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (OVERLAPS) 1/820 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (OVERLAPS) 0/820 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Real declared 820/820 variables, and 434 constraints, problems are : Problem set: 0 solved, 410 unsolved in 26904 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 410 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/408 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/408 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 2 (OVERLAPS) 411/819 variables, 408/433 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/819 variables, 410/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/819 variables, 0/843 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 5 (OVERLAPS) 1/820 variables, 1/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 7 (OVERLAPS) 0/820 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 410 unsolved
No progress, stopping.
After SMT solving in domain Int declared 820/820 variables, and 844 constraints, problems are : Problem set: 0 solved, 410 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 409/409 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints]
After SMT, in 56988ms problems are : Problem set: 0 solved, 410 unsolved
Search for dead transitions found 0 dead transitions in 56992ms
Starting structural reductions in LTL mode, iteration 1 : 409/415 places, 411/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57343 ms. Remains : 409/415 places, 411/419 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLCardinality-08
Stuttering criterion allowed to conclude after 443 steps with 1 reset in 4 ms.
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-24b-LTLCardinality-08 finished in 57464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((p0&&X(F(p0)))))))'
Support contains 1 out of 415 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 415/415 places, 419/419 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 409 transition count 413
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 409 transition count 413
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 409 transition count 412
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 408 transition count 411
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 408 transition count 411
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 408 transition count 410
Applied a total of 16 rules in 21 ms. Remains 408 /415 variables (removed 7) and now considering 410/419 (removed 9) transitions.
// Phase 1: matrix 410 rows 408 cols
[2024-05-31 23:33:37] [INFO ] Computed 25 invariants in 6 ms
[2024-05-31 23:33:37] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-05-31 23:33:37] [INFO ] Invariant cache hit.
[2024-05-31 23:33:37] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 409 sub problems to find dead transitions.
[2024-05-31 23:33:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (OVERLAPS) 1/818 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (OVERLAPS) 0/818 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Real declared 818/818 variables, and 433 constraints, problems are : Problem set: 0 solved, 409 unsolved in 27496 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 409 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/407 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 2 (OVERLAPS) 410/817 variables, 407/432 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/817 variables, 409/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 5 (OVERLAPS) 1/818 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
At refinement iteration 7 (OVERLAPS) 0/818 variables, 0/842 constraints. Problems are: Problem set: 0 solved, 409 unsolved
No progress, stopping.
After SMT solving in domain Int declared 818/818 variables, and 842 constraints, problems are : Problem set: 0 solved, 409 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 25/25 constraints, State Equation: 408/408 constraints, PredecessorRefiner: 409/409 constraints, Known Traps: 0/0 constraints]
After SMT, in 57572ms problems are : Problem set: 0 solved, 409 unsolved
Search for dead transitions found 0 dead transitions in 57577ms
Starting structural reductions in LTL mode, iteration 1 : 408/415 places, 410/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57931 ms. Remains : 408/415 places, 410/419 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : GPUForwardProgress-PT-24b-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 243 ms.
Product exploration explored 100000 steps with 33333 reset in 141 ms.
Computed a total of 75 stabilizing places and 75 stable transitions
Graph (complete) has 635 edges and 408 vertex of which 380 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.4 ms
Computed a total of 75 stabilizing places and 75 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 17 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-24b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-24b-LTLCardinality-10 finished in 58505 ms.
All properties solved by simple procedures.
Total runtime 293317 ms.
ITS solved all properties within timeout

BK_STOP 1717198475734

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-24b.tgz
mv GPUForwardProgress-PT-24b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;