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.r083-tall-162048875200285.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 DiscoveryGPU-PT-09a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200285
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 364K
-rw-r--r-- 1 mcc users 9.5K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 32K May 5 16:51 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 DiscoveryGPU-PT-09a-00
FORMULA_NAME DiscoveryGPU-PT-09a-01
FORMULA_NAME DiscoveryGPU-PT-09a-02
FORMULA_NAME DiscoveryGPU-PT-09a-03
FORMULA_NAME DiscoveryGPU-PT-09a-04
FORMULA_NAME DiscoveryGPU-PT-09a-05
FORMULA_NAME DiscoveryGPU-PT-09a-06
FORMULA_NAME DiscoveryGPU-PT-09a-07
FORMULA_NAME DiscoveryGPU-PT-09a-08
FORMULA_NAME DiscoveryGPU-PT-09a-09
FORMULA_NAME DiscoveryGPU-PT-09a-10
FORMULA_NAME DiscoveryGPU-PT-09a-11
FORMULA_NAME DiscoveryGPU-PT-09a-12
FORMULA_NAME DiscoveryGPU-PT-09a-13
FORMULA_NAME DiscoveryGPU-PT-09a-14
FORMULA_NAME DiscoveryGPU-PT-09a-15

=== Now, execution of the tool begins

BK_START 1620574998536

