Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 400K
-rw-r--r-- 1 mcc users 12K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 12 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 12 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 12 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 12 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 2.4K May 11 18:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 12K May 11 18:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 11 15:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 11 15:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.3K May 12 04:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K May 12 04:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 4 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 57K May 12 08:13 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1621271644097

Running Version 0
[2021-05-17 17:14:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 17:14:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 17:14:06] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2021-05-17 17:14:06] [INFO ] Transformed 340 places.
[2021-05-17 17:14:06] [INFO ] Transformed 357 transitions.
[2021-05-17 17:14:06] [INFO ] Found NUPN structural information;
[2021-05-17 17:14:06] [INFO ] Parsed PT model containing 340 places and 357 transitions in 134 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 17:14:06] [INFO ] Initial state test concluded for 1 properties.
Support contains 38 out of 340 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 340/340 places, 357/357 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 339 transition count 357
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 32 place count 308 transition count 326
Iterating global reduction 1 with 31 rules applied. Total rules applied 63 place count 308 transition count 326
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 76 place count 295 transition count 313
Iterating global reduction 1 with 13 rules applied. Total rules applied 89 place count 295 transition count 313
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 100 place count 295 transition count 302
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 294 transition count 301
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 294 transition count 301
Applied a total of 102 rules in 120 ms. Remains 294 /340 variables (removed 46) and now considering 301/357 (removed 56) transitions.
// Phase 1: matrix 301 rows 294 cols
[2021-05-17 17:14:06] [INFO ] Computed 17 place invariants in 20 ms
[2021-05-17 17:14:06] [INFO ] Implicit Places using invariants in 233 ms returned []
// Phase 1: matrix 301 rows 294 cols
[2021-05-17 17:14:06] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-17 17:14:07] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
// Phase 1: matrix 301 rows 294 cols
[2021-05-17 17:14:07] [INFO ] Computed 17 place invariants in 5 ms
[2021-05-17 17:14:07] [INFO ] Dead Transitions using invariants and state equation in 193 ms returned []
Finished structural reductions, in 1 iterations. Remains : 294/340 places, 301/357 transitions.
[2021-05-17 17:14:07] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-17 17:14:07] [INFO ] Flatten gal took : 54 ms
FORMULA GPUForwardProgress-PT-16b-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-16b-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 17:14:07] [INFO ] Flatten gal took : 23 ms
[2021-05-17 17:14:07] [INFO ] Input system was already deterministic with 301 transitions.
Incomplete random walk after 100000 steps, including 683 resets, run finished after 340 ms. (steps per millisecond=294 ) properties (out of 34) seen :33
Running SMT prover for 1 properties.
// Phase 1: matrix 301 rows 294 cols
[2021-05-17 17:14:07] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 17:14:07] [INFO ] [Real]Absence check using 0 positive and 17 generalized place invariants in 6 ms returned sat
[2021-05-17 17:14:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 17:14:07] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2021-05-17 17:14:08] [INFO ] Computed and/alt/rep : 295/390/295 causal constraints (skipped 5 transitions) in 16 ms.
[2021-05-17 17:14:08] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 17:14:08] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 7 ms returned sat
[2021-05-17 17:14:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 17:14:08] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2021-05-17 17:14:08] [INFO ] Computed and/alt/rep : 295/390/295 causal constraints (skipped 5 transitions) in 20 ms.
[2021-05-17 17:14:08] [INFO ] Added : 125 causal constraints over 25 iterations in 413 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&X((p1||(!p1&&F(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 286 transition count 293
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 286 transition count 293
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 286 transition count 291
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 20 place count 284 transition count 289
Iterating global reduction 1 with 2 rules applied. Total rules applied 22 place count 284 transition count 289
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 284 transition count 287
Applied a total of 24 rules in 36 ms. Remains 284 /294 variables (removed 10) and now considering 287/301 (removed 14) transitions.
// Phase 1: matrix 287 rows 284 cols
[2021-05-17 17:14:08] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-17 17:14:08] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 287 rows 284 cols
[2021-05-17 17:14:08] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 17:14:09] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 287 rows 284 cols
[2021-05-17 17:14:09] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:09] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 284/294 places, 287/301 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-16b-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s184 0), p1:(EQ s199 1), p2:(EQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 170 steps with 0 reset in 4 ms.
FORMULA GPUForwardProgress-PT-16b-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-00 finished in 698 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&X(F(((p1 U p2) U ((!p0&&(p1 U p2))||G((p1 U p2))))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 284 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 284 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 284 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 281 transition count 287
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 281 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 281 transition count 284
Applied a total of 30 rules in 18 ms. Remains 281 /294 variables (removed 13) and now considering 284/301 (removed 17) transitions.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:09] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 17:14:09] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:09] [INFO ] Computed 17 place invariants in 4 ms
[2021-05-17 17:14:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:09] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:09] [INFO ] Dead Transitions using invariants and state equation in 133 ms returned []
Finished structural reductions, in 1 iterations. Remains : 281/294 places, 284/301 transitions.
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-16b-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s142 1) (EQ s268 1) (EQ s279 1)), p2:(EQ s0 1), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-16b-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-01 finished in 577 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U G((G(p0)||(p1&&F(p2))||G(p1))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 283 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 283 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 283 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 281 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 281 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 281 transition count 284
Applied a total of 30 rules in 14 ms. Remains 281 /294 variables (removed 13) and now considering 284/301 (removed 17) transitions.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:10] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:10] [INFO ] Computed 17 place invariants in 3 ms
[2021-05-17 17:14:10] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:10] [INFO ] Dead Transitions using invariants and state equation in 116 ms returned []
Finished structural reductions, in 1 iterations. Remains : 281/294 places, 284/301 transitions.
Stuttering acceptance computed with spot in 245 ms :[(AND (NOT p0) (NOT p1)), true, (OR (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p0 p1) (AND p1 p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s166 1), p2:(NEQ s54 1), p1:(NEQ s184 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 17864 steps with 125 reset in 56 ms.
FORMULA GPUForwardProgress-PT-16b-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-02 finished in 670 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Graph (trivial) has 244 edges and 294 vertex of which 6 / 294 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 288 transition count 158
Reduce places removed 136 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 142 rules applied. Total rules applied 279 place count 152 transition count 152
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 284 place count 150 transition count 149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 287 place count 147 transition count 149
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 287 place count 147 transition count 114
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 357 place count 112 transition count 114
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 358 place count 111 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 359 place count 111 transition count 113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 360 place count 111 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 360 place count 111 transition count 111
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 362 place count 110 transition count 111
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 5 with 98 rules applied. Total rules applied 460 place count 61 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 461 place count 61 transition count 61
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 462 place count 60 transition count 60
Iterating global reduction 6 with 1 rules applied. Total rules applied 463 place count 60 transition count 60
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 6 with 2 rules applied. Total rules applied 465 place count 59 transition count 59
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 466 place count 58 transition count 58
Applied a total of 466 rules in 44 ms. Remains 58 /294 variables (removed 236) and now considering 58/301 (removed 243) transitions.
[2021-05-17 17:14:10] [INFO ] Flow matrix only has 45 transitions (discarded 13 similar events)
// Phase 1: matrix 45 rows 58 cols
[2021-05-17 17:14:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:10] [INFO ] Implicit Places using invariants in 33 ms returned []
[2021-05-17 17:14:10] [INFO ] Flow matrix only has 45 transitions (discarded 13 similar events)
// Phase 1: matrix 45 rows 58 cols
[2021-05-17 17:14:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 17:14:10] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2021-05-17 17:14:10] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-17 17:14:10] [INFO ] Flow matrix only has 45 transitions (discarded 13 similar events)
// Phase 1: matrix 45 rows 58 cols
[2021-05-17 17:14:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:10] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/294 places, 58/301 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GPUForwardProgress-PT-16b-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s10 1), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-03 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||G(!p0)||(p1&&G(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Graph (trivial) has 246 edges and 294 vertex of which 6 / 294 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 288 transition count 155
Reduce places removed 139 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 145 rules applied. Total rules applied 285 place count 149 transition count 149
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 289 place count 147 transition count 147
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 292 place count 145 transition count 146
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 292 place count 145 transition count 110
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 364 place count 109 transition count 110
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 4 with 98 rules applied. Total rules applied 462 place count 60 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 463 place count 60 transition count 60
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 464 place count 59 transition count 59
Iterating global reduction 5 with 1 rules applied. Total rules applied 465 place count 59 transition count 59
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 467 place count 58 transition count 58
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 468 place count 58 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 469 place count 57 transition count 57
Applied a total of 469 rules in 27 ms. Remains 57 /294 variables (removed 237) and now considering 57/301 (removed 244) transitions.
[2021-05-17 17:14:10] [INFO ] Flow matrix only has 44 transitions (discarded 13 similar events)
// Phase 1: matrix 44 rows 57 cols
[2021-05-17 17:14:10] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 44 transitions (discarded 13 similar events)
// Phase 1: matrix 44 rows 57 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2021-05-17 17:14:11] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 44 transitions (discarded 13 similar events)
// Phase 1: matrix 44 rows 57 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/294 places, 57/301 transitions.
Stuttering acceptance computed with spot in 104 ms :[false, p0, (AND p0 (NOT p2)), true, (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-16b-05 automaton TGBA [mat=[[{ cond=(OR p0 (AND p1 p2)), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s46 1), p1:(EQ s14 1), p2:(EQ s14 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 68 steps with 3 reset in 1 ms.
FORMULA GPUForwardProgress-PT-16b-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-05 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Graph (trivial) has 248 edges and 294 vertex of which 6 / 294 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 288 transition count 154
Reduce places removed 140 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 147 rules applied. Total rules applied 288 place count 148 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 290 place count 146 transition count 147
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 290 place count 146 transition count 110
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 364 place count 109 transition count 110
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 464 place count 59 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 465 place count 59 transition count 59
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 466 place count 58 transition count 58
Iterating global reduction 4 with 1 rules applied. Total rules applied 467 place count 58 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 469 place count 57 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 470 place count 56 transition count 56
Applied a total of 470 rules in 20 ms. Remains 56 /294 variables (removed 238) and now considering 56/301 (removed 245) transitions.
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 42 transitions (discarded 14 similar events)
// Phase 1: matrix 42 rows 56 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 42 transitions (discarded 14 similar events)
// Phase 1: matrix 42 rows 56 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2021-05-17 17:14:11] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 42 transitions (discarded 14 similar events)
// Phase 1: matrix 42 rows 56 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 17:14:11] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 56/294 places, 56/301 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s25 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-16b-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-06 finished in 177 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)||G((p2||F(p3)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Graph (trivial) has 243 edges and 294 vertex of which 6 / 294 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 139 place count 288 transition count 156
Reduce places removed 138 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 145 rules applied. Total rules applied 284 place count 150 transition count 149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 286 place count 148 transition count 149
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 286 place count 148 transition count 112
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 360 place count 111 transition count 112
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 454 place count 64 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 455 place count 64 transition count 64
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 456 place count 63 transition count 63
Iterating global reduction 4 with 1 rules applied. Total rules applied 457 place count 63 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 459 place count 62 transition count 62
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 461 place count 62 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 462 place count 61 transition count 61
Applied a total of 462 rules in 20 ms. Remains 61 /294 variables (removed 233) and now considering 61/301 (removed 240) transitions.
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 48 transitions (discarded 13 similar events)
// Phase 1: matrix 48 rows 61 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 48 transitions (discarded 13 similar events)
// Phase 1: matrix 48 rows 61 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 17:14:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2021-05-17 17:14:11] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-17 17:14:11] [INFO ] Flow matrix only has 48 transitions (discarded 13 similar events)
// Phase 1: matrix 48 rows 61 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 0 ms
[2021-05-17 17:14:11] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/294 places, 61/301 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p1) p2), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : GPUForwardProgress-PT-16b-07 automaton TGBA [mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s12 1), p1:(EQ s46 1), p2:(EQ s57 1), p3:(NEQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-07 finished in 266 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0) U p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 283 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 283 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 283 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 281 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 281 transition count 286
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 30 place count 281 transition count 284
Applied a total of 30 rules in 25 ms. Remains 281 /294 variables (removed 13) and now considering 284/301 (removed 17) transitions.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:11] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:11] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:12] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
Finished structural reductions, in 1 iterations. Remains : 281/294 places, 284/301 transitions.
Stuttering acceptance computed with spot in 165 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s190 0), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 291 ms.
Product exploration explored 100000 steps with 25000 reset in 341 ms.
Graph (complete) has 437 edges and 281 vertex of which 261 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.2 ms
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 172 ms.
Product exploration explored 100000 steps with 25000 reset in 238 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Support contains 2 out of 281 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 281/281 places, 284/284 transitions.
Graph (trivial) has 231 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 130 rules applied. Total rules applied 131 place count 276 transition count 278
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 131 place count 276 transition count 616
Deduced a syphon composed of 152 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 153 place count 276 transition count 616
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 232 place count 197 transition count 345
Deduced a syphon composed of 73 places in 1 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 311 place count 197 transition count 345
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 360 place count 197 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 362 place count 197 transition count 343
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 397 place count 162 transition count 308
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 432 place count 162 transition count 308
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 433 place count 162 transition count 308
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 434 place count 161 transition count 307
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 435 place count 161 transition count 307
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -138
Deduced a syphon composed of 103 places in 1 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 451 place count 161 transition count 445
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 468 place count 144 transition count 411
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 485 place count 144 transition count 411
Deduced a syphon composed of 86 places in 1 ms
Applied a total of 485 rules in 73 ms. Remains 144 /281 variables (removed 137) and now considering 411/284 (removed -127) transitions.
[2021-05-17 17:14:13] [INFO ] Redundant transitions in 23 ms returned []
[2021-05-17 17:14:13] [INFO ] Flow matrix only has 355 transitions (discarded 56 similar events)
// Phase 1: matrix 355 rows 144 cols
[2021-05-17 17:14:13] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 17:14:13] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 144/281 places, 411/284 transitions.
Product exploration explored 100000 steps with 25000 reset in 793 ms.
Product exploration explored 100000 steps with 25000 reset in 513 ms.
[2021-05-17 17:14:15] [INFO ] Flatten gal took : 15 ms
[2021-05-17 17:14:15] [INFO ] Flatten gal took : 14 ms
[2021-05-17 17:14:15] [INFO ] Time to serialize gal into /tmp/LTL15719181760176189102.gal : 7 ms
[2021-05-17 17:14:15] [INFO ] Time to serialize properties into /tmp/LTL5212137728854886759.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL15719181760176189102.gal, -t, CGAL, -LTL, /tmp/LTL5212137728854886759.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL15719181760176189102.gal -t CGAL -LTL /tmp/LTL5212137728854886759.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(p1==1)"))U("(p224==0)"))))))
Formula 0 simplified : !XXX(G"(p1==1)" U "(p224==0)")
Detected timeout of ITS tools.
[2021-05-17 17:14:30] [INFO ] Flatten gal took : 17 ms
[2021-05-17 17:14:30] [INFO ] Applying decomposition
[2021-05-17 17:14:30] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7534692137151319964.txt, -o, /tmp/graph7534692137151319964.bin, -w, /tmp/graph7534692137151319964.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7534692137151319964.bin, -l, -1, -v, -w, /tmp/graph7534692137151319964.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:14:30] [INFO ] Decomposing Gal with order
[2021-05-17 17:14:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:14:30] [INFO ] Removed a total of 85 redundant transitions.
[2021-05-17 17:14:30] [INFO ] Flatten gal took : 94 ms
[2021-05-17 17:14:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 16 ms.
[2021-05-17 17:14:30] [INFO ] Time to serialize gal into /tmp/LTL17888666694317223068.gal : 11 ms
[2021-05-17 17:14:30] [INFO ] Time to serialize properties into /tmp/LTL7040724665262940853.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL17888666694317223068.gal, -t, CGAL, -LTL, /tmp/LTL7040724665262940853.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL17888666694317223068.gal -t CGAL -LTL /tmp/LTL7040724665262940853.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(X((G("(i9.i2.u0.p1==1)"))U("(i12.i0.u81.p224==0)"))))))
Formula 0 simplified : !XXX(G"(i9.i2.u0.p1==1)" U "(i12.i0.u81.p224==0)")
Reverse transition relation is NOT exact ! Due to transitions t267, i0.i1.t255, i0.i1.u8.t262, i1.t249, i1.i2.t241, i2.t234, i2.i0.t227, i3.t220, i3.i1.u26.t213, i4.t206, i4.i1.t195, i5.t188, i5.i1.t181, i6.i0.t165, i6.i0.u51.t174, i7.t158, i7.i1.u52.t151, i8.t144, i8.i2.t134, i10.t127, i10.i0.t120, i11.t113, i11.i2.t104, i12.t97, i12.i1.u84.t86, i13.t79, i13.i0.t72, i14.t65, i14.i0.t57, i15.t50, i15.i2.t43, i16.t36, i16.i2.t28, i17.i0.t22, i17.i0.u113.t23, i17.i1.t2, i17.i1.t10, i17.i1.u120.t4, i17.i1.u120.t5, i17.i1.u120.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/244/40/284
Computing Next relation with stutter on 8.60279e+07 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
33 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.374907,27324,1,0,18517,340,2776,33785,148,922,77558
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-16b-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-16b-08 finished in 19514 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 284 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 284 transition count 291
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 284 transition count 289
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 24 place count 282 transition count 287
Iterating global reduction 1 with 2 rules applied. Total rules applied 26 place count 282 transition count 287
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 28 place count 282 transition count 285
Applied a total of 28 rules in 13 ms. Remains 282 /294 variables (removed 12) and now considering 285/301 (removed 16) transitions.
// Phase 1: matrix 285 rows 282 cols
[2021-05-17 17:14:31] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:31] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 285 rows 282 cols
[2021-05-17 17:14:31] [INFO ] Computed 17 place invariants in 9 ms
[2021-05-17 17:14:31] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
// Phase 1: matrix 285 rows 282 cols
[2021-05-17 17:14:31] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:31] [INFO ] Dead Transitions using invariants and state equation in 151 ms returned []
Finished structural reductions, in 1 iterations. Remains : 282/294 places, 285/301 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(NEQ s138 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Graph (complete) has 438 edges and 282 vertex of which 262 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 200 ms.
Product exploration explored 100000 steps with 33333 reset in 210 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 282 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 282/282 places, 285/285 transitions.
Graph (trivial) has 232 edges and 282 vertex of which 6 / 282 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 277 transition count 279
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 132 place count 277 transition count 616
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 153 place count 277 transition count 616
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 233 place count 197 transition count 344
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 313 place count 197 transition count 344
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 122 places in 0 ms
Iterating global reduction 1 with 50 rules applied. Total rules applied 363 place count 197 transition count 344
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 365 place count 197 transition count 342
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 400 place count 162 transition count 307
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 35 rules applied. Total rules applied 435 place count 162 transition count 307
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 436 place count 162 transition count 307
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 437 place count 161 transition count 306
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 438 place count 161 transition count 306
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -154
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 455 place count 161 transition count 460
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 471 place count 145 transition count 428
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 487 place count 145 transition count 428
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 487 rules in 43 ms. Remains 145 /282 variables (removed 137) and now considering 428/285 (removed -143) transitions.
[2021-05-17 17:14:32] [INFO ] Redundant transitions in 7 ms returned []
[2021-05-17 17:14:32] [INFO ] Flow matrix only has 368 transitions (discarded 60 similar events)
// Phase 1: matrix 368 rows 145 cols
[2021-05-17 17:14:32] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:33] [INFO ] Dead Transitions using invariants and state equation in 207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 145/282 places, 428/285 transitions.
Product exploration explored 100000 steps with 33333 reset in 639 ms.
Product exploration explored 100000 steps with 33333 reset in 650 ms.
[2021-05-17 17:14:34] [INFO ] Flatten gal took : 10 ms
[2021-05-17 17:14:34] [INFO ] Flatten gal took : 10 ms
[2021-05-17 17:14:34] [INFO ] Time to serialize gal into /tmp/LTL481760658867368610.gal : 1 ms
[2021-05-17 17:14:34] [INFO ] Time to serialize properties into /tmp/LTL3381901850672096737.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL481760658867368610.gal, -t, CGAL, -LTL, /tmp/LTL3381901850672096737.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL481760658867368610.gal -t CGAL -LTL /tmp/LTL3381901850672096737.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(p162!=1)")))))
Formula 0 simplified : !XXF"(p162!=1)"
Detected timeout of ITS tools.
[2021-05-17 17:14:49] [INFO ] Flatten gal took : 10 ms
[2021-05-17 17:14:49] [INFO ] Applying decomposition
[2021-05-17 17:14:49] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph11476454974397187146.txt, -o, /tmp/graph11476454974397187146.bin, -w, /tmp/graph11476454974397187146.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph11476454974397187146.bin, -l, -1, -v, -w, /tmp/graph11476454974397187146.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:14:49] [INFO ] Decomposing Gal with order
[2021-05-17 17:14:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:14:49] [INFO ] Removed a total of 84 redundant transitions.
[2021-05-17 17:14:49] [INFO ] Flatten gal took : 19 ms
[2021-05-17 17:14:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-17 17:14:49] [INFO ] Time to serialize gal into /tmp/LTL367540144982531656.gal : 3 ms
[2021-05-17 17:14:49] [INFO ] Time to serialize properties into /tmp/LTL6488905642521593207.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL367540144982531656.gal, -t, CGAL, -LTL, /tmp/LTL6488905642521593207.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL367540144982531656.gal -t CGAL -LTL /tmp/LTL6488905642521593207.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("(i9.u61.p162!=1)")))))
Formula 0 simplified : !XXF"(i9.u61.p162!=1)"
Reverse transition relation is NOT exact ! Due to transitions t267, i1.t262, i1.u13.t255, i2.t241, i2.u16.t249, i3.t234, i3.t227, i4.t220, i4.u32.t213, i5.t206, i5.t195, i6.t188, i6.t181, i7.t174, i7.u47.t165, i8.t158, i8.t151, i9.t144, i9.t134, i10.t127, i10.t120, i11.t113, i11.t104, i12.t97, i12.t86, i13.t79, i13.t72, i14.t57, i14.u96.t65, i15.t50, i15.t43, i16.t36, i16.u107.t28, i17.t22, i17.t10, i17.t2, i17.u113.t23, i17.u120.t4, i17.u120.t5, i17.u120.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/245/40/285
Computing Next relation with stutter on 8.60279e+07 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
37 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.397253,27456,1,0,18784,300,2582,39572,149,840,85059
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-16b-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-16b-09 finished in 18908 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((X(p1)||(p2 U (p3||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 284 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 284 transition count 291
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 284 transition count 290
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 281 transition count 287
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 281 transition count 287
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 30 place count 281 transition count 284
Applied a total of 30 rules in 10 ms. Remains 281 /294 variables (removed 13) and now considering 284/301 (removed 17) transitions.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:50] [INFO ] Computed 17 place invariants in 9 ms
[2021-05-17 17:14:50] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:50] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:50] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
// Phase 1: matrix 284 rows 281 cols
[2021-05-17 17:14:50] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:50] [INFO ] Dead Transitions using invariants and state equation in 135 ms returned []
Finished structural reductions, in 1 iterations. Remains : 281/294 places, 284/301 transitions.
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), true, false, (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : GPUForwardProgress-PT-16b-10 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 p0), acceptance={1} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0), acceptance={0, 1} source=0 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 8}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0} source=7 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={1} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(OR (EQ s220 1) (EQ s144 0)), p3:(AND (NEQ s109 1) (NEQ s144 1)), p2:(NEQ s144 1), p1:(NEQ s220 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 692 reset in 231 ms.
Product exploration explored 100000 steps with 705 reset in 286 ms.
Graph (complete) has 437 edges and 281 vertex of which 261 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p3, p2, p1]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), true, false, (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 690 reset in 204 ms.
Product exploration explored 100000 steps with 701 reset in 204 ms.
Applying partial POR strategy [false, true, false, false, false, true, true, false, false, true]
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), true, false, (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p3) (NOT p2))]
Support contains 3 out of 281 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 281/281 places, 284/284 transitions.
Graph (trivial) has 226 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 276 transition count 278
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 23 Pre rules applied. Total rules applied 129 place count 276 transition count 616
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 152 place count 276 transition count 616
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 231 place count 197 transition count 345
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 79 rules applied. Total rules applied 310 place count 197 transition count 345
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 359 place count 197 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 361 place count 197 transition count 343
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 395 place count 163 transition count 309
Deduced a syphon composed of 87 places in 1 ms
Iterating global reduction 2 with 34 rules applied. Total rules applied 429 place count 163 transition count 309
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 88 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 430 place count 163 transition count 309
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 431 place count 162 transition count 308
Deduced a syphon composed of 87 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 432 place count 162 transition count 308
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -120
Deduced a syphon composed of 101 places in 0 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 446 place count 162 transition count 428
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 461 place count 147 transition count 398
Deduced a syphon composed of 86 places in 0 ms
Iterating global reduction 2 with 15 rules applied. Total rules applied 476 place count 147 transition count 398
Deduced a syphon composed of 86 places in 0 ms
Applied a total of 476 rules in 46 ms. Remains 147 /281 variables (removed 134) and now considering 398/284 (removed -114) transitions.
[2021-05-17 17:14:52] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 17:14:52] [INFO ] Flow matrix only has 350 transitions (discarded 48 similar events)
// Phase 1: matrix 350 rows 147 cols
[2021-05-17 17:14:52] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:14:52] [INFO ] Dead Transitions using invariants and state equation in 242 ms returned []
Finished structural reductions, in 1 iterations. Remains : 147/281 places, 398/284 transitions.
Product exploration explored 100000 steps with 699 reset in 313 ms.
Product exploration explored 100000 steps with 696 reset in 363 ms.
[2021-05-17 17:14:53] [INFO ] Flatten gal took : 9 ms
[2021-05-17 17:14:53] [INFO ] Flatten gal took : 9 ms
[2021-05-17 17:14:53] [INFO ] Time to serialize gal into /tmp/LTL16659518435979876344.gal : 11 ms
[2021-05-17 17:14:53] [INFO ] Time to serialize properties into /tmp/LTL8347216121299067317.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16659518435979876344.gal, -t, CGAL, -LTL, /tmp/LTL8347216121299067317.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16659518435979876344.gal -t CGAL -LTL /tmp/LTL8347216121299067317.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((p258==1)||(p167==0))")U(G((X("(p258!=1)"))||(("(p167!=1)")U(("((p127!=1)&&(p167!=1))")||(G("(p167!=1)"))))))))
Formula 0 simplified : !("((p258==1)||(p167==0))" U G(X"(p258!=1)" | ("(p167!=1)" U ("((p127!=1)&&(p167!=1))" | G"(p167!=1)"))))
Detected timeout of ITS tools.
[2021-05-17 17:15:08] [INFO ] Flatten gal took : 8 ms
[2021-05-17 17:15:08] [INFO ] Applying decomposition
[2021-05-17 17:15:08] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph10593595767424239413.txt, -o, /tmp/graph10593595767424239413.bin, -w, /tmp/graph10593595767424239413.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph10593595767424239413.bin, -l, -1, -v, -w, /tmp/graph10593595767424239413.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:15:08] [INFO ] Decomposing Gal with order
[2021-05-17 17:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:15:08] [INFO ] Removed a total of 79 redundant transitions.
[2021-05-17 17:15:08] [INFO ] Flatten gal took : 30 ms
[2021-05-17 17:15:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 9 ms.
[2021-05-17 17:15:08] [INFO ] Time to serialize gal into /tmp/LTL2321855132536435863.gal : 5 ms
[2021-05-17 17:15:08] [INFO ] Time to serialize properties into /tmp/LTL5730487079219299066.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2321855132536435863.gal, -t, CGAL, -LTL, /tmp/LTL5730487079219299066.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2321855132536435863.gal -t CGAL -LTL /tmp/LTL5730487079219299066.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((i14.i0.u93.p258==1)||(i9.i0.u62.p167==0))")U(G((X("(i14.i0.u93.p258!=1)"))||(("(i9.i0.u62.p167!=1)")U(("((i7.i0.u51.p127!=1)&&(i9.i0.u62.p167!=1))")||(G("(i9.i0.u62.p167!=1)"))))))))
Formula 0 simplified : !("((i14.i0.u93.p258==1)||(i9.i0.u62.p167==0))" U G(X"(i14.i0.u93.p258!=1)" | ("(i9.i0.u62.p167!=1)" U ("((i7.i0.u51.p127!=1)&&(i9.i0.u62.p167!=1))" | G"(i9.i0.u62.p167!=1)"))))
Reverse transition relation is NOT exact ! Due to transitions t267, i1.t262, i1.i0.t255, i2.t249, i2.i2.t241, i3.t234, i3.i2.t227, i4.t220, i4.i2.t213, i5.t206, i5.i1.u35.t195, i6.t188, i6.i2.t181, i7.i1.t165, i7.i1.u49.t174, i8.t158, i8.i1.u59.t151, i9.t144, i9.i2.t134, i10.t127, i10.i1.u67.t120, i11.t113, i11.i0.t104, i12.i0.t86, i12.i0.u82.t97, i13.i1.t72, i13.i1.u90.t79, i14.i0.t57, i14.i0.u93.t65, i15.t50, i15.i2.t43, i16.t36, i16.i2.t28, i17.i0.t2, i17.i0.t10, i17.i0.u115.t4, i17.i0.u115.t5, i17.i0.u115.t6, i17.i1.t22, i17.i1.u111.t23, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/244/40/284
Computing Next relation with stutter on 8.60279e+07 deadlock states
139 unique states visited
139 strongly connected components in search stack
140 transitions explored
139 items max in DFS search stack
180 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.8311,71852,1,0,131620,374,3341,176366,154,1384,189580
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-16b-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-16b-10 finished in 20586 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U X((p1 U p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 283 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 283 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 283 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 280 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 280 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 280 transition count 282
Applied a total of 33 rules in 11 ms. Remains 280 /294 variables (removed 14) and now considering 282/301 (removed 19) transitions.
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:10] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:10] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:10] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:11] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 280/294 places, 282/301 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : GPUForwardProgress-PT-16b-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s268 1) (EQ s87 1)), p2:(EQ s25 0), p1:(EQ s265 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 283 ms.
Product exploration explored 100000 steps with 50000 reset in 287 ms.
Graph (complete) has 435 edges and 280 vertex of which 260 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0), p2, (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 80 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Support contains 4 out of 280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 280/280 places, 282/282 transitions.
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 131 rules applied. Total rules applied 131 place count 280 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 132 place count 280 transition count 281
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 132 place count 280 transition count 603
Deduced a syphon composed of 152 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 153 place count 280 transition count 603
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 231 place count 202 transition count 345
Deduced a syphon composed of 74 places in 0 ms
Iterating global reduction 2 with 78 rules applied. Total rules applied 309 place count 202 transition count 345
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 125 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 360 place count 202 transition count 345
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 362 place count 202 transition count 343
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 399 place count 165 transition count 306
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 3 with 37 rules applied. Total rules applied 436 place count 165 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 437 place count 165 transition count 306
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 438 place count 164 transition count 305
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 439 place count 164 transition count 305
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -133
Deduced a syphon composed of 104 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 455 place count 164 transition count 438
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 471 place count 148 transition count 406
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 3 with 16 rules applied. Total rules applied 487 place count 148 transition count 406
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 487 rules in 51 ms. Remains 148 /280 variables (removed 132) and now considering 406/282 (removed -124) transitions.
[2021-05-17 17:15:12] [INFO ] Redundant transitions in 2 ms returned []
[2021-05-17 17:15:12] [INFO ] Flow matrix only has 354 transitions (discarded 52 similar events)
// Phase 1: matrix 354 rows 148 cols
[2021-05-17 17:15:12] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 17:15:12] [INFO ] Dead Transitions using invariants and state equation in 185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 148/280 places, 406/282 transitions.
Product exploration explored 100000 steps with 50000 reset in 917 ms.
Product exploration explored 100000 steps with 50000 reset in 901 ms.
[2021-05-17 17:15:14] [INFO ] Flatten gal took : 8 ms
[2021-05-17 17:15:14] [INFO ] Flatten gal took : 8 ms
[2021-05-17 17:15:14] [INFO ] Time to serialize gal into /tmp/LTL14637637293297960138.gal : 1 ms
[2021-05-17 17:15:14] [INFO ] Time to serialize properties into /tmp/LTL1241933145471215863.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL14637637293297960138.gal, -t, CGAL, -LTL, /tmp/LTL1241933145471215863.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL14637637293297960138.gal -t CGAL -LTL /tmp/LTL1241933145471215863.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((("((p324==1)&&(p101==1))")U(X(("(p317==1)")U("(p27==0)")))))
Formula 0 simplified : !("((p324==1)&&(p101==1))" U X("(p317==1)" U "(p27==0)"))
Detected timeout of ITS tools.
[2021-05-17 17:15:29] [INFO ] Flatten gal took : 8 ms
[2021-05-17 17:15:29] [INFO ] Applying decomposition
[2021-05-17 17:15:29] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph5068003915548244719.txt, -o, /tmp/graph5068003915548244719.bin, -w, /tmp/graph5068003915548244719.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph5068003915548244719.bin, -l, -1, -v, -w, /tmp/graph5068003915548244719.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-17 17:15:29] [INFO ] Decomposing Gal with order
[2021-05-17 17:15:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-17 17:15:29] [INFO ] Removed a total of 82 redundant transitions.
[2021-05-17 17:15:29] [INFO ] Flatten gal took : 16 ms
[2021-05-17 17:15:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-17 17:15:29] [INFO ] Time to serialize gal into /tmp/LTL5740114894869481787.gal : 3 ms
[2021-05-17 17:15:29] [INFO ] Time to serialize properties into /tmp/LTL1302969668554420421.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL5740114894869481787.gal, -t, CGAL, -LTL, /tmp/LTL1302969668554420421.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5740114894869481787.gal -t CGAL -LTL /tmp/LTL1302969668554420421.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((("((i16.u119.p324==1)&&(i4.i0.u36.p101==1))")U(X(("(i16.u113.p317==1)")U("(i0.i0.u8.p27==0)")))))
Formula 0 simplified : !("((i16.u119.p324==1)&&(i4.i0.u36.p101==1))" U X("(i16.u113.p317==1)" U "(i0.i0.u8.p27==0)"))
Reverse transition relation is NOT exact ! Due to transitions t267, i0.t262, i0.i1.u12.t255, i1.t249, i1.i2.t241, i2.t234, i2.i1.u25.t227, i3.t220, i3.i2.t213, i4.i1.t195, i4.i1.u35.t206, i5.t188, i5.i1.t181, i6.t174, i6.i2.t165, i7.t158, i7.i2.t151, i8.i1.t134, i8.i1.u64.t144, i9.i0.t120, i9.i0.u68.t127, i10.t113, i10.i1.t104, i11.t97, i11.i1.t86, i12.t79, i12.i2.t72, i13.i0.t57, i13.i0.u94.t65, i14.t50, i14.i2.t43, i15.t36, i15.i1.t28, i16.t22, i16.t10, i16.t2, i16.u112.t23, i16.u117.t4, i16.u117.t5, i16.u117.t6, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/242/40/282
Computing Next relation with stutter on 8.60279e+07 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
37 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.40052,31372,1,0,24653,230,2756,56199,149,484,101206
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA GPUForwardProgress-PT-16b-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property GPUForwardProgress-PT-16b-12 finished in 19533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 1 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 283 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 283 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 283 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 280 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 280 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 280 transition count 282
Applied a total of 33 rules in 11 ms. Remains 280 /294 variables (removed 14) and now considering 282/301 (removed 19) transitions.
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:30] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:30] [INFO ] Implicit Places using invariants in 56 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:30] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:30] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:30] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 280/294 places, 282/301 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-13 finished in 413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(G(p0))&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 285 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 285 transition count 292
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 285 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 283 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 283 transition count 288
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 26 place count 283 transition count 286
Applied a total of 26 rules in 10 ms. Remains 283 /294 variables (removed 11) and now considering 286/301 (removed 15) transitions.
// Phase 1: matrix 286 rows 283 cols
[2021-05-17 17:15:30] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:30] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 286 rows 283 cols
[2021-05-17 17:15:30] [INFO ] Computed 17 place invariants in 2 ms
[2021-05-17 17:15:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
// Phase 1: matrix 286 rows 283 cols
[2021-05-17 17:15:30] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:30] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Finished structural reductions, in 1 iterations. Remains : 283/294 places, 286/301 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(NEQ s35 1), p0:(EQ s86 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-14 finished in 460 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(F(p0)) U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 294 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 294/294 places, 301/301 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 283 transition count 290
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 283 transition count 290
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 283 transition count 288
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 27 place count 280 transition count 285
Iterating global reduction 1 with 3 rules applied. Total rules applied 30 place count 280 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 33 place count 280 transition count 282
Applied a total of 33 rules in 11 ms. Remains 280 /294 variables (removed 14) and now considering 282/301 (removed 19) transitions.
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:31] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:31] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:31] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:31] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 282 rows 280 cols
[2021-05-17 17:15:31] [INFO ] Computed 17 place invariants in 1 ms
[2021-05-17 17:15:31] [INFO ] Dead Transitions using invariants and state equation in 123 ms returned []
Finished structural reductions, in 1 iterations. Remains : 280/294 places, 282/301 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-16b-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s178 1), p0:(EQ s175 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 137 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-16b-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-16b-15 finished in 430 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621271732606

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-16b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r292-tall-162124156000157"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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