Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r197-smll-167840343700044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is GPUForwardProgress-PT-12b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840343700044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.3K Feb 25 14:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 14:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 14:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 14:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 14:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 25 14:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 65K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-00
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-01
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-02
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-03
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-04
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-05
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-06
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-07
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-08
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-09
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-10
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-11
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-12
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-13
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-14
FORMULA_NAME GPUForwardProgress-PT-12b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678466857373

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-12b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-10 16:47:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-10 16:47:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 16:47:41] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2023-03-10 16:47:41] [INFO ] Transformed 264 places.
[2023-03-10 16:47:41] [INFO ] Transformed 277 transitions.
[2023-03-10 16:47:41] [INFO ] Found NUPN structural information;
[2023-03-10 16:47:41] [INFO ] Parsed PT model containing 264 places and 277 transitions and 677 arcs in 316 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-12b-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 264 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 264/264 places, 277/277 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 263 transition count 277
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 238 transition count 252
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 238 transition count 252
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 229 transition count 243
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 229 transition count 243
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 76 place count 229 transition count 236
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 228 transition count 235
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 228 transition count 235
Applied a total of 78 rules in 213 ms. Remains 228 /264 variables (removed 36) and now considering 235/277 (removed 42) transitions.
// Phase 1: matrix 235 rows 228 cols
[2023-03-10 16:47:42] [INFO ] Computed 13 place invariants in 26 ms
[2023-03-10 16:47:43] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-10 16:47:43] [INFO ] Invariant cache hit.
[2023-03-10 16:47:43] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
[2023-03-10 16:47:43] [INFO ] Invariant cache hit.
[2023-03-10 16:47:43] [INFO ] Dead Transitions using invariants and state equation in 387 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 228/264 places, 235/277 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1642 ms. Remains : 228/264 places, 235/277 transitions.
Support contains 21 out of 228 places after structural reductions.
[2023-03-10 16:47:44] [INFO ] Flatten gal took : 99 ms
[2023-03-10 16:47:44] [INFO ] Flatten gal took : 38 ms
[2023-03-10 16:47:44] [INFO ] Input system was already deterministic with 235 transitions.
Support contains 20 out of 228 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 853 ms. (steps per millisecond=11 ) properties (out of 20) seen :16
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-10 16:47:45] [INFO ] Invariant cache hit.
[2023-03-10 16:47:45] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-10 16:47:45] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 8 ms returned sat
[2023-03-10 16:47:46] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-10 16:47:46] [INFO ] After 420ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 110 ms.
[2023-03-10 16:47:46] [INFO ] After 664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 23 ms.
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 193 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 14 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 344 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 108 rules applied. Total rules applied 110 place count 206 transition count 116
Reduce places removed 106 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 113 rules applied. Total rules applied 223 place count 100 transition count 109
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 226 place count 98 transition count 108
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 227 place count 97 transition count 108
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 227 place count 97 transition count 81
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 281 place count 70 transition count 81
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 294 place count 57 transition count 68
Iterating global reduction 4 with 13 rules applied. Total rules applied 307 place count 57 transition count 68
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 307 place count 57 transition count 67
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 309 place count 56 transition count 67
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 383 place count 19 transition count 30
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 48 edges and 19 vertex of which 18 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 2 rules applied. Total rules applied 385 place count 18 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 386 place count 18 transition count 28
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 396 place count 8 transition count 8
Iterating global reduction 6 with 10 rules applied. Total rules applied 406 place count 8 transition count 8
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 409 place count 6 transition count 7
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 7 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 2 rules applied. Total rules applied 411 place count 5 transition count 6
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 412 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 413 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 414 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 414 place count 3 transition count 3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 416 place count 2 transition count 3
Applied a total of 416 rules in 66 ms. Remains 2 /228 variables (removed 226) and now considering 3/235 (removed 232) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 2/228 places, 3/235 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Computed a total of 40 stabilizing places and 40 stable transitions
Graph (complete) has 352 edges and 228 vertex of which 212 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.9 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||F(p1))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 221 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 218 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 218 transition count 223
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 24 place count 218 transition count 221
Applied a total of 24 rules in 28 ms. Remains 218 /228 variables (removed 10) and now considering 221/235 (removed 14) transitions.
// Phase 1: matrix 221 rows 218 cols
[2023-03-10 16:47:46] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-10 16:47:47] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-10 16:47:47] [INFO ] Invariant cache hit.
[2023-03-10 16:47:47] [INFO ] Implicit Places using invariants and state equation in 339 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2023-03-10 16:47:47] [INFO ] Invariant cache hit.
[2023-03-10 16:47:47] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/228 places, 221/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 786 ms. Remains : 218/228 places, 221/235 transitions.
Stuttering acceptance computed with spot in 302 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s104 0), p0:(OR (EQ s109 1) (EQ s205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 889 reset in 337 ms.
Product exploration explored 100000 steps with 891 reset in 409 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 338 edges and 218 vertex of which 202 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.10 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 4487 steps, including 37 resets, run visited all 2 properties in 176 ms. (steps per millisecond=25 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 221/221 transitions.
Applied a total of 0 rules in 8 ms. Remains 218 /218 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2023-03-10 16:47:50] [INFO ] Invariant cache hit.
[2023-03-10 16:47:50] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-10 16:47:50] [INFO ] Invariant cache hit.
[2023-03-10 16:47:50] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 538 ms to find 0 implicit places.
[2023-03-10 16:47:50] [INFO ] Invariant cache hit.
[2023-03-10 16:47:50] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 218/218 places, 221/221 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 338 edges and 218 vertex of which 202 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 5400 steps, including 49 resets, run visited all 2 properties in 121 ms. (steps per millisecond=44 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 902 reset in 183 ms.
Product exploration explored 100000 steps with 900 reset in 432 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 218/218 places, 221/221 transitions.
Graph (trivial) has 176 edges and 218 vertex of which 6 / 218 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 332 edges and 213 vertex of which 197 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 97 rules applied. Total rules applied 99 place count 197 transition count 212
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 99 place count 197 transition count 214
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 113 place count 197 transition count 214
Discarding 71 places :
Symmetric choice reduction at 1 with 71 rule applications. Total rules 184 place count 126 transition count 143
Deduced a syphon composed of 51 places in 1 ms
Iterating global reduction 1 with 71 rules applied. Total rules applied 255 place count 126 transition count 143
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 265 place count 116 transition count 133
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 275 place count 116 transition count 133
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 81 places in 0 ms
Iterating global reduction 1 with 40 rules applied. Total rules applied 315 place count 116 transition count 134
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 317 place count 116 transition count 132
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 346 place count 87 transition count 102
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 29 rules applied. Total rules applied 375 place count 87 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 87 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 377 place count 86 transition count 101
Deduced a syphon composed of 52 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 86 transition count 101
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 12 rules applied. Total rules applied 390 place count 86 transition count 136
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 411 place count 65 transition count 94
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 432 place count 65 transition count 94
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 462 place count 35 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 492 place count 35 transition count 44
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 492 rules in 55 ms. Remains 35 /218 variables (removed 183) and now considering 44/221 (removed 177) transitions.
[2023-03-10 16:47:52] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 44 rows 35 cols
[2023-03-10 16:47:52] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:47:52] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/218 places, 44/221 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 137 ms. Remains : 35/218 places, 44/221 transitions.
Built C files in :
/tmp/ltsmin1604369688515123625
[2023-03-10 16:47:52] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1604369688515123625
Running compilation step : cd /tmp/ltsmin1604369688515123625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 769 ms.
Running link step : cd /tmp/ltsmin1604369688515123625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1604369688515123625;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8572223591409789452.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 218 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 218/218 places, 221/221 transitions.
Applied a total of 0 rules in 4 ms. Remains 218 /218 variables (removed 0) and now considering 221/221 (removed 0) transitions.
// Phase 1: matrix 221 rows 218 cols
[2023-03-10 16:48:08] [INFO ] Computed 13 place invariants in 11 ms
[2023-03-10 16:48:08] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-10 16:48:08] [INFO ] Invariant cache hit.
[2023-03-10 16:48:08] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
[2023-03-10 16:48:08] [INFO ] Invariant cache hit.
[2023-03-10 16:48:08] [INFO ] Dead Transitions using invariants and state equation in 205 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 218/218 places, 221/221 transitions.
Built C files in :
/tmp/ltsmin12385558492065703943
[2023-03-10 16:48:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12385558492065703943
Running compilation step : cd /tmp/ltsmin12385558492065703943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 728 ms.
Running link step : cd /tmp/ltsmin12385558492065703943;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12385558492065703943;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7983772026943218694.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 16:48:23] [INFO ] Flatten gal took : 20 ms
[2023-03-10 16:48:23] [INFO ] Flatten gal took : 18 ms
[2023-03-10 16:48:23] [INFO ] Time to serialize gal into /tmp/LTL13594837982129992091.gal : 6 ms
[2023-03-10 16:48:23] [INFO ] Time to serialize properties into /tmp/LTL14001542313599546696.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13594837982129992091.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5374397806382267107.hoa' '-atoms' '/tmp/LTL14001542313599546696.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14001542313599546696.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5374397806382267107.hoa
Detected timeout of ITS tools.
[2023-03-10 16:48:38] [INFO ] Flatten gal took : 13 ms
[2023-03-10 16:48:38] [INFO ] Flatten gal took : 13 ms
[2023-03-10 16:48:38] [INFO ] Time to serialize gal into /tmp/LTL16132127104360672259.gal : 8 ms
[2023-03-10 16:48:38] [INFO ] Time to serialize properties into /tmp/LTL15607610277539729246.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16132127104360672259.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15607610277539729246.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((X("((p127==1)||(p245==1))"))||(F("(p122==0)")))))
Formula 0 simplified : F(X!"((p127==1)||(p245==1))" & G!"(p122==0)")
Detected timeout of ITS tools.
[2023-03-10 16:48:54] [INFO ] Flatten gal took : 13 ms
[2023-03-10 16:48:54] [INFO ] Applying decomposition
[2023-03-10 16:48:54] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9124581914127041480.txt' '-o' '/tmp/graph9124581914127041480.bin' '-w' '/tmp/graph9124581914127041480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9124581914127041480.bin' '-l' '-1' '-v' '-w' '/tmp/graph9124581914127041480.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:48:54] [INFO ] Decomposing Gal with order
[2023-03-10 16:48:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:48:54] [INFO ] Removed a total of 63 redundant transitions.
[2023-03-10 16:48:54] [INFO ] Flatten gal took : 76 ms
[2023-03-10 16:48:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2023-03-10 16:48:54] [INFO ] Time to serialize gal into /tmp/LTL3757268974829774068.gal : 8 ms
[2023-03-10 16:48:54] [INFO ] Time to serialize properties into /tmp/LTL6405264084092924102.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3757268974829774068.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6405264084092924102.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((X("((i7.i0.u48.p127==1)||(i13.u90.p245==1))"))||(F("(i7.i0.u47.p122==0)")))))
Formula 0 simplified : F(X!"((i7.i0.u48.p127==1)||(i13.u90.p245==1))" & G!"(i7.i0.u47.p122==0)")
Reverse transition relation is NOT exact ! Due to transitions t209, i1.t204, i1.i2.t197, i2.t191, i2.i1.u17.t182, i3.t175, i3.i2.t168, i4.t161, i4.i2.t154,...511
Computing Next relation with stutter on 1.05879e+06 deadlock states
107 unique states visited
107 strongly connected components in search stack
108 transitions explored
107 items max in DFS search stack
130 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.34195,45096,1,0,70791,335,2672,105567,156,1052,99004
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-02 finished in 68974 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(p2)))))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 220 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 220 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 220 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 216 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 216 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 216 transition count 218
Applied a total of 29 rules in 10 ms. Remains 216 /228 variables (removed 12) and now considering 218/235 (removed 17) transitions.
// Phase 1: matrix 218 rows 216 cols
[2023-03-10 16:48:55] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:48:55] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-10 16:48:55] [INFO ] Invariant cache hit.
[2023-03-10 16:48:56] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-10 16:48:56] [INFO ] Invariant cache hit.
[2023-03-10 16:48:56] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/228 places, 218/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 510 ms. Remains : 216/228 places, 218/235 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s25 0), p1:(EQ s50 1), p2:(EQ s50 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33112 reset in 275 ms.
Product exploration explored 100000 steps with 33285 reset in 256 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 493 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 86 resets, run finished after 349 ms. (steps per millisecond=28 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-10 16:48:58] [INFO ] Invariant cache hit.
[2023-03-10 16:48:58] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-10 16:48:58] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 11 ms returned sat
[2023-03-10 16:48:58] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X p2)), (X (X p0)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 10 factoid took 536 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 4 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-10 16:48:59] [INFO ] Invariant cache hit.
[2023-03-10 16:48:59] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-10 16:48:59] [INFO ] Invariant cache hit.
[2023-03-10 16:48:59] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
[2023-03-10 16:48:59] [INFO ] Invariant cache hit.
[2023-03-10 16:49:00] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 718 ms. Remains : 216/216 places, 218/218 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.4 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 393 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 912 steps, including 7 resets, run visited all 3 properties in 26 ms. (steps per millisecond=35 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), true, (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 6 factoid took 495 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33282 reset in 211 ms.
Product exploration explored 100000 steps with 33409 reset in 300 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Graph (trivial) has 174 edges and 216 vertex of which 6 / 216 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 329 edges and 211 vertex of which 195 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 95 rules applied. Total rules applied 97 place count 195 transition count 209
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 15 Pre rules applied. Total rules applied 97 place count 195 transition count 211
Deduced a syphon composed of 110 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 112 place count 195 transition count 211
Discarding 68 places :
Symmetric choice reduction at 1 with 68 rule applications. Total rules 180 place count 127 transition count 143
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 1 with 68 rules applied. Total rules applied 248 place count 127 transition count 143
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 259 place count 116 transition count 132
Deduced a syphon composed of 42 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 270 place count 116 transition count 132
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 311 place count 116 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 313 place count 116 transition count 131
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 343 place count 86 transition count 100
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 30 rules applied. Total rules applied 373 place count 86 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 374 place count 86 transition count 100
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 375 place count 85 transition count 99
Deduced a syphon composed of 53 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 376 place count 85 transition count 99
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -32
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 387 place count 85 transition count 131
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 407 place count 65 transition count 91
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 427 place count 65 transition count 91
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 454 place count 38 transition count 46
Deduced a syphon composed of 26 places in 1 ms
Iterating global reduction 2 with 27 rules applied. Total rules applied 481 place count 38 transition count 46
Deduced a syphon composed of 26 places in 0 ms
Applied a total of 481 rules in 90 ms. Remains 38 /216 variables (removed 178) and now considering 46/218 (removed 172) transitions.
[2023-03-10 16:49:03] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 46 rows 38 cols
[2023-03-10 16:49:03] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 16:49:03] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 38/216 places, 46/218 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 208 ms. Remains : 38/216 places, 46/218 transitions.
Built C files in :
/tmp/ltsmin4646660142348294421
[2023-03-10 16:49:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4646660142348294421
Running compilation step : cd /tmp/ltsmin4646660142348294421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 753 ms.
Running link step : cd /tmp/ltsmin4646660142348294421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin4646660142348294421;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased345389570047815998.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 15 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 216 cols
[2023-03-10 16:49:18] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:49:18] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-10 16:49:18] [INFO ] Invariant cache hit.
[2023-03-10 16:49:18] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-10 16:49:18] [INFO ] Invariant cache hit.
[2023-03-10 16:49:18] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 459 ms. Remains : 216/216 places, 218/218 transitions.
Built C files in :
/tmp/ltsmin13949597294216482129
[2023-03-10 16:49:18] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13949597294216482129
Running compilation step : cd /tmp/ltsmin13949597294216482129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 485 ms.
Running link step : cd /tmp/ltsmin13949597294216482129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin13949597294216482129;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14245540125462598996.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-10 16:49:33] [INFO ] Flatten gal took : 12 ms
[2023-03-10 16:49:33] [INFO ] Flatten gal took : 10 ms
[2023-03-10 16:49:33] [INFO ] Time to serialize gal into /tmp/LTL16619376874227913593.gal : 3 ms
[2023-03-10 16:49:33] [INFO ] Time to serialize properties into /tmp/LTL1461106557416297734.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16619376874227913593.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8853319851518184275.hoa' '-atoms' '/tmp/LTL1461106557416297734.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1461106557416297734.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8853319851518184275.hoa
Detected timeout of ITS tools.
[2023-03-10 16:49:48] [INFO ] Flatten gal took : 17 ms
[2023-03-10 16:49:48] [INFO ] Flatten gal took : 15 ms
[2023-03-10 16:49:48] [INFO ] Time to serialize gal into /tmp/LTL5571781481148078424.gal : 4 ms
[2023-03-10 16:49:48] [INFO ] Time to serialize properties into /tmp/LTL16335599872651730263.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5571781481148078424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16335599872651730263.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("(p27==0)"))&&(F(G(("(p56==1)")||(X("(p56==0)"))))))))
Formula 0 simplified : F(G!"(p27==0)" | GF(!"(p56==1)" & X!"(p56==0)"))
Detected timeout of ITS tools.
[2023-03-10 16:50:04] [INFO ] Flatten gal took : 8 ms
[2023-03-10 16:50:04] [INFO ] Applying decomposition
[2023-03-10 16:50:04] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1439740275840830992.txt' '-o' '/tmp/graph1439740275840830992.bin' '-w' '/tmp/graph1439740275840830992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1439740275840830992.bin' '-l' '-1' '-v' '-w' '/tmp/graph1439740275840830992.weights' '-q' '0' '-e' '0.001'
[2023-03-10 16:50:04] [INFO ] Decomposing Gal with order
[2023-03-10 16:50:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-10 16:50:04] [INFO ] Removed a total of 29 redundant transitions.
[2023-03-10 16:50:04] [INFO ] Flatten gal took : 25 ms
[2023-03-10 16:50:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-10 16:50:04] [INFO ] Time to serialize gal into /tmp/LTL15809259231638115333.gal : 6 ms
[2023-03-10 16:50:04] [INFO ] Time to serialize properties into /tmp/LTL5347276787116412783.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15809259231638115333.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5347276787116412783.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("(i1.i2.u11.p27==0)"))&&(F(G(("(i3.i0.u20.p56==1)")||(X("(i3.i0.u20.p56==0)"))))))))
Formula 0 simplified : F(G!"(i1.i2.u11.p27==0)" | GF(!"(i3.i0.u20.p56==1)" & X!"(i3.i0.u20.p56==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3310435916691020480
[2023-03-10 16:50:19] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3310435916691020480
Running compilation step : cd /tmp/ltsmin3310435916691020480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 459 ms.
Running link step : cd /tmp/ltsmin3310435916691020480;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin3310435916691020480;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))&&<>([](((LTLAPp1==true)||X((LTLAPp2==true)))))))' '--buchi-type=spotba'
LTSmin run took 536 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-03 finished in 84537 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(((p0&&X(p1))||G(p1)))))))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 220 transition count 227
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 220 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 220 transition count 225
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 22 place count 216 transition count 221
Iterating global reduction 1 with 4 rules applied. Total rules applied 26 place count 216 transition count 221
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 29 place count 216 transition count 218
Applied a total of 29 rules in 24 ms. Remains 216 /228 variables (removed 12) and now considering 218/235 (removed 17) transitions.
[2023-03-10 16:50:20] [INFO ] Invariant cache hit.
[2023-03-10 16:50:20] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-10 16:50:20] [INFO ] Invariant cache hit.
[2023-03-10 16:50:20] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-10 16:50:20] [INFO ] Invariant cache hit.
[2023-03-10 16:50:21] [INFO ] Dead Transitions using invariants and state equation in 264 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 216/228 places, 218/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 216/228 places, 218/235 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(NEQ s72 1), p1:(NEQ s156 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 191 ms.
Product exploration explored 100000 steps with 20000 reset in 168 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 5937 steps, including 53 resets, run visited all 4 properties in 26 ms. (steps per millisecond=228 )
Knowledge obtained : [(AND p0 p1), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 242 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 11 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-10 16:50:22] [INFO ] Invariant cache hit.
[2023-03-10 16:50:22] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-10 16:50:22] [INFO ] Invariant cache hit.
[2023-03-10 16:50:23] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2023-03-10 16:50:23] [INFO ] Invariant cache hit.
[2023-03-10 16:50:23] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 619 ms. Remains : 216/216 places, 218/218 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 335 edges and 216 vertex of which 200 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.3 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Detected a total of 39/216 stabilizing places and 39/218 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 81 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :3
Finished Best-First random walk after 9307 steps, including 11 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1551 )
Knowledge obtained : [(AND p1 p0), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 3 factoid took 314 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 272 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20000 reset in 266 ms.
Product exploration explored 100000 steps with 20000 reset in 283 ms.
Built C files in :
/tmp/ltsmin14848685045352846303
[2023-03-10 16:50:25] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14848685045352846303
Running compilation step : cd /tmp/ltsmin14848685045352846303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 758 ms.
Running link step : cd /tmp/ltsmin14848685045352846303;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin14848685045352846303;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11680059170520188983.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-04 finished in 6213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0) U (p1&&G(p2)))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 221 transition count 226
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 19 place count 218 transition count 223
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 218 transition count 223
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 218 transition count 220
Applied a total of 25 rules in 17 ms. Remains 218 /228 variables (removed 10) and now considering 220/235 (removed 15) transitions.
// Phase 1: matrix 220 rows 218 cols
[2023-03-10 16:50:26] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 16:50:26] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-10 16:50:26] [INFO ] Invariant cache hit.
[2023-03-10 16:50:26] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
[2023-03-10 16:50:27] [INFO ] Invariant cache hit.
[2023-03-10 16:50:27] [INFO ] Dead Transitions using invariants and state equation in 274 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 218/228 places, 220/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 218/228 places, 220/235 transitions.
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2), true, (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(NEQ s198 1), p2:(EQ s99 1), p0:(EQ s102 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, 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-12b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-05 finished in 1044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 194 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 205 transition count 120
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 110 rules applied. Total rules applied 216 place count 101 transition count 114
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 219 place count 99 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 98 transition count 113
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 220 place count 98 transition count 86
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 274 place count 71 transition count 86
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 285 place count 60 transition count 75
Iterating global reduction 4 with 11 rules applied. Total rules applied 296 place count 60 transition count 75
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 372 place count 22 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 22 transition count 36
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 384 place count 11 transition count 15
Iterating global reduction 5 with 11 rules applied. Total rules applied 395 place count 11 transition count 15
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 399 place count 9 transition count 14
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 401 place count 9 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 402 place count 8 transition count 13
Applied a total of 402 rules in 30 ms. Remains 8 /228 variables (removed 220) and now considering 13/235 (removed 222) transitions.
[2023-03-10 16:50:27] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
// Phase 1: matrix 12 rows 8 cols
[2023-03-10 16:50:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:50:27] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-10 16:50:27] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 16:50:27] [INFO ] Invariant cache hit.
[2023-03-10 16:50:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:50:27] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-10 16:50:27] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-10 16:50:27] [INFO ] Flow matrix only has 12 transitions (discarded 1 similar events)
[2023-03-10 16:50:27] [INFO ] Invariant cache hit.
[2023-03-10 16:50:27] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/228 places, 13/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 8/228 places, 13/235 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-08 finished in 210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 221 transition count 228
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 221 transition count 228
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 16 place count 221 transition count 226
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 217 transition count 222
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 217 transition count 222
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 217 transition count 219
Applied a total of 27 rules in 10 ms. Remains 217 /228 variables (removed 11) and now considering 219/235 (removed 16) transitions.
// Phase 1: matrix 219 rows 217 cols
[2023-03-10 16:50:27] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-10 16:50:28] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-10 16:50:28] [INFO ] Invariant cache hit.
[2023-03-10 16:50:28] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 397 ms to find 0 implicit places.
[2023-03-10 16:50:28] [INFO ] Invariant cache hit.
[2023-03-10 16:50:28] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 217/228 places, 219/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 680 ms. Remains : 217/228 places, 219/235 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s197 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 33333 reset in 436 ms.
Product exploration explored 100000 steps with 33333 reset in 398 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Graph (complete) has 336 edges and 217 vertex of which 201 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 49 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GPUForwardProgress-PT-12b-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-09 finished in 1718 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||G(p2))))'
Support contains 4 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 229
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 229
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 222 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 219 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 219 transition count 224
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 219 transition count 222
Applied a total of 22 rules in 10 ms. Remains 219 /228 variables (removed 9) and now considering 222/235 (removed 13) transitions.
// Phase 1: matrix 222 rows 219 cols
[2023-03-10 16:50:29] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:50:29] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-10 16:50:29] [INFO ] Invariant cache hit.
[2023-03-10 16:50:29] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-10 16:50:29] [INFO ] Invariant cache hit.
[2023-03-10 16:50:30] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/228 places, 222/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 590 ms. Remains : 219/228 places, 222/235 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (EQ s149 0) (EQ s72 0)), p2:(EQ s164 1), p0:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 531 steps with 5 reset in 1 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-12 finished in 869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&X(p1)))&&F(p2))))'
Support contains 3 out of 228 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 222 transition count 229
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 222 transition count 229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 222 transition count 228
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 219 transition count 225
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 219 transition count 225
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 219 transition count 223
Applied a total of 21 rules in 14 ms. Remains 219 /228 variables (removed 9) and now considering 223/235 (removed 12) transitions.
// Phase 1: matrix 223 rows 219 cols
[2023-03-10 16:50:30] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-10 16:50:30] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-10 16:50:30] [INFO ] Invariant cache hit.
[2023-03-10 16:50:30] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
[2023-03-10 16:50:30] [INFO ] Invariant cache hit.
[2023-03-10 16:50:30] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 219/228 places, 223/235 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 558 ms. Remains : 219/228 places, 223/235 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s75 0), p2:(EQ s142 1), p1:(EQ s65 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 105 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-13 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 2 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 191 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 104 place count 205 transition count 122
Reduce places removed 102 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 109 rules applied. Total rules applied 213 place count 103 transition count 115
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 217 place count 101 transition count 113
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 99 transition count 113
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 219 place count 99 transition count 86
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 273 place count 72 transition count 86
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 284 place count 61 transition count 75
Iterating global reduction 4 with 11 rules applied. Total rules applied 295 place count 61 transition count 75
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 371 place count 23 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 372 place count 23 transition count 36
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 382 place count 13 transition count 17
Iterating global reduction 5 with 10 rules applied. Total rules applied 392 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 394 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 395 place count 11 transition count 15
Applied a total of 395 rules in 18 ms. Remains 11 /228 variables (removed 217) and now considering 15/235 (removed 220) transitions.
// Phase 1: matrix 15 rows 11 cols
[2023-03-10 16:50:31] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-10 16:50:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 16:50:31] [INFO ] Invariant cache hit.
[2023-03-10 16:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:50:31] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-10 16:50:31] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-10 16:50:31] [INFO ] Invariant cache hit.
[2023-03-10 16:50:31] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/228 places, 15/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 11/228 places, 15/235 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s6 1), p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-14 finished in 197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 228 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 228/228 places, 235/235 transitions.
Graph (trivial) has 194 edges and 228 vertex of which 7 / 228 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 345 edges and 222 vertex of which 206 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 205 transition count 120
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 110 rules applied. Total rules applied 216 place count 101 transition count 114
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 220 place count 99 transition count 112
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 223 place count 97 transition count 111
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 223 place count 97 transition count 84
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 277 place count 70 transition count 84
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 288 place count 59 transition count 73
Iterating global reduction 4 with 11 rules applied. Total rules applied 299 place count 59 transition count 73
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 377 place count 20 transition count 34
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 378 place count 20 transition count 33
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 389 place count 9 transition count 12
Iterating global reduction 5 with 11 rules applied. Total rules applied 400 place count 9 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 402 place count 8 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 403 place count 7 transition count 10
Applied a total of 403 rules in 25 ms. Remains 7 /228 variables (removed 221) and now considering 10/235 (removed 225) transitions.
// Phase 1: matrix 10 rows 7 cols
[2023-03-10 16:50:31] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 16:50:31] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 16:50:31] [INFO ] Invariant cache hit.
[2023-03-10 16:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-10 16:50:31] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 16:50:31] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-10 16:50:31] [INFO ] Invariant cache hit.
[2023-03-10 16:50:31] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/228 places, 10/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 7/228 places, 10/235 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : GPUForwardProgress-PT-12b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s2 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 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-12b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-12b-LTLFireability-15 finished in 202 ms.
All properties solved by simple procedures.
Total runtime 169921 ms.

BK_STOP 1678467032631

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GPUForwardProgress-PT-12b"
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-5348"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-12b, 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 r197-smll-167840343700044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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