Running Version 0
[2021-05-09 15:43:29] [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-09 15:43:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:43:30] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2021-05-09 15:43:30] [INFO ] Transformed 93 places.
[2021-05-09 15:43:30] [INFO ] Transformed 127 transitions.
[2021-05-09 15:43:30] [INFO ] Found NUPN structural information;
[2021-05-09 15:43:30] [INFO ] Parsed PT model containing 93 places and 127 transitions in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:43:30] [INFO ] Initial state test concluded for 4 properties.
FORMULA DiscoveryGPU-PT-09a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 93 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 93/93 places, 127/127 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 88 transition count 122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 88 transition count 122
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 85 transition count 119
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 85 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 84 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 84 transition count 117
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 26 place count 84 transition count 109
Applied a total of 26 rules in 22 ms. Remains 84 /93 variables (removed 9) and now considering 109/127 (removed 18) transitions.
// Phase 1: matrix 109 rows 84 cols
[2021-05-09 15:43:30] [INFO ] Computed 2 place invariants in 10 ms
[2021-05-09 15:43:30] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 109 rows 84 cols
[2021-05-09 15:43:30] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 15:43:30] [INFO ] State equation strengthened by 69 read => feed constraints.
[2021-05-09 15:43:30] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
// Phase 1: matrix 109 rows 84 cols
[2021-05-09 15:43:30] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 15:43:30] [INFO ] Dead Transitions using invariants and state equation in 88 ms returned []
Finished structural reductions, in 1 iterations. Remains : 84/93 places, 109/127 transitions.
[2021-05-09 15:43:30] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 15:43:30] [INFO ] Flatten gal took : 31 ms
FORMULA DiscoveryGPU-PT-09a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-09a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:43:30] [INFO ] Flatten gal took : 11 ms
[2021-05-09 15:43:30] [INFO ] Input system was already deterministic with 109 transitions.
Finished random walk after 348 steps, including 3 resets, run visited all 27 properties in 12 ms. (steps per millisecond=29 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 84 transition count 104
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 79 transition count 104
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 16 place count 73 transition count 98
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 73 transition count 98
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 70 transition count 95
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 70 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 68 transition count 93
Applied a total of 32 rules in 25 ms. Remains 68 /84 variables (removed 16) and now considering 93/109 (removed 16) transitions.
// Phase 1: matrix 93 rows 68 cols
[2021-05-09 15:43:30] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:30] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 93 rows 68 cols
[2021-05-09 15:43:30] [INFO ] Computed 2 place invariants in 6 ms
[2021-05-09 15:43:30] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:30] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
[2021-05-09 15:43:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 93 rows 68 cols
[2021-05-09 15:43:31] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:31] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
Finished structural reductions, in 1 iterations. Remains : 68/84 places, 93/109 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DiscoveryGPU-PT-09a-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s23 1) (EQ s67 1)), p0:(AND (EQ s32 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 181 steps with 2 reset in 7 ms.
FORMULA DiscoveryGPU-PT-09a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-00 finished in 426 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))||((p1||G(p2)) U X(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 77 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 72 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 69 transition count 94
Applied a total of 30 rules in 8 ms. Remains 69 /84 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:31] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 15:43:31] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:31] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:31] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:31] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/84 places, 94/109 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p3) (NOT p0)), (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-09a-01 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 p2 (NOT p3))), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s25 1), p2:(AND (EQ s18 1) (EQ s68 1)), p3:(AND (OR (EQ s38 0) (EQ s67 0)) (EQ s18 1) (EQ s68 1)), p0:(AND (EQ s38 1) (EQ s67 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 127 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-01 finished in 359 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((p0&&X(G(p1)))) U (X(G(p2)) U (p0&&X(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 78 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 78 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 74 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 72 transition count 97
Applied a total of 24 rules in 8 ms. Remains 72 /84 variables (removed 12) and now considering 97/109 (removed 12) transitions.
// Phase 1: matrix 97 rows 72 cols
[2021-05-09 15:43:31] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:31] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 97 rows 72 cols
[2021-05-09 15:43:31] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:31] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-09 15:43:31] [INFO ] Implicit Places using invariants and state equation in 82 ms returned [71]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 123 ms to find 1 implicit places.
// Phase 1: matrix 97 rows 71 cols
[2021-05-09 15:43:31] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-09 15:43:31] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 71/84 places, 97/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 71 /71 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 71 cols
[2021-05-09 15:43:31] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:31] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 71/84 places, 97/109 transitions.
Stuttering acceptance computed with spot in 291 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p3)), true, (OR (NOT p3) (NOT p2) (NOT p0)), (OR (NOT p3) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p3)), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-02 automaton TGBA [mat=[[{ cond=(AND p0 (NOT p3) p1 p2), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={} source=0 dest: 6}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(AND p0 (NOT p3) p1 p2), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p3 p1 p2), acceptance={0} source=1 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=1 dest: 5}, { cond=(AND p0 (NOT p3) (NOT p1) p2), acceptance={0} source=1 dest: 6}, { cond=(AND p0 (NOT p3) p1 (NOT p2)), acceptance={0} source=1 dest: 7}, { cond=(OR (AND (NOT p0) p3 p2) (AND p3 (NOT p1) p2)), acceptance={0} source=1 dest: 8}, { cond=(AND p0 p3 p1 (NOT p2)), acceptance={0} source=1 dest: 9}], [{ cond=(AND p0 p1 p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=2 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 9}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p3 p2), acceptance={0} source=6 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 4}, { cond=(AND p0 (NOT p3) p1), acceptance={0} source=7 dest: 7}, { cond=(AND p0 p3 p1), acceptance={0} source=7 dest: 9}], [{ cond=(NOT p2), acceptance={} source=8 dest: 4}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p0 p1), acceptance={} source=9 dest: 9}]], initial=3, aps=[p0:(EQ s11 1), p3:(EQ s16 1), p1:(EQ s14 1), p2:(AND (EQ s58 1) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-02 finished in 556 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 78 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 78 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 74 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 71 transition count 96
Applied a total of 26 rules in 5 ms. Remains 71 /84 variables (removed 13) and now considering 96/109 (removed 13) transitions.
// Phase 1: matrix 96 rows 71 cols
[2021-05-09 15:43:32] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:32] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 96 rows 71 cols
[2021-05-09 15:43:32] [INFO ] Computed 2 place invariants in 8 ms
[2021-05-09 15:43:32] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-09 15:43:32] [INFO ] Implicit Places using invariants and state equation in 78 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
// Phase 1: matrix 96 rows 70 cols
[2021-05-09 15:43:32] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:32] [INFO ] Dead Transitions using invariants and state equation in 69 ms returned []
Starting structural reductions, iteration 1 : 70/84 places, 96/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 70 cols
[2021-05-09 15:43:32] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:32] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 70/84 places, 96/109 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-09a-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s42 0) (EQ s69 0)), p1:(OR (NEQ s18 1) (NEQ s69 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 289 ms.
Product exploration explored 100000 steps with 50000 reset in 237 ms.
Graph (complete) has 189 edges and 70 vertex of which 69 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 99 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 172 ms.
Product exploration explored 100000 steps with 50000 reset in 177 ms.
Applying partial POR strategy [true, true, false, true, true]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 70 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 70/70 places, 96/96 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 70 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 96
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 70 transition count 113
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 25 place count 64 transition count 101
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 31 place count 64 transition count 101
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 43 place count 52 transition count 77
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 55 place count 52 transition count 77
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 61 place count 46 transition count 71
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 67 place count 46 transition count 71
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 73 place count 40 transition count 59
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 79 place count 40 transition count 59
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 91 place count 28 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 103 place count 28 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 103 rules in 13 ms. Remains 28 /70 variables (removed 42) and now considering 41/96 (removed 55) transitions.
[2021-05-09 15:43:33] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:43:33] [INFO ] Flow matrix only has 37 transitions (discarded 4 similar events)
// Phase 1: matrix 37 rows 28 cols
[2021-05-09 15:43:33] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:33] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/70 places, 41/96 transitions.
Product exploration explored 100000 steps with 50000 reset in 300 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
[2021-05-09 15:43:34] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:43:34] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:43:34] [INFO ] Time to serialize gal into /tmp/LTL12487947981757635666.gal : 2 ms
[2021-05-09 15:43:34] [INFO ] Time to serialize properties into /tmp/LTL7456027649052086591.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/LTL12487947981757635666.gal, -t, CGAL, -LTL, /tmp/LTL7456027649052086591.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/LTL12487947981757635666.gal -t CGAL -LTL /tmp/LTL7456027649052086591.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((X("((p55==0)||(p91==0))"))||(G("((p22!=1)||(p91!=1))"))))
Formula 0 simplified : !(X"((p55==0)||(p91==0))" | G"((p22!=1)||(p91!=1))")
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t32, t35, t37, t39, t41, t43, t87, t88, t96, t97, t99, t100, t102, t103, t105, t106, t107, t108, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/76/20/96
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
429 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,4.30533,127256,1,0,140,549923,221,91,2170,713748,209
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-09a-03 finished in 10495 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p1 U G(p2))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 84 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 79 transition count 104
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 74 transition count 99
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 72 transition count 97
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 0 with 2 rules applied. Total rules applied 26 place count 71 transition count 96
Applied a total of 26 rules in 12 ms. Remains 71 /84 variables (removed 13) and now considering 96/109 (removed 13) transitions.
// Phase 1: matrix 96 rows 71 cols
[2021-05-09 15:43:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:42] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 96 rows 71 cols
[2021-05-09 15:43:42] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:42] [INFO ] State equation strengthened by 66 read => feed constraints.
[2021-05-09 15:43:42] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [70]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 122 ms to find 1 implicit places.
[2021-05-09 15:43:42] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 70 cols
[2021-05-09 15:43:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:42] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Starting structural reductions, iteration 1 : 70/84 places, 96/109 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 4 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 32 rules applied. Total rules applied 32 place count 54 transition count 80
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 49 transition count 70
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 49 transition count 70
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 44 transition count 60
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 44 transition count 60
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 39 transition count 55
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 39 transition count 55
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 35 transition count 47
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 35 transition count 47
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 31 transition count 43
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 31 transition count 43
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 31 transition count 43
Applied a total of 80 rules in 18 ms. Remains 31 /70 variables (removed 39) and now considering 43/96 (removed 53) transitions.
[2021-05-09 15:43:42] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 31 cols
[2021-05-09 15:43:42] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2021-05-09 15:43:42] [INFO ] Flow matrix only has 37 transitions (discarded 6 similar events)
// Phase 1: matrix 37 rows 31 cols
[2021-05-09 15:43:42] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 15:43:42] [INFO ] State equation strengthened by 28 read => feed constraints.
[2021-05-09 15:43:42] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 31/84 places, 43/109 transitions.
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-09a-04 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s13 0) (EQ s8 1) (EQ s30 1) (OR (EQ s23 0) (EQ s30 0))), p2:(EQ s13 1), p1:(AND (EQ s21 1) (EQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-04 finished in 386 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 94 edges and 81 vertex of which 36 / 81 are part of one of the 18 SCC in 2 ms
Free SCC test removed 18 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 63 transition count 86
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 65 place count 41 transition count 68
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 69 place count 37 transition count 60
Iterating global reduction 2 with 4 rules applied. Total rules applied 73 place count 37 transition count 60
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 37 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 36 transition count 59
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 80 place count 31 transition count 49
Iterating global reduction 4 with 5 rules applied. Total rules applied 85 place count 31 transition count 49
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 86 place count 31 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 87 place count 30 transition count 48
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 93 place count 24 transition count 36
Iterating global reduction 6 with 6 rules applied. Total rules applied 99 place count 24 transition count 36
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 100 place count 24 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 101 place count 23 transition count 35
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 108 place count 16 transition count 25
Iterating global reduction 8 with 7 rules applied. Total rules applied 115 place count 16 transition count 25
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 118 place count 13 transition count 20
Iterating global reduction 8 with 3 rules applied. Total rules applied 121 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 123 place count 11 transition count 17
Iterating global reduction 8 with 2 rules applied. Total rules applied 125 place count 11 transition count 17
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 126 place count 10 transition count 16
Iterating global reduction 8 with 1 rules applied. Total rules applied 127 place count 10 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 131 place count 8 transition count 14
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 132 place count 8 transition count 13
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 133 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 134 place count 6 transition count 11
Applied a total of 134 rules in 18 ms. Remains 6 /84 variables (removed 78) and now considering 11/109 (removed 98) transitions.
[2021-05-09 15:43:43] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:43:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:43:43] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 15:43:43] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:43:43] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:43:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:43:43] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
[2021-05-09 15:43:43] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:43:43] [INFO ] Flow matrix only has 8 transitions (discarded 3 similar events)
// Phase 1: matrix 8 rows 6 cols
[2021-05-09 15:43:43] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:43:43] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 6/84 places, 11/109 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s0 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 0 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-06 finished in 82 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(F((p1||G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 78 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 78 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 74 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 74 transition count 99
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 71 transition count 96
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 71 transition count 96
Applied a total of 26 rules in 2 ms. Remains 71 /84 variables (removed 13) and now considering 96/109 (removed 13) transitions.
// Phase 1: matrix 96 rows 71 cols
[2021-05-09 15:43:43] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:43] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 96 rows 71 cols
[2021-05-09 15:43:43] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:43] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-09 15:43:43] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 71 cols
[2021-05-09 15:43:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 71/84 places, 96/109 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s24 1) (NEQ s70 1)), p1:(AND (NEQ s18 0) (NEQ s69 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 405 steps with 4 reset in 1 ms.
FORMULA DiscoveryGPU-PT-09a-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-07 finished in 247 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F(((!p0 U p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 77 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 72 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 69 transition count 94
Applied a total of 30 rules in 3 ms. Remains 69 /84 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:43] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:43] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:43] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:43] [INFO ] Implicit Places using invariants and state equation in 63 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 93 ms to find 1 implicit places.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:43] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 68/84 places, 94/109 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:43] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:43] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 68/84 places, 94/109 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(NEQ s34 1), p2:(EQ s41 1), p1:(AND (OR (NEQ s28 1) (NEQ s67 1)) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Graph (complete) has 186 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, (NOT p2), p1]
Stuttering acceptance computed with spot in 99 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 101 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1))]
Support contains 4 out of 68 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 68/68 places, 94/94 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 68 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 94
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 19 place count 68 transition count 111
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 27 place count 60 transition count 95
Deduced a syphon composed of 19 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 35 place count 60 transition count 95
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 49 place count 46 transition count 67
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 63 place count 46 transition count 67
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 68 place count 41 transition count 62
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 73 place count 41 transition count 62
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 78 place count 36 transition count 52
Deduced a syphon composed of 11 places in 1 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 83 place count 36 transition count 52
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 93 place count 26 transition count 37
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 103 place count 26 transition count 37
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 103 rules in 7 ms. Remains 26 /68 variables (removed 42) and now considering 37/94 (removed 57) transitions.
[2021-05-09 15:43:44] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:43:44] [INFO ] Flow matrix only has 34 transitions (discarded 3 similar events)
// Phase 1: matrix 34 rows 26 cols
[2021-05-09 15:43:44] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:43:44] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 26/68 places, 37/94 transitions.
Product exploration explored 100000 steps with 50000 reset in 187 ms.
Product exploration explored 100000 steps with 50000 reset in 197 ms.
[2021-05-09 15:43:45] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:43:45] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:43:45] [INFO ] Time to serialize gal into /tmp/LTL10695800896088406382.gal : 2 ms
[2021-05-09 15:43:45] [INFO ] Time to serialize properties into /tmp/LTL15328258248417290362.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/LTL10695800896088406382.gal, -t, CGAL, -LTL, /tmp/LTL15328258248417290362.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/LTL10695800896088406382.gal -t CGAL -LTL /tmp/LTL15328258248417290362.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p46!=1)")||(X(F(("(((p37!=1)||(p91!=1))&&(p46!=1))")&&(("(p46==1)")U("(p56==1)"))))))))
Formula 0 simplified : !X("(p46!=1)" | XF("(((p37!=1)||(p91!=1))&&(p46!=1))" & ("(p46==1)" U "(p56==1)")))
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t32, t34, t35, t37, t39, t41, t43, t96, t97, t99, t100, t102, t103, t105, t106, t107, t108, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/19/94
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
240 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,2.40453,82008,1,0,136,322446,208,90,2101,420496,199
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-09a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-09a-09 finished in 4386 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 77 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 72 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 69 transition count 94
Applied a total of 30 rules in 4 ms. Remains 69 /84 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:54] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:54] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:54] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [68]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 148 ms to find 1 implicit places.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:54] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 68/84 places, 94/109 transitions.
Applied a total of 0 rules in 0 ms. Remains 68 /68 variables (removed 0) and now considering 94/94 (removed 0) transitions.
// Phase 1: matrix 94 rows 68 cols
[2021-05-09 15:43:54] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:43:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 2 iterations. Remains : 68/84 places, 94/109 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-09a-12 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-12 finished in 7099 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 78 transition count 103
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 78 transition count 103
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 74 transition count 99
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 74 transition count 99
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 72 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 72 transition count 97
Applied a total of 24 rules in 3 ms. Remains 72 /84 variables (removed 12) and now considering 97/109 (removed 12) transitions.
// Phase 1: matrix 97 rows 72 cols
[2021-05-09 15:43:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:54] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 97 rows 72 cols
[2021-05-09 15:43:54] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 15:43:54] [INFO ] State equation strengthened by 65 read => feed constraints.
[2021-05-09 15:43:54] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
// Phase 1: matrix 97 rows 72 cols
[2021-05-09 15:43:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 72/84 places, 97/109 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-13 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s61 1) (EQ s70 1)), p0:(AND (EQ s11 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-13 finished in 229 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 93 edges and 81 vertex of which 36 / 81 are part of one of the 18 SCC in 0 ms
Free SCC test removed 18 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 63 transition count 86
Reduce places removed 22 places and 0 transitions.
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 41 rules applied. Total rules applied 66 place count 41 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 40 transition count 67
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 71 place count 36 transition count 59
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 36 transition count 59
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 36 transition count 58
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 77 place count 35 transition count 58
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 82 place count 30 transition count 48
Iterating global reduction 5 with 5 rules applied. Total rules applied 87 place count 30 transition count 48
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 88 place count 30 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 89 place count 29 transition count 47
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 95 place count 23 transition count 35
Iterating global reduction 7 with 6 rules applied. Total rules applied 101 place count 23 transition count 35
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 1 rules applied. Total rules applied 102 place count 23 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 103 place count 22 transition count 34
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 110 place count 15 transition count 24
Iterating global reduction 9 with 7 rules applied. Total rules applied 117 place count 15 transition count 24
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 120 place count 12 transition count 19
Iterating global reduction 9 with 3 rules applied. Total rules applied 123 place count 12 transition count 19
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 125 place count 10 transition count 16
Iterating global reduction 9 with 2 rules applied. Total rules applied 127 place count 10 transition count 16
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 128 place count 9 transition count 15
Iterating global reduction 9 with 1 rules applied. Total rules applied 129 place count 9 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 133 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 134 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 135 place count 6 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 136 place count 5 transition count 10
Applied a total of 136 rules in 8 ms. Remains 5 /84 variables (removed 79) and now considering 10/109 (removed 99) transitions.
[2021-05-09 15:43:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:43:55] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:43:55] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-09 15:43:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:43:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:43:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:43:55] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-09 15:43:55] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:43:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 15:43:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:43:55] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/84 places, 10/109 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-09a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-09a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-09a-14 finished in 116 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0&&X((p0 U (G(p0)||p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 84/84 places, 109/109 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 77 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 77 transition count 102
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 72 transition count 97
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 72 transition count 97
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 69 transition count 94
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 69 transition count 94
Applied a total of 30 rules in 2 ms. Remains 69 /84 variables (removed 15) and now considering 94/109 (removed 15) transitions.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:55] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:55] [INFO ] State equation strengthened by 64 read => feed constraints.
[2021-05-09 15:43:55] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
// Phase 1: matrix 94 rows 69 cols
[2021-05-09 15:43:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:43:55] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 69/84 places, 94/109 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-09a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s55 1), p1:(OR (NEQ s43 1) (NEQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32713 reset in 160 ms.
Product exploration explored 100000 steps with 32716 reset in 292 ms.
Graph (complete) has 216 edges and 69 vertex of which 68 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 32896 reset in 158 ms.
Product exploration explored 100000 steps with 32724 reset in 216 ms.
[2021-05-09 15:43:56] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:43:56] [INFO ] Flatten gal took : 4 ms
[2021-05-09 15:43:56] [INFO ] Time to serialize gal into /tmp/LTL11558998076133464820.gal : 1 ms
[2021-05-09 15:43:56] [INFO ] Time to serialize properties into /tmp/LTL4154626625901660287.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/LTL11558998076133464820.gal, -t, CGAL, -LTL, /tmp/LTL4154626625901660287.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/LTL11558998076133464820.gal -t CGAL -LTL /tmp/LTL4154626625901660287.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F(("(p76!=1)")&&(X(("(p76!=1)")U(("((p58!=1)||(p92!=1))")||(G("(p76!=1)")))))))))
Formula 0 simplified : !GF("(p76!=1)" & X("(p76!=1)" U ("((p58!=1)||(p92!=1))" | G"(p76!=1)")))
Reverse transition relation is NOT exact ! Due to transitions t28, t30, t32, t34, t35, t37, t39, t41, t43, t96, t97, t99, t100, t102, t103, t105, t106, t107, t108, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/75/19/94
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 transitions explored
5 items max in DFS search stack
116 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.16865,48664,1,0,164,161253,222,118,2229,206030,286
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-09a-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-09a-15 finished in 2528 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620575038521

--------------------
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="DiscoveryGPU-PT-09a"
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 DiscoveryGPU-PT-09a, 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 r083-tall-162048875200285"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-09a.tgz
mv DiscoveryGPU-PT-09a 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 ;