fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r201-smll-167840347200076
Last Updated
May 14, 2023

About the Execution of LTSMin+red for GPUForwardProgress-PT-20b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
402.936 29672.00 50667.00 498.00 FFTFFFFTTFFFTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r201-smll-167840347200076.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
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 r201-smll-167840347200076
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 14:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 14:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Feb 25 14:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 14:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 14:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 103K Mar 5 18:22 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 1678528072211

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-20b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-11 09:47:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 09:47:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 09:47:55] [INFO ] Load time of PNML (sax parser for PT used): 129 ms
[2023-03-11 09:47:55] [INFO ] Transformed 416 places.
[2023-03-11 09:47:55] [INFO ] Transformed 437 transitions.
[2023-03-11 09:47:55] [INFO ] Found NUPN structural information;
[2023-03-11 09:47:55] [INFO ] Parsed PT model containing 416 places and 437 transitions and 1077 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-20b-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 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 40 places :
Symmetric choice reduction at 1 with 40 rule applications. Total rules 41 place count 375 transition count 397
Iterating global reduction 1 with 40 rules applied. Total rules applied 81 place count 375 transition count 397
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 95 place count 361 transition count 383
Iterating global reduction 1 with 14 rules applied. Total rules applied 109 place count 361 transition count 383
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 121 place count 361 transition count 371
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 122 place count 360 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 360 transition count 370
Applied a total of 123 rules in 141 ms. Remains 360 /416 variables (removed 56) and now considering 370/437 (removed 67) transitions.
// Phase 1: matrix 370 rows 360 cols
[2023-03-11 09:47:55] [INFO ] Computed 21 place invariants in 32 ms
[2023-03-11 09:47:56] [INFO ] Implicit Places using invariants in 566 ms returned []
[2023-03-11 09:47:56] [INFO ] Invariant cache hit.
[2023-03-11 09:47:56] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2023-03-11 09:47:56] [INFO ] Invariant cache hit.
[2023-03-11 09:47:57] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 360/416 places, 370/437 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1475 ms. Remains : 360/416 places, 370/437 transitions.
Support contains 37 out of 360 places after structural reductions.
[2023-03-11 09:47:57] [INFO ] Flatten gal took : 90 ms
[2023-03-11 09:47:57] [INFO ] Flatten gal took : 33 ms
[2023-03-11 09:47:57] [INFO ] Input system was already deterministic with 370 transitions.
Support contains 34 out of 360 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 56 resets, run finished after 704 ms. (steps per millisecond=14 ) properties (out of 32) seen :23
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-11 09:47:58] [INFO ] Invariant cache hit.
[2023-03-11 09:47:58] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-11 09:47:59] [INFO ] After 237ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2023-03-11 09:47:59] [INFO ] After 318ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:7
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-11 09:47:59] [INFO ] After 639ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:7
[2023-03-11 09:47:59] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 16 ms returned sat
[2023-03-11 09:47:59] [INFO ] After 349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-11 09:48:00] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 155 ms.
[2023-03-11 09:48:00] [INFO ] After 1098ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 4 different solutions.
Finished Parikh walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 9 properties in 19 ms.
Computed a total of 66 stabilizing places and 66 stable transitions
Graph (complete) has 559 edges and 360 vertex of which 336 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 350 transition count 360
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 350 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 350 transition count 357
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 345 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 345 transition count 352
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 345 transition count 347
Applied a total of 38 rules in 59 ms. Remains 345 /360 variables (removed 15) and now considering 347/370 (removed 23) transitions.
// Phase 1: matrix 347 rows 345 cols
[2023-03-11 09:48:01] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-11 09:48:01] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-11 09:48:01] [INFO ] Invariant cache hit.
[2023-03-11 09:48:01] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-11 09:48:01] [INFO ] Invariant cache hit.
[2023-03-11 09:48:01] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/360 places, 347/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 841 ms. Remains : 345/360 places, 347/370 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(NEQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 52495 steps with 295 reset in 270 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-00 finished in 1520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Graph (trivial) has 303 edges and 360 vertex of which 6 / 360 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 553 edges and 355 vertex of which 331 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 330 transition count 188
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 184 rules applied. Total rules applied 358 place count 158 transition count 176
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 363 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 364 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 364 place count 153 transition count 134
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 446 place count 112 transition count 134
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 466 place count 92 transition count 114
Iterating global reduction 4 with 20 rules applied. Total rules applied 486 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 4 with 122 rules applied. Total rules applied 608 place count 31 transition count 53
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 625 place count 14 transition count 19
Iterating global reduction 4 with 17 rules applied. Total rules applied 642 place count 14 transition count 19
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 646 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 647 place count 11 transition count 17
Applied a total of 647 rules in 53 ms. Remains 11 /360 variables (removed 349) and now considering 17/370 (removed 353) transitions.
[2023-03-11 09:48:02] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2023-03-11 09:48:02] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 09:48:02] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 09:48:02] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-11 09:48:02] [INFO ] Invariant cache hit.
[2023-03-11 09:48:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:48:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 09:48:02] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 09:48:02] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-11 09:48:02] [INFO ] Invariant cache hit.
[2023-03-11 09:48:02] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/360 places, 17/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 11/360 places, 17/370 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s3 1), p0:(AND (EQ s3 0) (EQ s7 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-01 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 349 transition count 359
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 349 transition count 359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 349 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 344 transition count 351
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 344 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 344 transition count 346
Applied a total of 40 rules in 44 ms. Remains 344 /360 variables (removed 16) and now considering 346/370 (removed 24) transitions.
// Phase 1: matrix 346 rows 344 cols
[2023-03-11 09:48:02] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-11 09:48:02] [INFO ] Implicit Places using invariants in 160 ms returned []
[2023-03-11 09:48:02] [INFO ] Invariant cache hit.
[2023-03-11 09:48:03] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2023-03-11 09:48:03] [INFO ] Invariant cache hit.
[2023-03-11 09:48:03] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/360 places, 346/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 344/360 places, 346/370 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s125 0) (EQ s318 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 476 ms.
Product exploration explored 100000 steps with 50000 reset in 488 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.9 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 :(X p0)
Knowledge based reduction with 3 factoid took 71 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-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-02 finished in 2006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(G(p1))&&G(p2))))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 350 transition count 360
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 350 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 350 transition count 357
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 345 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 345 transition count 352
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 345 transition count 347
Applied a total of 38 rules in 40 ms. Remains 345 /360 variables (removed 15) and now considering 347/370 (removed 23) transitions.
// Phase 1: matrix 347 rows 345 cols
[2023-03-11 09:48:04] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-11 09:48:04] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-11 09:48:04] [INFO ] Invariant cache hit.
[2023-03-11 09:48:05] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
[2023-03-11 09:48:05] [INFO ] Invariant cache hit.
[2023-03-11 09:48:05] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/360 places, 347/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 813 ms. Remains : 345/360 places, 347/370 transitions.
Stuttering acceptance computed with spot in 179 ms :[true, (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s339 1), p2:(EQ s18 1), p1:(OR (EQ s18 1) (EQ s339 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-03 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 349 transition count 359
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 349 transition count 359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 349 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 344 transition count 351
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 344 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 344 transition count 346
Applied a total of 40 rules in 28 ms. Remains 344 /360 variables (removed 16) and now considering 346/370 (removed 24) transitions.
// Phase 1: matrix 346 rows 344 cols
[2023-03-11 09:48:05] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-11 09:48:05] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-11 09:48:05] [INFO ] Invariant cache hit.
[2023-03-11 09:48:06] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
[2023-03-11 09:48:06] [INFO ] Invariant cache hit.
[2023-03-11 09:48:06] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/360 places, 346/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 820 ms. Remains : 344/360 places, 346/370 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s50 1) (EQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 169 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 991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||G((p1 U p2))))'
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 350 transition count 360
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 350 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 350 transition count 357
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 346 transition count 353
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 346 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 346 transition count 349
Applied a total of 35 rules in 20 ms. Remains 346 /360 variables (removed 14) and now considering 349/370 (removed 21) transitions.
// Phase 1: matrix 349 rows 346 cols
[2023-03-11 09:48:06] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-11 09:48:06] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-11 09:48:06] [INFO ] Invariant cache hit.
[2023-03-11 09:48:07] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
[2023-03-11 09:48:07] [INFO ] Invariant cache hit.
[2023-03-11 09:48:07] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 346/360 places, 349/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 770 ms. Remains : 346/360 places, 349/370 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(OR p2 p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(OR p2 p1), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(EQ s153 1), p1:(EQ s252 1), p0:(EQ s314 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-05 finished in 1100 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Graph (trivial) has 302 edges and 360 vertex of which 6 / 360 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 553 edges and 355 vertex of which 331 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 330 transition count 188
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 183 rules applied. Total rules applied 357 place count 158 transition count 177
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 362 place count 155 transition count 175
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 364 place count 153 transition count 175
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 364 place count 153 transition count 133
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 448 place count 111 transition count 133
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 468 place count 91 transition count 113
Iterating global reduction 4 with 20 rules applied. Total rules applied 488 place count 91 transition count 113
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 4 with 120 rules applied. Total rules applied 608 place count 31 transition count 53
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 625 place count 14 transition count 19
Iterating global reduction 4 with 17 rules applied. Total rules applied 642 place count 14 transition count 19
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 646 place count 12 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 647 place count 11 transition count 17
Applied a total of 647 rules in 28 ms. Remains 11 /360 variables (removed 349) and now considering 17/370 (removed 353) transitions.
[2023-03-11 09:48:07] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 11 cols
[2023-03-11 09:48:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 09:48:07] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 09:48:07] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-11 09:48:07] [INFO ] Invariant cache hit.
[2023-03-11 09:48:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:48:07] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-11 09:48:07] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 09:48:07] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
[2023-03-11 09:48:07] [INFO ] Invariant cache hit.
[2023-03-11 09:48:07] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/360 places, 17/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 151 ms. Remains : 11/360 places, 17/370 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-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s2 0), p0:(EQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 109 steps with 11 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-06 finished in 248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U G(p1)))||F(p2)))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 350 transition count 360
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 350 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 350 transition count 357
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 345 transition count 352
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 345 transition count 352
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 38 place count 345 transition count 347
Applied a total of 38 rules in 22 ms. Remains 345 /360 variables (removed 15) and now considering 347/370 (removed 23) transitions.
// Phase 1: matrix 347 rows 345 cols
[2023-03-11 09:48:08] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-11 09:48:08] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-11 09:48:08] [INFO ] Invariant cache hit.
[2023-03-11 09:48:08] [INFO ] Implicit Places using invariants and state equation in 313 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-11 09:48:08] [INFO ] Invariant cache hit.
[2023-03-11 09:48:08] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 345/360 places, 347/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 809 ms. Remains : 345/360 places, 347/370 transitions.
Stuttering acceptance computed with spot in 166 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 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s151 1) (EQ s332 1) (EQ s343 1)), p1:(NEQ s240 1), p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 582 reset in 369 ms.
Product exploration explored 100000 steps with 579 reset in 333 ms.
Computed a total of 64 stabilizing places and 64 stable transitions
Graph (complete) has 536 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.5 ms
Computed a total of 64 stabilizing places and 64 stable transitions
Detected a total of 64/345 stabilizing places and 64/347 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 644 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 57 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :2
Finished Best-First random walk after 3384 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=307 )
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (AND (NOT p2) p1 (NOT p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1)))]
Knowledge based reduction with 13 factoid took 661 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 4 out of 345 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 345/345 places, 347/347 transitions.
Applied a total of 0 rules in 6 ms. Remains 345 /345 variables (removed 0) and now considering 347/347 (removed 0) transitions.
[2023-03-11 09:48:11] [INFO ] Invariant cache hit.
[2023-03-11 09:48:11] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-11 09:48:11] [INFO ] Invariant cache hit.
[2023-03-11 09:48:11] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
[2023-03-11 09:48:11] [INFO ] Invariant cache hit.
[2023-03-11 09:48:12] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 729 ms. Remains : 345/345 places, 347/347 transitions.
Computed a total of 64 stabilizing places and 64 stable transitions
Graph (complete) has 536 edges and 345 vertex of which 321 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.4 ms
Computed a total of 64 stabilizing places and 64 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 245 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 58 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 09:48:12] [INFO ] Invariant cache hit.
[2023-03-11 09:48:12] [INFO ] [Real]Absence check using 0 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-11 09:48:12] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 09:48:12] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-11 09:48:13] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 09:48:13] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-11 09:48:13] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 168 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 6 factoid took 343 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Stuttering criterion allowed to conclude after 26215 steps with 151 reset in 47 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-09 finished in 5943 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(!p0)))))'
Support contains 1 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 349 transition count 359
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 349 transition count 359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 349 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 344 transition count 351
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 344 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 344 transition count 346
Applied a total of 40 rules in 21 ms. Remains 344 /360 variables (removed 16) and now considering 346/370 (removed 24) transitions.
// Phase 1: matrix 346 rows 344 cols
[2023-03-11 09:48:14] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-11 09:48:14] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-11 09:48:14] [INFO ] Invariant cache hit.
[2023-03-11 09:48:14] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-11 09:48:14] [INFO ] Invariant cache hit.
[2023-03-11 09:48:14] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/360 places, 346/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 344/360 places, 346/370 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, true, true, p0, p0]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s59 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 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 942 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((((p0 U p1)||F(p2)) U p3))))'
Support contains 5 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Graph (trivial) has 299 edges and 360 vertex of which 6 / 360 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 553 edges and 355 vertex of which 331 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions 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 330 transition count 190
Reduce places removed 170 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions 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 352 place count 160 transition count 180
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 358 place count 157 transition count 177
Reduce places removed 3 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 3 with 5 rules applied. Total rules applied 363 place count 154 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 364 place count 153 transition count 175
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 41 Pre rules applied. Total rules applied 364 place count 153 transition count 134
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 5 with 82 rules applied. Total rules applied 446 place count 112 transition count 134
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 466 place count 92 transition count 114
Iterating global reduction 5 with 20 rules applied. Total rules applied 486 place count 92 transition count 114
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 0 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 5 with 114 rules applied. Total rules applied 600 place count 35 transition count 57
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 617 place count 18 transition count 23
Iterating global reduction 5 with 17 rules applied. Total rules applied 634 place count 18 transition count 23
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 5 with 4 rules applied. Total rules applied 638 place count 16 transition count 22
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 640 place count 16 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 641 place count 15 transition count 21
Applied a total of 641 rules in 37 ms. Remains 15 /360 variables (removed 345) and now considering 21/370 (removed 349) transitions.
[2023-03-11 09:48:15] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
// Phase 1: matrix 20 rows 15 cols
[2023-03-11 09:48:15] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 09:48:15] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-11 09:48:15] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2023-03-11 09:48:15] [INFO ] Invariant cache hit.
[2023-03-11 09:48:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:48:15] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2023-03-11 09:48:15] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 09:48:15] [INFO ] Flow matrix only has 20 transitions (discarded 1 similar events)
[2023-03-11 09:48:15] [INFO ] Invariant cache hit.
[2023-03-11 09:48:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/360 places, 21/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 15/360 places, 21/370 transitions.
Stuttering acceptance computed with spot in 274 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND p3 (NOT p2)) (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(OR (AND (NOT p3) p1 (NOT p2)) (AND (NOT p3) p0 (NOT p2))), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(EQ s8 1), p1:(AND (EQ s7 1) (EQ s3 1)), p0:(EQ s9 1), p2:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-11 finished in 484 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1&&(p2||X(G(p2)))))))))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 349 transition count 359
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 349 transition count 359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 349 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 344 transition count 351
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 344 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 344 transition count 346
Applied a total of 40 rules in 40 ms. Remains 344 /360 variables (removed 16) and now considering 346/370 (removed 24) transitions.
// Phase 1: matrix 346 rows 344 cols
[2023-03-11 09:48:15] [INFO ] Computed 21 place invariants in 6 ms
[2023-03-11 09:48:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-11 09:48:15] [INFO ] Invariant cache hit.
[2023-03-11 09:48:16] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
[2023-03-11 09:48:16] [INFO ] Invariant cache hit.
[2023-03-11 09:48:16] [INFO ] Dead Transitions using invariants and state equation in 296 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/360 places, 346/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 847 ms. Remains : 344/360 places, 346/370 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(EQ s182 1), p0:(EQ s182 0), p2:(EQ s261 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 434 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.3 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Detected a total of 63/344 stabilizing places and 63/346 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0 (NOT p2))
Knowledge based reduction with 8 factoid took 335 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-12 finished in 2203 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((F(p1) U p2)&&p0))))'
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Graph (trivial) has 301 edges and 360 vertex of which 6 / 360 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 553 edges and 355 vertex of which 331 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 removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 172 transitions
Trivial Post-agglo rules discarded 172 transitions
Performed 172 trivial Post agglomeration. Transition count delta: 172
Iterating post reduction 0 with 172 rules applied. Total rules applied 174 place count 330 transition count 188
Reduce places removed 172 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 181 rules applied. Total rules applied 355 place count 158 transition count 179
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 358 place count 156 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 359 place count 155 transition count 178
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 42 Pre rules applied. Total rules applied 359 place count 155 transition count 136
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 443 place count 113 transition count 136
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 463 place count 93 transition count 116
Iterating global reduction 4 with 20 rules applied. Total rules applied 483 place count 93 transition count 116
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 601 place count 34 transition count 57
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 617 place count 18 transition count 25
Iterating global reduction 4 with 16 rules applied. Total rules applied 633 place count 18 transition count 25
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 639 place count 15 transition count 24
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 643 place count 15 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 644 place count 14 transition count 23
Applied a total of 644 rules in 31 ms. Remains 14 /360 variables (removed 346) and now considering 23/370 (removed 347) transitions.
[2023-03-11 09:48:17] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
// Phase 1: matrix 21 rows 14 cols
[2023-03-11 09:48:17] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 09:48:17] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 09:48:17] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-11 09:48:17] [INFO ] Invariant cache hit.
[2023-03-11 09:48:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 09:48:17] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-11 09:48:17] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-11 09:48:17] [INFO ] Flow matrix only has 21 transitions (discarded 2 similar events)
[2023-03-11 09:48:17] [INFO ] Invariant cache hit.
[2023-03-11 09:48:17] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/360 places, 23/370 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 132 ms. Remains : 14/360 places, 23/370 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s2 1)), p2:(EQ s2 1), p1:(EQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-13 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F((p0&&X(p1)))||G(p2))))))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 350 transition count 360
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 350 transition count 360
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 23 place count 350 transition count 357
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 346 transition count 353
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 346 transition count 353
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 35 place count 346 transition count 349
Applied a total of 35 rules in 22 ms. Remains 346 /360 variables (removed 14) and now considering 349/370 (removed 21) transitions.
// Phase 1: matrix 349 rows 346 cols
[2023-03-11 09:48:17] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-11 09:48:18] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-11 09:48:18] [INFO ] Invariant cache hit.
[2023-03-11 09:48:18] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2023-03-11 09:48:18] [INFO ] Invariant cache hit.
[2023-03-11 09:48:18] [INFO ] Dead Transitions using invariants and state equation in 290 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 346/360 places, 349/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 346/360 places, 349/370 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (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-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s52 1), p1:(EQ s52 0), p2:(EQ s13 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-20b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-14 finished in 1114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(G(p0)))||F(p1))))'
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 360/360 places, 370/370 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 349 transition count 359
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 349 transition count 359
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 349 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 344 transition count 351
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 344 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 344 transition count 346
Applied a total of 40 rules in 20 ms. Remains 344 /360 variables (removed 16) and now considering 346/370 (removed 24) transitions.
// Phase 1: matrix 346 rows 344 cols
[2023-03-11 09:48:19] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-11 09:48:19] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-11 09:48:19] [INFO ] Invariant cache hit.
[2023-03-11 09:48:19] [INFO ] Implicit Places using invariants and state equation in 311 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2023-03-11 09:48:19] [INFO ] Invariant cache hit.
[2023-03-11 09:48:19] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 344/360 places, 346/370 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 769 ms. Remains : 344/360 places, 346/370 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-20b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(EQ s330 0), p0:(EQ s224 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 417 ms.
Product exploration explored 100000 steps with 50000 reset in 426 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.5 ms
Computed a total of 63 stabilizing places and 63 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-20b-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-20b-LTLFireability-15 finished in 1884 ms.
All properties solved by simple procedures.
Total runtime 26085 ms.
ITS solved all properties within timeout

BK_STOP 1678528101883

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r201-smll-167840347200076"
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 ;