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.r197-tall-171640625300307.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 gold2023
Input is GPUForwardProgress-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625300307
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Apr 11 22:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 22:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 11 22:27 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 46K 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-08b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-08b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716554072524

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=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-08b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-24 12:34:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:34:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:34:34] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-24 12:34:34] [INFO ] Transformed 188 places.
[2024-05-24 12:34:34] [INFO ] Transformed 197 transitions.
[2024-05-24 12:34:34] [INFO ] Found NUPN structural information;
[2024-05-24 12:34:34] [INFO ] Parsed PT model containing 188 places and 197 transitions and 477 arcs in 112 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 197/197 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 187 transition count 197
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 172 transition count 182
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 172 transition count 182
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 39 place count 164 transition count 174
Iterating global reduction 1 with 8 rules applied. Total rules applied 47 place count 164 transition count 174
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 53 place count 164 transition count 168
Applied a total of 53 rules in 47 ms. Remains 164 /188 variables (removed 24) and now considering 168/197 (removed 29) transitions.
// Phase 1: matrix 168 rows 164 cols
[2024-05-24 12:34:34] [INFO ] Computed 9 invariants in 14 ms
[2024-05-24 12:34:34] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-24 12:34:34] [INFO ] Invariant cache hit.
[2024-05-24 12:34:34] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-24 12:34:34] [INFO ] Invariant cache hit.
[2024-05-24 12:34:34] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 164/188 places, 168/197 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 506 ms. Remains : 164/188 places, 168/197 transitions.
Support contains 35 out of 164 places after structural reductions.
[2024-05-24 12:34:34] [INFO ] Flatten gal took : 33 ms
[2024-05-24 12:34:35] [INFO ] Flatten gal took : 15 ms
[2024-05-24 12:34:35] [INFO ] Input system was already deterministic with 168 transitions.
Support contains 34 out of 164 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 125 resets, run finished after 455 ms. (steps per millisecond=21 ) properties (out of 20) seen :17
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2024-05-24 12:34:35] [INFO ] Invariant cache hit.
[2024-05-24 12:34:35] [INFO ] After 341ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:34:35] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 4 ms returned sat
[2024-05-24 12:34:36] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:34:36] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-24 12:34:36] [INFO ] After 156ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 7 ms.
Computed a total of 33 stabilizing places and 33 stable transitions
Graph (complete) has 249 edges and 164 vertex of which 152 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&F(p2))))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Graph (trivial) has 134 edges and 164 vertex of which 6 / 164 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 243 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 146 transition count 87
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 74 rules applied. Total rules applied 147 place count 75 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 148 place count 74 transition count 84
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 148 place count 74 transition count 64
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 188 place count 54 transition count 64
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 195 place count 47 transition count 57
Iterating global reduction 3 with 7 rules applied. Total rules applied 202 place count 47 transition count 57
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 248 place count 24 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 249 place count 24 transition count 33
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 255 place count 18 transition count 22
Iterating global reduction 4 with 6 rules applied. Total rules applied 261 place count 18 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 4 with 4 rules applied. Total rules applied 265 place count 16 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 266 place count 15 transition count 20
Applied a total of 266 rules in 34 ms. Remains 15 /164 variables (removed 149) and now considering 20/168 (removed 148) transitions.
[2024-05-24 12:34:36] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
// Phase 1: matrix 19 rows 15 cols
[2024-05-24 12:34:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:34:36] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 12:34:36] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 12:34:36] [INFO ] Invariant cache hit.
[2024-05-24 12:34:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:34:36] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-24 12:34:36] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-24 12:34:36] [INFO ] Flow matrix only has 19 transitions (discarded 1 similar events)
[2024-05-24 12:34:36] [INFO ] Invariant cache hit.
[2024-05-24 12:34:36] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/164 places, 20/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 15/164 places, 20/168 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 332 ms :[true, (OR (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=4, aps=[p1:(OR (AND (EQ s3 0) (EQ s8 1)) (AND (EQ s6 0) (EQ s11 1))), p2:(AND (EQ s3 0) (EQ s8 1)), p0:(OR (EQ s11 0) (EQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-00 finished in 537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Graph (trivial) has 139 edges and 164 vertex of which 6 / 164 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 243 edges and 159 vertex of which 147 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 146 transition count 83
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 78 rules applied. Total rules applied 155 place count 71 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 156 place count 70 transition count 80
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 156 place count 70 transition count 60
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 196 place count 50 transition count 60
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 204 place count 42 transition count 52
Iterating global reduction 3 with 8 rules applied. Total rules applied 212 place count 42 transition count 52
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 258 place count 19 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 259 place count 19 transition count 28
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 267 place count 11 transition count 13
Iterating global reduction 4 with 8 rules applied. Total rules applied 275 place count 11 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 277 place count 10 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 278 place count 9 transition count 11
Applied a total of 278 rules in 22 ms. Remains 9 /164 variables (removed 155) and now considering 11/168 (removed 157) transitions.
// Phase 1: matrix 11 rows 9 cols
[2024-05-24 12:34:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-24 12:34:36] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-24 12:34:36] [INFO ] Invariant cache hit.
[2024-05-24 12:34:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:34:36] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 12:34:36] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-24 12:34:36] [INFO ] Invariant cache hit.
[2024-05-24 12:34:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/164 places, 11/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 9/164 places, 11/168 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-03 finished in 166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Graph (trivial) has 133 edges and 164 vertex of which 6 / 164 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 158 transition count 90
Reduce places removed 71 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 87 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 145 place count 86 transition count 89
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 145 place count 86 transition count 70
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 183 place count 67 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 185 place count 65 transition count 68
Iterating global reduction 3 with 2 rules applied. Total rules applied 187 place count 65 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 188 place count 65 transition count 67
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 188 place count 65 transition count 66
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 190 place count 64 transition count 66
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 236 place count 41 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 41 transition count 42
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 238 place count 40 transition count 41
Iterating global reduction 5 with 1 rules applied. Total rules applied 239 place count 40 transition count 41
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 245 place count 37 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 246 place count 36 transition count 45
Applied a total of 246 rules in 22 ms. Remains 36 /164 variables (removed 128) and now considering 45/168 (removed 123) transitions.
[2024-05-24 12:34:37] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
// Phase 1: matrix 39 rows 36 cols
[2024-05-24 12:34:37] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:34:37] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-24 12:34:37] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-24 12:34:37] [INFO ] Invariant cache hit.
[2024-05-24 12:34:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-24 12:34:37] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-24 12:34:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:34:37] [INFO ] Flow matrix only has 39 transitions (discarded 6 similar events)
[2024-05-24 12:34:37] [INFO ] Invariant cache hit.
[2024-05-24 12:34:37] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 36/164 places, 45/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 142 ms. Remains : 36/164 places, 45/168 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s21 1) (EQ s26 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 225 steps with 15 reset in 2 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-04 finished in 229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(F(p0)&&G((p1&&X(p1))))))'
Support contains 3 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 155 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 155 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 155 transition count 158
Applied a total of 19 rules in 7 ms. Remains 155 /164 variables (removed 9) and now considering 158/168 (removed 10) transitions.
// Phase 1: matrix 158 rows 155 cols
[2024-05-24 12:34:37] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 12:34:37] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-24 12:34:37] [INFO ] Invariant cache hit.
[2024-05-24 12:34:37] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-24 12:34:37] [INFO ] Invariant cache hit.
[2024-05-24 12:34:37] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 155/164 places, 158/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 155/164 places, 158/168 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s104 0) (EQ s11 1)), p1:(EQ s148 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 268 ms.
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 239 edges and 155 vertex of which 143 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 17 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-05 finished in 960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p1))||p0)))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 153 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 153 transition count 155
Applied a total of 24 rules in 7 ms. Remains 153 /164 variables (removed 11) and now considering 155/168 (removed 13) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-24 12:34:38] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:34:38] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-24 12:34:38] [INFO ] Invariant cache hit.
[2024-05-24 12:34:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-05-24 12:34:38] [INFO ] Invariant cache hit.
[2024-05-24 12:34:38] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 155/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 153/164 places, 155/168 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s84 0) (AND (EQ s60 0) (EQ s68 1))), p1:(OR (AND (EQ s60 0) (EQ s68 1)) (AND (EQ s18 0) (EQ s75 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 31 steps with 0 reset in 1 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-06 finished in 382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)||F(p1)))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 158 transition count 162
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 158 transition count 162
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 156 transition count 160
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 156 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 156 transition count 159
Applied a total of 17 rules in 4 ms. Remains 156 /164 variables (removed 8) and now considering 159/168 (removed 9) transitions.
// Phase 1: matrix 159 rows 156 cols
[2024-05-24 12:34:38] [INFO ] Computed 9 invariants in 2 ms
[2024-05-24 12:34:38] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-24 12:34:38] [INFO ] Invariant cache hit.
[2024-05-24 12:34:38] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-24 12:34:38] [INFO ] Invariant cache hit.
[2024-05-24 12:34:38] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 156/164 places, 159/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 156/164 places, 159/168 transitions.
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s55 0) (EQ s13 1)), p0:(OR (EQ s102 0) (EQ s17 1) (EQ s144 0) (EQ s55 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 140 ms.
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 240 edges and 156 vertex of which 144 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-08 finished in 770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(p0) U (F(p2)||p1)) U p0)))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 155 transition count 159
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 155 transition count 159
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 152 transition count 156
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 152 transition count 156
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 26 place count 152 transition count 154
Applied a total of 26 rules in 4 ms. Remains 152 /164 variables (removed 12) and now considering 154/168 (removed 14) transitions.
// Phase 1: matrix 154 rows 152 cols
[2024-05-24 12:34:39] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 12:34:39] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 12:34:39] [INFO ] Invariant cache hit.
[2024-05-24 12:34:39] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2024-05-24 12:34:39] [INFO ] Invariant cache hit.
[2024-05-24 12:34:39] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 152/164 places, 154/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 152/164 places, 154/168 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s45 0) (EQ s74 1)), p1:(OR (EQ s139 0) (EQ s24 1)), p2:(EQ s16 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Computed a total of 27 stabilizing places and 27 stable transitions
Graph (complete) has 235 edges and 152 vertex of which 140 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 27 stabilizing places and 27 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 19 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-10 finished in 795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((F(p1) U X(p2))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 153 transition count 157
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 153 transition count 157
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 153 transition count 155
Applied a total of 24 rules in 10 ms. Remains 153 /164 variables (removed 11) and now considering 155/168 (removed 13) transitions.
// Phase 1: matrix 155 rows 153 cols
[2024-05-24 12:34:40] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:34:40] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-24 12:34:40] [INFO ] Invariant cache hit.
[2024-05-24 12:34:40] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-24 12:34:40] [INFO ] Invariant cache hit.
[2024-05-24 12:34:40] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/164 places, 155/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 153/164 places, 155/168 transitions.
Stuttering acceptance computed with spot in 432 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 5}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={} source=8 dest: 2}, { cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(AND p0 (NOT p1) p2), acceptance={0} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=9 dest: 9}]], initial=1, aps=[p1:(OR (EQ s140 0) (EQ s58 1)), p2:(OR (EQ s43 0) (EQ s129 1)), p0:(NEQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33373 reset in 140 ms.
Product exploration explored 100000 steps with 33505 reset in 142 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 236 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 243 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 123 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :5
Running SMT prover for 1 properties.
[2024-05-24 12:34:42] [INFO ] Invariant cache hit.
[2024-05-24 12:34:42] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 12:34:42] [INFO ] [Nat]Absence check using 0 positive and 9 generalized place invariants in 2 ms returned sat
[2024-05-24 12:34:42] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 12:34:42] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 12:34:42] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 155/155 transitions.
Graph (trivial) has 123 edges and 153 vertex of which 6 / 153 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 148 transition count 85
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 85 transition count 84
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 129 place count 84 transition count 84
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 129 place count 84 transition count 63
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 171 place count 63 transition count 63
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 172 place count 62 transition count 62
Iterating global reduction 3 with 1 rules applied. Total rules applied 173 place count 62 transition count 62
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 225 place count 36 transition count 36
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 36 transition count 35
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 35 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 230 place count 34 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 33 transition count 39
Applied a total of 231 rules in 27 ms. Remains 33 /153 variables (removed 120) and now considering 39/155 (removed 116) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 33/153 places, 39/155 transitions.
Finished random walk after 94 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) p2))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (NOT p2)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 23 factoid took 905 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 376 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 411 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 155/155 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2024-05-24 12:34:43] [INFO ] Invariant cache hit.
[2024-05-24 12:34:43] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-24 12:34:43] [INFO ] Invariant cache hit.
[2024-05-24 12:34:44] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2024-05-24 12:34:44] [INFO ] Invariant cache hit.
[2024-05-24 12:34:44] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 153/153 places, 155/155 transitions.
Computed a total of 28 stabilizing places and 28 stable transitions
Graph (complete) has 236 edges and 153 vertex of which 141 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.2 ms
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 23 factoid took 241 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 410 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Incomplete random walk after 10000 steps, including 125 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :4
Finished Best-First random walk after 784 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=261 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) p0))), (X p0), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), true, (X (X p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p2) p0)), (F (AND (NOT p2) (NOT p0))), (F (NOT p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 (NOT p1))), (F (NOT p0)), (F (NOT p2)), (F (AND p2 (NOT p0) (NOT p1))), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 23 factoid took 1249 ms. Reduced automaton from 10 states, 25 edges and 3 AP (stutter sensitive) to 10 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 413 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 368 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Stuttering acceptance computed with spot in 381 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Product exploration explored 100000 steps with 33364 reset in 152 ms.
Product exploration explored 100000 steps with 33382 reset in 144 ms.
Applying partial POR strategy [false, false, true, false, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 397 ms :[false, (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), false]
Support contains 5 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 155/155 transitions.
Graph (trivial) has 123 edges and 153 vertex of which 6 / 153 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.
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 148 transition count 149
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 65 place count 148 transition count 151
Deduced a syphon composed of 75 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 148 transition count 151
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 113 place count 111 transition count 114
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 150 place count 111 transition count 114
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 66 places in 0 ms
Iterating global reduction 1 with 28 rules applied. Total rules applied 178 place count 111 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 180 place count 111 transition count 112
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 201 place count 90 transition count 91
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 222 place count 90 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 223 place count 90 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 224 place count 89 transition count 90
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 225 place count 89 transition count 90
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 234 place count 89 transition count 121
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 243 place count 80 transition count 103
Deduced a syphon composed of 45 places in 0 ms
Iterating global reduction 2 with 9 rules applied. Total rules applied 252 place count 80 transition count 103
Deduced a syphon composed of 45 places in 0 ms
Applied a total of 252 rules in 44 ms. Remains 80 /153 variables (removed 73) and now considering 103/155 (removed 52) transitions.
[2024-05-24 12:34:48] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-24 12:34:48] [INFO ] Flow matrix only has 97 transitions (discarded 6 similar events)
// Phase 1: matrix 97 rows 80 cols
[2024-05-24 12:34:48] [INFO ] Computed 9 invariants in 1 ms
[2024-05-24 12:34:48] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/153 places, 103/155 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 106 ms. Remains : 80/153 places, 103/155 transitions.
Built C files in :
/tmp/ltsmin3846282277329766016
[2024-05-24 12:34:48] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3846282277329766016
Running compilation step : cd /tmp/ltsmin3846282277329766016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 317 ms.
Running link step : cd /tmp/ltsmin3846282277329766016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3846282277329766016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14261052079053644611.hoa' '--buchi-type=spotba'
LTSmin run took 571 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-11 finished in 9217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(!p1 U (p2||G(!p1))))))'
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 168/168 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 156 transition count 160
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 156 transition count 160
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 154 transition count 158
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 154 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 154 transition count 157
Applied a total of 21 rules in 12 ms. Remains 154 /164 variables (removed 10) and now considering 157/168 (removed 11) transitions.
// Phase 1: matrix 157 rows 154 cols
[2024-05-24 12:34:49] [INFO ] Computed 9 invariants in 3 ms
[2024-05-24 12:34:49] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-24 12:34:49] [INFO ] Invariant cache hit.
[2024-05-24 12:34:49] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2024-05-24 12:34:49] [INFO ] Invariant cache hit.
[2024-05-24 12:34:49] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 154/164 places, 157/168 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 154/164 places, 157/168 transitions.
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) p1), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2))), true, (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : GPUForwardProgress-PT-08b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p2:(AND (NOT (OR (EQ s17 0) (EQ s7 1) (EQ s61 1))) (NOT (OR (EQ s17 0) (EQ s7 1)))), p1:(OR (EQ s17 0) (EQ s7 1)), p0:(OR (AND (EQ s7 0) (EQ s17 1)) (EQ s...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-08b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-08b-LTLCardinality-15 finished in 437 ms.
All properties solved by simple procedures.
Total runtime 15746 ms.

BK_STOP 1716554093341

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-08b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is GPUForwardProgress-PT-08b, 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 r197-tall-171640625300307"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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