Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r292-tall-162124156000109.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GPUForwardProgress-PT-04b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r292-tall-162124156000109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 13K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.4K May 11 18:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 11 18:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 18K May 12 08:13 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-04b-00
FORMULA_NAME GPUForwardProgress-PT-04b-01
FORMULA_NAME GPUForwardProgress-PT-04b-02
FORMULA_NAME GPUForwardProgress-PT-04b-03
FORMULA_NAME GPUForwardProgress-PT-04b-04
FORMULA_NAME GPUForwardProgress-PT-04b-05
FORMULA_NAME GPUForwardProgress-PT-04b-06
FORMULA_NAME GPUForwardProgress-PT-04b-07
FORMULA_NAME GPUForwardProgress-PT-04b-08
FORMULA_NAME GPUForwardProgress-PT-04b-09
FORMULA_NAME GPUForwardProgress-PT-04b-10
FORMULA_NAME GPUForwardProgress-PT-04b-11
FORMULA_NAME GPUForwardProgress-PT-04b-12
FORMULA_NAME GPUForwardProgress-PT-04b-13
FORMULA_NAME GPUForwardProgress-PT-04b-14
FORMULA_NAME GPUForwardProgress-PT-04b-15

=== Now, execution of the tool begins

BK_START 1621268929040

Running Version 0
[2021-05-17 16:28:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 16:28:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 16:28:51] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2021-05-17 16:28:51] [INFO ] Transformed 112 places.
[2021-05-17 16:28:51] [INFO ] Transformed 117 transitions.
[2021-05-17 16:28:51] [INFO ] Found NUPN structural information;
[2021-05-17 16:28:51] [INFO ] Parsed PT model containing 112 places and 117 transitions in 94 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 16:28:51] [INFO ] Initial state test concluded for 4 properties.
FORMULA GPUForwardProgress-PT-04b-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 112 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 112/112 places, 117/117 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 111 transition count 117
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 13 place count 99 transition count 105
Iterating global reduction 1 with 12 rules applied. Total rules applied 25 place count 99 transition count 105
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 97 transition count 103
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 97 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 97 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 31 place count 96 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 32 place count 96 transition count 101
Applied a total of 32 rules in 33 ms. Remains 96 /112 variables (removed 16) and now considering 101/117 (removed 16) transitions.
// Phase 1: matrix 101 rows 96 cols
[2021-05-17 16:28:51] [INFO ] Computed 5 place invariants in 9 ms
[2021-05-17 16:28:51] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 101 rows 96 cols
[2021-05-17 16:28:51] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 16:28:51] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
// Phase 1: matrix 101 rows 96 cols
[2021-05-17 16:28:51] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 16:28:51] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 96/112 places, 101/117 transitions.
[2021-05-17 16:28:51] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 16:28:51] [INFO ] Flatten gal took : 31 ms
FORMULA GPUForwardProgress-PT-04b-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-04b-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 16:28:51] [INFO ] Flatten gal took : 11 ms
[2021-05-17 16:28:51] [INFO ] Input system was already deterministic with 101 transitions.
Incomplete random walk after 100000 steps, including 2154 resets, run finished after 271 ms. (steps per millisecond=369 ) properties (out of 26) seen :25
Running SMT prover for 1 properties.
// Phase 1: matrix 101 rows 96 cols
[2021-05-17 16:28:52] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 16:28:52] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 2 ms returned sat
[2021-05-17 16:28:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 16:28:52] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2021-05-17 16:28:52] [INFO ] Computed and/alt/rep : 100/156/100 causal constraints (skipped 0 transitions) in 12 ms.
[2021-05-17 16:28:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 16:28:52] [INFO ] [Nat]Absence check using 0 positive and 5 generalized place invariants in 3 ms returned sat
[2021-05-17 16:28:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 16:28:52] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2021-05-17 16:28:52] [INFO ] Computed and/alt/rep : 100/156/100 causal constraints (skipped 0 transitions) in 10 ms.
[2021-05-17 16:28:52] [INFO ] Added : 91 causal constraints over 19 iterations in 244 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X(p0)||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 91 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 91 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 91 transition count 93
Applied a total of 13 rules in 12 ms. Remains 91 /96 variables (removed 5) and now considering 93/101 (removed 8) transitions.
// Phase 1: matrix 93 rows 91 cols
[2021-05-17 16:28:52] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 16:28:52] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 93 rows 91 cols
[2021-05-17 16:28:52] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-17 16:28:52] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 93 rows 91 cols
[2021-05-17 16:28:52] [INFO ] Computed 5 place invariants in 15 ms
[2021-05-17 16:28:52] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Finished structural reductions, in 1 iterations. Remains : 91/96 places, 93/101 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(NEQ s83 1), p0:(AND (NEQ s75 1) (NEQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 250 ms.
Product exploration explored 100000 steps with 33333 reset in 161 ms.
Graph (complete) has 138 edges and 91 vertex of which 83 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Knowledge obtained : [p1, p0]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Product exploration explored 100000 steps with 33333 reset in 126 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 91 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 91/91 places, 93/93 transitions.
Graph (trivial) has 71 edges and 91 vertex of which 6 / 91 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.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 86 transition count 87
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 36 place count 86 transition count 116
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 43 place count 86 transition count 116
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 63 place count 66 transition count 80
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 83 place count 66 transition count 80
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 38 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 99 place count 66 transition count 80
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 111 place count 54 transition count 68
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 123 place count 54 transition count 68
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 127 place count 54 transition count 88
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 131 place count 50 transition count 80
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 135 place count 50 transition count 80
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 135 rules in 30 ms. Remains 50 /91 variables (removed 41) and now considering 80/93 (removed 13) transitions.
[2021-05-17 16:28:54] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 16:28:54] [INFO ] Flow matrix only has 74 transitions (discarded 6 similar events)
// Phase 1: matrix 74 rows 50 cols
[2021-05-17 16:28:54] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:54] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/91 places, 80/93 transitions.
Product exploration explored 100000 steps with 33333 reset in 311 ms.
Product exploration explored 100000 steps with 33333 reset in 241 ms.
[2021-05-17 16:28:54] [INFO ] Flatten gal took : 7 ms
[2021-05-17 16:28:54] [INFO ] Flatten gal took : 6 ms
[2021-05-17 16:28:54] [INFO ] Time to serialize gal into /tmp/LTL11777365779320342288.gal : 74 ms
[2021-05-17 16:28:54] [INFO ] Time to serialize properties into /tmp/LTL2942056263161447528.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11777365779320342288.gal, -t, CGAL, -LTL, /tmp/LTL2942056263161447528.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11777365779320342288.gal -t CGAL -LTL /tmp/LTL2942056263161447528.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((X("((p91!=1)&&(p103!=1))"))||(G("(p101!=1)"))))))
Formula 0 simplified : !XF(X"((p91!=1)&&(p103!=1))" | G"(p101!=1)")
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t8, t12, t25, t26, t31, t40, t47, t57, t64, t73, t79, t86, t91, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/77/16/93
Computing Next relation with stutter on 146 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
69 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.703662,38956,1,0,168,98317,222,98,2561,101302,206
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-04b-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property GPUForwardProgress-PT-04b-00 finished in 2995 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 95 transition count 60
Reduce places removed 40 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 46 rules applied. Total rules applied 86 place count 55 transition count 54
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 92 place count 52 transition count 51
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 96 place count 49 transition count 50
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 96 place count 49 transition count 38
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 120 place count 37 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 121 place count 36 transition count 37
Iterating global reduction 4 with 1 rules applied. Total rules applied 122 place count 36 transition count 37
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 148 place count 23 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 23 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 150 place count 22 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 151 place count 22 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 5 with 4 rules applied. Total rules applied 155 place count 20 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 156 place count 19 transition count 22
Applied a total of 156 rules in 14 ms. Remains 19 /96 variables (removed 77) and now considering 22/101 (removed 79) transitions.
[2021-05-17 16:28:55] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 19 cols
[2021-05-17 16:28:55] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:28:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2021-05-17 16:28:55] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 19 cols
[2021-05-17 16:28:55] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 16:28:55] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-17 16:28:55] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 16:28:55] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 19 cols
[2021-05-17 16:28:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:55] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/96 places, 22/101 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-04b-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s9 1) (EQ s16 0)), p1:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-01 finished in 158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0)||X((p1||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 97
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 92 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 91 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 91 transition count 94
Applied a total of 12 rules in 6 ms. Remains 91 /96 variables (removed 5) and now considering 94/101 (removed 7) transitions.
// Phase 1: matrix 94 rows 91 cols
[2021-05-17 16:28:55] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:28:55] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 94 rows 91 cols
[2021-05-17 16:28:55] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:55] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 91 cols
[2021-05-17 16:28:55] [INFO ] Computed 5 place invariants in 8 ms
[2021-05-17 16:28:56] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 91/96 places, 94/101 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-04b-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p2:(NEQ s19 1), p1:(NEQ s89 1), p0:(EQ s36 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 4 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-02 finished in 414 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 90 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 88 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 88 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 88 transition count 90
Applied a total of 19 rules in 5 ms. Remains 88 /96 variables (removed 8) and now considering 90/101 (removed 11) transitions.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:28:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:56] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:28:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:56] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:28:56] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:56] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/96 places, 90/101 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : GPUForwardProgress-PT-04b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s72 1), p0:(OR (EQ s60 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7195 reset in 107 ms.
Product exploration explored 100000 steps with 7106 reset in 230 ms.
Graph (complete) has 135 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 7195 reset in 113 ms.
Product exploration explored 100000 steps with 7183 reset in 238 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p0), (AND (NOT p0) p1)]
Support contains 3 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 88/88 places, 90/90 transitions.
Graph (trivial) has 69 edges and 88 vertex of which 5 / 88 are part of one of the 1 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 84 transition count 86
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 33 place count 84 transition count 141
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 41 place count 84 transition count 141
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 57 place count 68 transition count 101
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 73 place count 68 transition count 101
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 88 place count 68 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 90 place count 68 transition count 99
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 102 place count 56 transition count 87
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 114 place count 56 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 56 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 116 place count 55 transition count 86
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 117 place count 55 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 121 place count 55 transition count 114
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 125 place count 51 transition count 106
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 51 transition count 106
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 129 rules in 18 ms. Remains 51 /88 variables (removed 37) and now considering 106/90 (removed -16) transitions.
[2021-05-17 16:28:57] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 16:28:57] [INFO ] Flow matrix only has 102 transitions (discarded 4 similar events)
// Phase 1: matrix 102 rows 51 cols
[2021-05-17 16:28:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/88 places, 106/90 transitions.
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-03 finished in 1426 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||X((G(p1)||((p2||(p3&&F(p4))) U ((p2||(p3&&F(p4)))&&p5)))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 92 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 92 transition count 97
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 92 transition count 96
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 90 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 90 transition count 94
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 14 place count 90 transition count 93
Applied a total of 14 rules in 3 ms. Remains 90 /96 variables (removed 6) and now considering 93/101 (removed 8) transitions.
// Phase 1: matrix 93 rows 90 cols
[2021-05-17 16:28:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:57] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 93 rows 90 cols
[2021-05-17 16:28:57] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:57] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 93 rows 90 cols
[2021-05-17 16:28:57] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:28:57] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/96 places, 93/101 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p5))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p4) (NOT p5)))]
Running random walk in product with property : GPUForwardProgress-PT-04b-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p5)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p5)) (AND (NOT p0) p1 (NOT p2) (NOT p3))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p5 (NOT p2) p3 (NOT p4)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1) (NOT p5) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p1 (NOT p5) (NOT p4)) (AND (NOT p0) p1 (NOT p2) (NOT p4))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s67 1) (EQ s80 1)), p1:(EQ s13 1), p5:(AND (EQ s67 1) (EQ s80 1)), p2:(EQ s84 1), p3:(EQ s59 1), p4:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-04 finished in 305 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 91 transition count 96
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 91 transition count 96
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 91 transition count 95
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 90 transition count 94
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 90 transition count 94
Applied a total of 13 rules in 4 ms. Remains 90 /96 variables (removed 6) and now considering 94/101 (removed 7) transitions.
// Phase 1: matrix 94 rows 90 cols
[2021-05-17 16:28:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:58] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 94 rows 90 cols
[2021-05-17 16:28:58] [INFO ] Computed 5 place invariants in 2 ms
[2021-05-17 16:28:58] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 90 cols
[2021-05-17 16:28:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:58] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/96 places, 94/101 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s37 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 41 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-05 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((p1||X((X(p2) U (F(p1) U p0)))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 90 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 88 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 88 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 88 transition count 90
Applied a total of 19 rules in 3 ms. Remains 88 /96 variables (removed 8) and now considering 90/101 (removed 11) transitions.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:28:58] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:28:58] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:28:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:58] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:28:58] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:28:58] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/96 places, 90/101 transitions.
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p2)]
Running random walk in product with property : GPUForwardProgress-PT-04b-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 9}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}], [{ cond=(NOT p1), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s85 1), p1:(EQ s20 1), p2:(EQ s85 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], 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 22201 reset in 96 ms.
Product exploration explored 100000 steps with 22239 reset in 101 ms.
Graph (complete) has 135 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), (NOT p1), p2]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 22277 reset in 85 ms.
Product exploration explored 100000 steps with 22246 reset in 95 ms.
Applying partial POR strategy [false, false, false, false, true, true, false, false, true, true]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) p2)]
Support contains 2 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 88/88 places, 90/90 transitions.
Graph (trivial) has 73 edges and 88 vertex of which 6 / 88 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.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 83 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 36 place count 83 transition count 168
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 83 transition count 168
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 64 place count 63 transition count 100
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 84 place count 63 transition count 100
Performed 14 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 98 place count 63 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 99 place count 63 transition count 99
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 110 place count 52 transition count 88
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 121 place count 52 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 125 place count 52 transition count 124
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 129 place count 48 transition count 116
Deduced a syphon composed of 26 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 48 transition count 116
Deduced a syphon composed of 26 places in 1 ms
Applied a total of 133 rules in 16 ms. Remains 48 /88 variables (removed 40) and now considering 116/90 (removed -26) transitions.
[2021-05-17 16:28:59] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 16:28:59] [INFO ] Flow matrix only has 104 transitions (discarded 12 similar events)
// Phase 1: matrix 104 rows 48 cols
[2021-05-17 16:28:59] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:29:00] [INFO ] Dead Transitions using invariants and state equation in 243 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/88 places, 116/90 transitions.
Product exploration explored 100000 steps with 22230 reset in 195 ms.
Product exploration explored 100000 steps with 22208 reset in 188 ms.
[2021-05-17 16:29:00] [INFO ] Flatten gal took : 5 ms
[2021-05-17 16:29:00] [INFO ] Flatten gal took : 5 ms
[2021-05-17 16:29:00] [INFO ] Time to serialize gal into /tmp/LTL18131731109770919964.gal : 1 ms
[2021-05-17 16:29:00] [INFO ] Time to serialize properties into /tmp/LTL3991969959118117674.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18131731109770919964.gal, -t, CGAL, -LTL, /tmp/LTL3991969959118117674.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18131731109770919964.gal -t CGAL -LTL /tmp/LTL3991969959118117674.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("(p107==1)")U(X(("(p23==1)")||(X((X("(p107==0)"))U((F("(p23==1)"))U("(p107==1)"))))))))
Formula 0 simplified : !("(p107==1)" U X("(p23==1)" | X(X"(p107==0)" U (F"(p23==1)" U "(p107==1)"))))
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t7, t12, t25, t26, t31, t40, t47, t57, t64, t73, t79, t86, t91, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/74/16/90
Computing Next relation with stutter on 146 deadlock states
43 unique states visited
43 strongly connected components in search stack
43 transitions explored
43 items max in DFS search stack
138 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.39911,63096,1,0,409,207881,209,356,2469,231375,817
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-04b-06 finished in 3847 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(F(p0))||G((p1||(F(p1)&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Graph (trivial) has 77 edges and 96 vertex of which 6 / 96 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 90 transition count 58
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 39 rules applied. Total rules applied 76 place count 54 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 77 place count 53 transition count 55
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 77 place count 53 transition count 44
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 99 place count 42 transition count 44
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 41 transition count 43
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 41 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 41 transition count 42
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 103 place count 40 transition count 41
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 40 transition count 41
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 128 place count 28 transition count 29
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 134 place count 25 transition count 30
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 25 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 24 transition count 29
Applied a total of 137 rules in 8 ms. Remains 24 /96 variables (removed 72) and now considering 29/101 (removed 72) transitions.
[2021-05-17 16:29:02] [INFO ] Flow matrix only has 28 transitions (discarded 1 similar events)
// Phase 1: matrix 28 rows 24 cols
[2021-05-17 16:29:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:02] [INFO ] Implicit Places using invariants in 32 ms returned []
[2021-05-17 16:29:02] [INFO ] Flow matrix only has 28 transitions (discarded 1 similar events)
// Phase 1: matrix 28 rows 24 cols
[2021-05-17 16:29:02] [INFO ] Computed 5 place invariants in 4 ms
[2021-05-17 16:29:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 16:29:02] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2021-05-17 16:29:02] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 16:29:02] [INFO ] Flow matrix only has 28 transitions (discarded 1 similar events)
// Phase 1: matrix 28 rows 24 cols
[2021-05-17 16:29:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:02] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/96 places, 29/101 transitions.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-04b-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s3 1) (EQ s20 1) (EQ s23 1)), p1:(EQ s11 1), p2:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 2 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-07 finished in 238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 90 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 88 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 88 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 88 transition count 90
Applied a total of 19 rules in 4 ms. Remains 88 /96 variables (removed 8) and now considering 90/101 (removed 11) transitions.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:02] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:02] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:02] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:29:02] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/96 places, 90/101 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-04b-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s82 1), p1:(EQ s82 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24999 reset in 94 ms.
Product exploration explored 100000 steps with 25038 reset in 86 ms.
Graph (complete) has 135 edges and 88 vertex of which 80 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25048 reset in 80 ms.
Product exploration explored 100000 steps with 25078 reset in 90 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 88 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 88/88 places, 90/90 transitions.
Graph (trivial) has 74 edges and 88 vertex of which 6 / 88 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.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 83 transition count 84
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 36 place count 83 transition count 168
Deduced a syphon composed of 43 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 44 place count 83 transition count 168
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 64 place count 63 transition count 100
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 84 place count 63 transition count 100
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 39 places in 0 ms
Iterating global reduction 1 with 16 rules applied. Total rules applied 100 place count 63 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 102 place count 63 transition count 99
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 114 place count 51 transition count 87
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 126 place count 51 transition count 87
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 127 place count 51 transition count 87
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 128 place count 50 transition count 86
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 50 transition count 86
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 133 place count 50 transition count 122
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 137 place count 46 transition count 114
Deduced a syphon composed of 27 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 46 transition count 114
Deduced a syphon composed of 27 places in 0 ms
Applied a total of 141 rules in 17 ms. Remains 46 /88 variables (removed 42) and now considering 114/90 (removed -24) transitions.
[2021-05-17 16:29:03] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 16:29:03] [INFO ] Flow matrix only has 102 transitions (discarded 12 similar events)
// Phase 1: matrix 102 rows 46 cols
[2021-05-17 16:29:03] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:29:03] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 46/88 places, 114/90 transitions.
Product exploration explored 100000 steps with 24986 reset in 173 ms.
Product exploration explored 100000 steps with 24915 reset in 184 ms.
[2021-05-17 16:29:03] [INFO ] Flatten gal took : 13 ms
[2021-05-17 16:29:03] [INFO ] Flatten gal took : 9 ms
[2021-05-17 16:29:03] [INFO ] Time to serialize gal into /tmp/LTL11616646998307867315.gal : 9 ms
[2021-05-17 16:29:03] [INFO ] Time to serialize properties into /tmp/LTL4266222453679413970.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11616646998307867315.gal, -t, CGAL, -LTL, /tmp/LTL4266222453679413970.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11616646998307867315.gal -t CGAL -LTL /tmp/LTL4266222453679413970.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p102==1)")U(X("(p102==0)"))))))
Formula 0 simplified : !XG("(p102==1)" U X"(p102==0)")
Reverse transition relation is NOT exact ! Due to transitions t2, t5, t6, t7, t12, t25, t26, t31, t40, t47, t57, t64, t73, t79, t86, t91, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/74/16/90
Computing Next relation with stutter on 146 deadlock states
43 unique states visited
43 strongly connected components in search stack
44 transitions explored
43 items max in DFS search stack
176 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.78259,71460,1,0,331,236532,209,322,2617,286037,741
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-04b-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-04b-08 finished in 3483 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||(p0&&G(F(!p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Graph (trivial) has 84 edges and 96 vertex of which 6 / 96 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.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 90 transition count 55
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 44 rules applied. Total rules applied 84 place count 51 transition count 50
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 87 place count 49 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 88 place count 48 transition count 49
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 88 place count 48 transition count 38
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 110 place count 37 transition count 38
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 138 place count 23 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 139 place count 23 transition count 23
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 140 place count 22 transition count 22
Iterating global reduction 5 with 1 rules applied. Total rules applied 141 place count 22 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 5 with 4 rules applied. Total rules applied 145 place count 20 transition count 23
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 19 transition count 22
Applied a total of 146 rules in 9 ms. Remains 19 /96 variables (removed 77) and now considering 22/101 (removed 79) transitions.
[2021-05-17 16:29:05] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 19 cols
[2021-05-17 16:29:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:29:05] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-17 16:29:05] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 19 cols
[2021-05-17 16:29:05] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 16:29:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 16:29:05] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2021-05-17 16:29:05] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 16:29:05] [INFO ] Flow matrix only has 20 transitions (discarded 2 similar events)
// Phase 1: matrix 20 rows 19 cols
[2021-05-17 16:29:05] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:05] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/96 places, 22/101 transitions.
[2021-05-17 16:29:05] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), true, false, p0, p0]
Running random walk in product with property : GPUForwardProgress-PT-04b-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-10 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 90 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 88 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 88 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 88 transition count 90
Applied a total of 19 rules in 2 ms. Remains 88 /96 variables (removed 8) and now considering 90/101 (removed 11) transitions.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:05] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:05] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:05] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:06] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/96 places, 90/101 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, p0, p0]
Running random walk in product with property : GPUForwardProgress-PT-04b-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-04b-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-11 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 96 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 96/96 places, 101/101 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 90 transition count 95
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 90 transition count 95
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 90 transition count 93
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 88 transition count 91
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 88 transition count 91
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 88 transition count 90
Applied a total of 19 rules in 2 ms. Remains 88 /96 variables (removed 8) and now considering 90/101 (removed 11) transitions.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:06] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:06] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 90 rows 88 cols
[2021-05-17 16:29:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 16:29:06] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 88/96 places, 90/101 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-04b-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(NEQ s43 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 233 steps with 4 reset in 1 ms.
FORMULA GPUForwardProgress-PT-04b-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-04b-12 finished in 173 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621268947438

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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-04b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-04b, 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 r292-tall-162124156000109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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