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-162048875300332.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-12a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875300332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 99K 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:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 22 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 22 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 43K 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-12a-00
FORMULA_NAME DiscoveryGPU-PT-12a-01
FORMULA_NAME DiscoveryGPU-PT-12a-02
FORMULA_NAME DiscoveryGPU-PT-12a-03
FORMULA_NAME DiscoveryGPU-PT-12a-04
FORMULA_NAME DiscoveryGPU-PT-12a-05
FORMULA_NAME DiscoveryGPU-PT-12a-06
FORMULA_NAME DiscoveryGPU-PT-12a-07
FORMULA_NAME DiscoveryGPU-PT-12a-08
FORMULA_NAME DiscoveryGPU-PT-12a-09
FORMULA_NAME DiscoveryGPU-PT-12a-10
FORMULA_NAME DiscoveryGPU-PT-12a-11
FORMULA_NAME DiscoveryGPU-PT-12a-12
FORMULA_NAME DiscoveryGPU-PT-12a-13
FORMULA_NAME DiscoveryGPU-PT-12a-14
FORMULA_NAME DiscoveryGPU-PT-12a-15

=== Now, execution of the tool begins

BK_START 1620578734155

Running Version 0
[2021-05-09 16:45:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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 16:45:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 16:45:35] [INFO ] Load time of PNML (sax parser for PT used): 45 ms
[2021-05-09 16:45:35] [INFO ] Transformed 123 places.
[2021-05-09 16:45:35] [INFO ] Transformed 169 transitions.
[2021-05-09 16:45:35] [INFO ] Found NUPN structural information;
[2021-05-09 16:45:35] [INFO ] Parsed PT model containing 123 places and 169 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 16:45:35] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-12a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-12a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 123 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 123/123 places, 169/169 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 116 transition count 162
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 116 transition count 162
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 111 transition count 157
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 111 transition count 157
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 108 transition count 151
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 108 transition count 151
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 39 place count 108 transition count 142
Applied a total of 39 rules in 29 ms. Remains 108 /123 variables (removed 15) and now considering 142/169 (removed 27) transitions.
// Phase 1: matrix 142 rows 108 cols
[2021-05-09 16:45:36] [INFO ] Computed 2 place invariants in 11 ms
[2021-05-09 16:45:36] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 142 rows 108 cols
[2021-05-09 16:45:36] [INFO ] Computed 2 place invariants in 16 ms
[2021-05-09 16:45:36] [INFO ] State equation strengthened by 91 read => feed constraints.
[2021-05-09 16:45:36] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 108 cols
[2021-05-09 16:45:36] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:45:36] [INFO ] Dead Transitions using invariants and state equation in 117 ms returned []
Finished structural reductions, in 1 iterations. Remains : 108/123 places, 142/169 transitions.
[2021-05-09 16:45:36] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 16:45:36] [INFO ] Flatten gal took : 33 ms
FORMULA DiscoveryGPU-PT-12a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 16:45:36] [INFO ] Flatten gal took : 14 ms
[2021-05-09 16:45:36] [INFO ] Input system was already deterministic with 142 transitions.
Incomplete random walk after 100000 steps, including 770 resets, run finished after 336 ms. (steps per millisecond=297 ) properties (out of 19) seen :18
Running SMT prover for 1 properties.
// Phase 1: matrix 142 rows 108 cols
[2021-05-09 16:45:37] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:45:37] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 16:45:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 16:45:37] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-09 16:45:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 16:45:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2021-05-09 16:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 16:45:37] [INFO ] [Nat]Absence check using state equation in 26 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 103 transition count 137
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 103 transition count 137
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 99 transition count 133
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 99 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 96 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 96 transition count 130
Applied a total of 24 rules in 14 ms. Remains 96 /108 variables (removed 12) and now considering 130/142 (removed 12) transitions.
// Phase 1: matrix 130 rows 96 cols
[2021-05-09 16:45:37] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:45:37] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 130 rows 96 cols
[2021-05-09 16:45:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:45:37] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 16:45:37] [INFO ] Implicit Places using invariants and state equation in 124 ms returned [95]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 215 ms to find 1 implicit places.
// Phase 1: matrix 130 rows 95 cols
[2021-05-09 16:45:37] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:45:37] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 95/108 places, 130/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 95 /95 variables (removed 0) and now considering 130/130 (removed 0) transitions.
// Phase 1: matrix 130 rows 95 cols
[2021-05-09 16:45:37] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:45:37] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
Finished structural reductions, in 2 iterations. Remains : 95/108 places, 130/142 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s27 1)), p1:(EQ s51 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 115 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-12a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-00 finished in 667 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 121 edges and 105 vertex of which 46 / 105 are part of one of the 23 SCC in 3 ms
Free SCC test removed 23 places
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 82 transition count 111
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 86 place count 52 transition count 88
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 44 transition count 72
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 44 transition count 72
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 103 place count 44 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 104 place count 43 transition count 71
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 112 place count 35 transition count 55
Iterating global reduction 4 with 8 rules applied. Total rules applied 120 place count 35 transition count 55
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 121 place count 35 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 122 place count 34 transition count 54
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 131 place count 25 transition count 36
Iterating global reduction 6 with 9 rules applied. Total rules applied 140 place count 25 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 141 place count 25 transition count 35
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 142 place count 24 transition count 35
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 152 place count 14 transition count 22
Iterating global reduction 8 with 10 rules applied. Total rules applied 162 place count 14 transition count 22
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 165 place count 11 transition count 17
Iterating global reduction 8 with 3 rules applied. Total rules applied 168 place count 11 transition count 17
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 170 place count 9 transition count 14
Iterating global reduction 8 with 2 rules applied. Total rules applied 172 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 173 place count 8 transition count 13
Iterating global reduction 8 with 1 rules applied. Total rules applied 174 place count 8 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 176 place count 7 transition count 12
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 177 place count 7 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 178 place count 6 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 179 place count 5 transition count 9
Applied a total of 179 rules in 38 ms. Remains 5 /108 variables (removed 103) and now considering 9/142 (removed 133) transitions.
[2021-05-09 16:45:37] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:45:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:45:37] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 16:45:37] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:45:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:45:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:45:37] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-09 16:45:37] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:45:37] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:45:37] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:45:37] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/108 places, 9/142 transitions.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-01 finished in 102 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X((G(p1)||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 101 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 101 transition count 135
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 96 transition count 130
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 96 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 93 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 93 transition count 127
Applied a total of 30 rules in 22 ms. Remains 93 /108 variables (removed 15) and now considering 127/142 (removed 15) transitions.
// Phase 1: matrix 127 rows 93 cols
[2021-05-09 16:45:37] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:45:38] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 127 rows 93 cols
[2021-05-09 16:45:38] [INFO ] Computed 2 place invariants in 3 ms
[2021-05-09 16:45:38] [INFO ] State equation strengthened by 86 read => feed constraints.
[2021-05-09 16:45:38] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 129 ms to find 1 implicit places.
// Phase 1: matrix 127 rows 92 cols
[2021-05-09 16:45:38] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:45:38] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Starting structural reductions, iteration 1 : 92/108 places, 127/142 transitions.
Applied a total of 0 rules in 11 ms. Remains 92 /92 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 92 cols
[2021-05-09 16:45:38] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:45:38] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Finished structural reductions, in 2 iterations. Remains : 92/108 places, 127/142 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-12a-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (EQ s12 0) (EQ s5 1)), p0:(AND (EQ s54 0) (EQ s17 1)), p1:(OR (EQ s53 0) (EQ s43 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 373 ms.
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Graph (complete) has 250 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p2, (NOT p0), p1]
Stuttering acceptance computed with spot in 109 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Support contains 6 out of 92 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 92/92 places, 127/127 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 92 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 127
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 92 transition count 148
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 31 place count 84 transition count 132
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 39 place count 84 transition count 132
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 55 place count 68 transition count 100
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 71 place count 68 transition count 100
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 79 place count 60 transition count 92
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 87 place count 60 transition count 92
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 94 place count 53 transition count 78
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 0 with 7 rules applied. Total rules applied 101 place count 53 transition count 78
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 115 place count 39 transition count 57
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 129 place count 39 transition count 57
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 129 rules in 14 ms. Remains 39 /92 variables (removed 53) and now considering 57/127 (removed 70) transitions.
[2021-05-09 16:45:39] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:45:39] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
// Phase 1: matrix 52 rows 39 cols
[2021-05-09 16:45:39] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:45:39] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/92 places, 57/127 transitions.
Product exploration explored 100000 steps with 50000 reset in 238 ms.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
[2021-05-09 16:45:40] [INFO ] Flatten gal took : 8 ms
[2021-05-09 16:45:40] [INFO ] Flatten gal took : 8 ms
[2021-05-09 16:45:40] [INFO ] Time to serialize gal into /tmp/LTL8504009729098541264.gal : 3 ms
[2021-05-09 16:45:40] [INFO ] Time to serialize properties into /tmp/LTL10296435466034099124.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/LTL8504009729098541264.gal, -t, CGAL, -LTL, /tmp/LTL10296435466034099124.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/LTL8504009729098541264.gal -t CGAL -LTL /tmp/LTL10296435466034099124.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((X((G("((p71==0)||(p58==1))"))||(F("((p15==0)||(p5==1))"))))||("((p72==0)&&(p20==1))"))))
Formula 0 simplified : !X("((p72==0)&&(p20==1))" | X(G"((p71==0)||(p58==1))" | F"((p15==0)||(p5==1))"))
Detected timeout of ITS tools.
[2021-05-09 16:45:55] [INFO ] Flatten gal took : 7 ms
[2021-05-09 16:45:55] [INFO ] Applying decomposition
[2021-05-09 16:45:55] [INFO ] Flatten gal took : 6 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/graph5124385193445127636.txt, -o, /tmp/graph5124385193445127636.bin, -w, /tmp/graph5124385193445127636.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/graph5124385193445127636.bin, -l, -1, -v, -w, /tmp/graph5124385193445127636.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:45:55] [INFO ] Decomposing Gal with order
[2021-05-09 16:45:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:45:55] [INFO ] Removed a total of 68 redundant transitions.
[2021-05-09 16:45:55] [INFO ] Flatten gal took : 33 ms
[2021-05-09 16:45:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 86 labels/synchronizations in 7 ms.
[2021-05-09 16:45:55] [INFO ] Time to serialize gal into /tmp/LTL1539004365304861926.gal : 4 ms
[2021-05-09 16:45:55] [INFO ] Time to serialize properties into /tmp/LTL14924026359412187434.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/LTL1539004365304861926.gal, -t, CGAL, -LTL, /tmp/LTL14924026359412187434.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/LTL1539004365304861926.gal -t CGAL -LTL /tmp/LTL14924026359412187434.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X((X((G("((i9.u15.p71==0)||(i7.u12.p58==1))"))||(F("((i2.u3.p15==0)||(i1.u1.p5==1))"))))||("((i9.u15.p72==0)&&(i2.u4.p20==1))"))))
Formula 0 simplified : !X("((i9.u15.p72==0)&&(i2.u4.p20==1))" | X(G"((i9.u15.p71==0)||(i7.u12.p58==1))" | F"((i2.u3.p15==0)||(i1.u1.p5==1))"))
Reverse transition relation is NOT exact ! Due to transitions t35, t41, t45, t47, t50, t52, t54, t56, i0.t48, i0.t37, i0.u0.t135, i0.u5.t136, i0.u20.t126, i1.u1.t134, i2.u3.t132, i4.u7.t130, i4.u24.t125, i6.u9.t137, i7.u11.t129, i8.u13.t138, i9.u15.t128, i9.u16.t127, i10.u18.t140, i12.u22.t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/69/24/93
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
24 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.255494,25168,1,0,25819,1015,937,21905,226,2652,30186
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-12a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DiscoveryGPU-PT-12a-02 finished in 17994 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 122 edges and 105 vertex of which 48 / 105 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 81 transition count 112
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 85 place count 52 transition count 88
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 92 place count 45 transition count 74
Iterating global reduction 2 with 7 rules applied. Total rules applied 99 place count 45 transition count 74
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 100 place count 45 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 44 transition count 73
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 109 place count 36 transition count 57
Iterating global reduction 4 with 8 rules applied. Total rules applied 117 place count 36 transition count 57
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 125 place count 28 transition count 41
Iterating global reduction 4 with 8 rules applied. Total rules applied 133 place count 28 transition count 41
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 141 place count 20 transition count 32
Iterating global reduction 4 with 8 rules applied. Total rules applied 149 place count 20 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 150 place count 19 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 151 place count 19 transition count 31
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 163 place count 13 transition count 25
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 165 place count 11 transition count 21
Iterating global reduction 4 with 2 rules applied. Total rules applied 167 place count 11 transition count 21
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 169 place count 9 transition count 15
Iterating global reduction 4 with 2 rules applied. Total rules applied 171 place count 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 173 place count 7 transition count 13
Iterating global reduction 4 with 2 rules applied. Total rules applied 175 place count 7 transition count 13
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 176 place count 7 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 177 place count 6 transition count 11
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 5 transition count 10
Applied a total of 178 rules in 10 ms. Remains 5 /108 variables (removed 103) and now considering 10/142 (removed 132) transitions.
[2021-05-09 16:45:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:45:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:45:55] [INFO ] Implicit Places using invariants in 5 ms returned []
[2021-05-09 16:45:55] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:45:55] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 16:45:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:45:56] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2021-05-09 16:45:56] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 16:45:56] [INFO ] Flow matrix only has 7 transitions (discarded 3 similar events)
// Phase 1: matrix 7 rows 5 cols
[2021-05-09 16:45:56] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:45:56] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/108 places, 10/142 transitions.
Stuttering acceptance computed with spot in 35 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-03 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}]], initial=1, aps=[p0:(NEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-03 finished in 104 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&(G(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 100 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 100 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 94 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 94 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 90 transition count 124
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 90 transition count 124
Applied a total of 36 rules in 5 ms. Remains 90 /108 variables (removed 18) and now considering 124/142 (removed 18) transitions.
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:45:56] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 16:45:56] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:45:56] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:45:56] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:45:56] [INFO ] Implicit Places using invariants and state equation in 86 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 120 ms to find 1 implicit places.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:45:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:45:56] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Starting structural reductions, iteration 1 : 89/108 places, 124/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:45:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:45:56] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 2 iterations. Remains : 89/108 places, 124/142 transitions.
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-12a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s74 0) (EQ s58 1)), p1:(OR (EQ s54 0) (EQ s40 1)), p2:(OR (EQ s54 0) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [p0, p1, p2]
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Product exploration explored 100000 steps with 50000 reset in 203 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 78 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Support contains 4 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 89/89 places, 124/124 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 89 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 89 transition count 124
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 22 place count 89 transition count 144
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 30 place count 81 transition count 128
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 38 place count 81 transition count 128
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 54 place count 65 transition count 96
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 70 place count 65 transition count 96
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 78 place count 57 transition count 88
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 86 place count 57 transition count 88
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 94 place count 49 transition count 72
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 102 place count 49 transition count 72
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 118 place count 33 transition count 48
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 0 with 16 rules applied. Total rules applied 134 place count 33 transition count 48
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 134 rules in 10 ms. Remains 33 /89 variables (removed 56) and now considering 48/124 (removed 76) transitions.
[2021-05-09 16:45:57] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:45:57] [INFO ] Flow matrix only has 45 transitions (discarded 3 similar events)
// Phase 1: matrix 45 rows 33 cols
[2021-05-09 16:45:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:45:57] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/89 places, 48/124 transitions.
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Product exploration explored 100000 steps with 50000 reset in 320 ms.
[2021-05-09 16:45:58] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:45:58] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:45:58] [INFO ] Time to serialize gal into /tmp/LTL14547110946651891465.gal : 2 ms
[2021-05-09 16:45:58] [INFO ] Time to serialize properties into /tmp/LTL16977726584694390504.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/LTL14547110946651891465.gal, -t, CGAL, -LTL, /tmp/LTL16977726584694390504.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/LTL14547110946651891465.gal -t CGAL -LTL /tmp/LTL16977726584694390504.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((p104==0)||(p79==1))")&&(("((p75==0)||(p55==1))")||(G("((p75==0)||(p55==1))")))))))
Formula 0 simplified : !XF("((p104==0)||(p79==1))" & ("((p75==0)||(p55==1))" | G"((p75==0)||(p55==1))"))
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t41, t43, t45, t47, t48, t50, t52, t54, t56, t125, t126, t127, t129, t130, t132, t134, t135, t136, t137, t138, t140, t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/99/25/124
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
1191 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,11.9286,290900,1,0,175,1.34016e+06,279,117,2766,1.7925e+06,261
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-12a-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-12a-05 finished in 15689 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 100 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 100 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 94 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 94 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 90 transition count 124
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 90 transition count 124
Applied a total of 36 rules in 3 ms. Remains 90 /108 variables (removed 18) and now considering 124/142 (removed 18) transitions.
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:46:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:46:11] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:46:11] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:46:11] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:46:11] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 133 ms to find 1 implicit places.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:46:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:46:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 89/108 places, 124/142 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:46:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:46:11] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 89/108 places, 124/142 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-06 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:(OR (EQ s42 0) (EQ s71 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 166 ms.
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Graph (complete) has 246 edges and 89 vertex of which 88 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 155 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 89 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 89/89 places, 124/124 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 89 transition count 124
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 89 transition count 124
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 24 places in 1 ms
Iterating global reduction 0 with 23 rules applied. Total rules applied 24 place count 89 transition count 146
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 35 place count 78 transition count 124
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 11 rules applied. Total rules applied 46 place count 78 transition count 124
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 68 place count 56 transition count 80
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 90 place count 56 transition count 80
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 100 place count 46 transition count 70
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 110 place count 46 transition count 70
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 119 place count 37 transition count 52
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 128 place count 37 transition count 52
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 146 place count 19 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 164 place count 19 transition count 25
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 164 rules in 13 ms. Remains 19 /89 variables (removed 70) and now considering 25/124 (removed 99) transitions.
[2021-05-09 16:46:13] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:46:13] [INFO ] Flow matrix only has 24 transitions (discarded 1 similar events)
// Phase 1: matrix 24 rows 19 cols
[2021-05-09 16:46:13] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:46:13] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 19/89 places, 25/124 transitions.
Product exploration explored 100000 steps with 33333 reset in 231 ms.
Product exploration explored 100000 steps with 33333 reset in 241 ms.
[2021-05-09 16:46:13] [INFO ] Flatten gal took : 6 ms
[2021-05-09 16:46:13] [INFO ] Flatten gal took : 5 ms
[2021-05-09 16:46:13] [INFO ] Time to serialize gal into /tmp/LTL13434110012301897333.gal : 1 ms
[2021-05-09 16:46:13] [INFO ] Time to serialize properties into /tmp/LTL1425134319208866098.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/LTL13434110012301897333.gal, -t, CGAL, -LTL, /tmp/LTL1425134319208866098.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/LTL13434110012301897333.gal -t CGAL -LTL /tmp/LTL1425134319208866098.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p57==0)||(p98==1))")))))
Formula 0 simplified : !XXF"((p57==0)||(p98==1))"
Reverse transition relation is NOT exact ! Due to transitions t35, t37, t39, t41, t43, t45, t47, t48, t50, t52, t54, t56, t125, t126, t127, t129, t130, t132, t134, t135, t136, t137, t138, t140, t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/99/25/124
Computing Next relation with stutter on 1 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1287 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,12.8877,290948,1,0,176,1.34037e+06,274,118,2757,1.79256e+06,264
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-12a-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-12a-06 finished in 16300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], workingDir=/home/mcc/execution]
Support contains 4 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 102 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 102 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 16 place count 98 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 20 place count 98 transition count 132
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 95 transition count 129
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 95 transition count 129
Applied a total of 26 rules in 3 ms. Remains 95 /108 variables (removed 13) and now considering 129/142 (removed 13) transitions.
// Phase 1: matrix 129 rows 95 cols
[2021-05-09 16:46:28] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 16:46:28] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 129 rows 95 cols
[2021-05-09 16:46:28] [INFO ] Computed 2 place invariants in 7 ms
[2021-05-09 16:46:28] [INFO ] State equation strengthened by 87 read => feed constraints.
[2021-05-09 16:46:28] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
// Phase 1: matrix 129 rows 95 cols
[2021-05-09 16:46:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:46:28] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 1 iterations. Remains : 95/108 places, 129/142 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s94 0) (EQ s0 1)), p0:(OR (EQ s35 0) (EQ s11 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]]
Entered a terminal (fully accepting) state of product in 395 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-12a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-08 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 100 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 100 transition count 134
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 94 transition count 128
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 94 transition count 128
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 32 place count 90 transition count 124
Iterating global reduction 0 with 4 rules applied. Total rules applied 36 place count 90 transition count 124
Applied a total of 36 rules in 3 ms. Remains 90 /108 variables (removed 18) and now considering 124/142 (removed 18) transitions.
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:46:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 16:46:28] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 124 rows 90 cols
[2021-05-09 16:46:28] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 16:46:28] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:46:28] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [89]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 129 ms to find 1 implicit places.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:46:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:46:28] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 89/108 places, 124/142 transitions.
Applied a total of 0 rules in 0 ms. Remains 89 /89 variables (removed 0) and now considering 124/124 (removed 0) transitions.
// Phase 1: matrix 124 rows 89 cols
[2021-05-09 16:46:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:46:28] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 89/108 places, 124/142 transitions.
Stuttering acceptance computed with spot in 52 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s25 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 572 steps with 4 reset in 2 ms.
FORMULA DiscoveryGPU-PT-12a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-11 finished in 320 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 100 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 100 transition count 134
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 95 transition count 129
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 95 transition count 129
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 91 transition count 125
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 91 transition count 125
Applied a total of 34 rules in 4 ms. Remains 91 /108 variables (removed 17) and now considering 125/142 (removed 17) transitions.
// Phase 1: matrix 125 rows 91 cols
[2021-05-09 16:46:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:46:28] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 125 rows 91 cols
[2021-05-09 16:46:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 16:46:28] [INFO ] State equation strengthened by 85 read => feed constraints.
[2021-05-09 16:46:28] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 140 ms to find 1 implicit places.
// Phase 1: matrix 125 rows 90 cols
[2021-05-09 16:46:28] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:46:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 90/108 places, 125/142 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 125/125 (removed 0) transitions.
// Phase 1: matrix 125 rows 90 cols
[2021-05-09 16:46:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 16:46:28] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/108 places, 125/142 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-12a-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NEQ s71 0) (NEQ s17 1)), p1:(NEQ s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33209 reset in 160 ms.
Product exploration explored 100000 steps with 33212 reset in 217 ms.
Graph (complete) has 247 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 33194 reset in 196 ms.
Product exploration explored 100000 steps with 33289 reset in 200 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 90/90 places, 125/125 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 90 transition count 147
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 34 place count 80 transition count 127
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 44 place count 80 transition count 127
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 64 place count 60 transition count 87
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 84 place count 60 transition count 87
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 93 place count 51 transition count 78
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 102 place count 51 transition count 78
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 111 place count 42 transition count 60
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 120 place count 42 transition count 60
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 137 place count 25 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 154 place count 25 transition count 34
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 154 rules in 12 ms. Remains 25 /90 variables (removed 65) and now considering 34/125 (removed 91) transitions.
[2021-05-09 16:46:30] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:46:30] [INFO ] Flow matrix only has 32 transitions (discarded 2 similar events)
// Phase 1: matrix 32 rows 25 cols
[2021-05-09 16:46:30] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 16:46:30] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/90 places, 34/125 transitions.
Product exploration explored 100000 steps with 33343 reset in 309 ms.
Product exploration explored 100000 steps with 33384 reset in 280 ms.
[2021-05-09 16:46:30] [INFO ] Flatten gal took : 5 ms
[2021-05-09 16:46:30] [INFO ] Flatten gal took : 5 ms
[2021-05-09 16:46:30] [INFO ] Time to serialize gal into /tmp/LTL102958423972648134.gal : 1 ms
[2021-05-09 16:46:30] [INFO ] Time to serialize properties into /tmp/LTL11466992267575595359.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/LTL102958423972648134.gal, -t, CGAL, -LTL, /tmp/LTL11466992267575595359.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/LTL102958423972648134.gal -t CGAL -LTL /tmp/LTL11466992267575595359.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((p97!=0)&&(p20!=1))"))||(X(G("(p23!=1)"))))))
Formula 0 simplified : !G(F"((p97!=0)&&(p20!=1))" | XG"(p23!=1)")
Reverse transition relation is NOT exact ! Due to transitions t25, t31, t35, t37, t39, t41, t43, t45, t47, t50, t52, t54, t56, t125, t126, t127, t129, t130, t132, t134, t135, t136, t137, t138, t140, t141, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/99/26/125
Computing Next relation with stutter on 1 deadlock states
Detected timeout of ITS tools.
[2021-05-09 16:46:45] [INFO ] Flatten gal took : 5 ms
[2021-05-09 16:46:45] [INFO ] Applying decomposition
[2021-05-09 16:46:45] [INFO ] Flatten gal took : 5 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/graph14575662348498545091.txt, -o, /tmp/graph14575662348498545091.bin, -w, /tmp/graph14575662348498545091.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/graph14575662348498545091.bin, -l, -1, -v, -w, /tmp/graph14575662348498545091.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 16:46:45] [INFO ] Decomposing Gal with order
[2021-05-09 16:46:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 16:46:45] [INFO ] Removed a total of 66 redundant transitions.
[2021-05-09 16:46:45] [INFO ] Flatten gal took : 10 ms
[2021-05-09 16:46:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 83 labels/synchronizations in 3 ms.
[2021-05-09 16:46:45] [INFO ] Time to serialize gal into /tmp/LTL14252189195244823399.gal : 2 ms
[2021-05-09 16:46:45] [INFO ] Time to serialize properties into /tmp/LTL2752517121445819755.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/LTL14252189195244823399.gal, -t, CGAL, -LTL, /tmp/LTL2752517121445819755.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/LTL14252189195244823399.gal -t CGAL -LTL /tmp/LTL2752517121445819755.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("((i11.u20.p97!=0)&&(i2.u3.p20!=1))"))||(X(G("(i4.u4.p23!=1)"))))))
Formula 0 simplified : !G(F"((i11.u20.p97!=0)&&(i2.u3.p20!=1))" | XG"(i4.u4.p23!=1)")
Reverse transition relation is NOT exact ! Due to transitions t31, t35, t37, t41, t45, t47, t52, t54, t56, u8.t130, i0.u0.t134, i0.u9.t137, i2.u2.t132, i3.t39, i3.u7.t43, i3.u15.t127, i4.u4.t25, i4.u4.t135, i4.u5.t136, i7.u11.t129, i8.u13.t138, i10.u17.t140, i11.u19.t126, i12.u21.t141, i13.u23.t125, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/66/25/91
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
94 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.96403,48340,1,0,60390,5977,1162,153671,244,46760,57137
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-12a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DiscoveryGPU-PT-12a-14 finished in 18213 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0 U p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 108/108 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 120 edges and 105 vertex of which 48 / 105 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 81 transition count 113
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 83 place count 53 transition count 89
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 91 place count 45 transition count 73
Iterating global reduction 2 with 8 rules applied. Total rules applied 99 place count 45 transition count 73
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 100 place count 45 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 101 place count 44 transition count 72
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 109 place count 36 transition count 56
Iterating global reduction 4 with 8 rules applied. Total rules applied 117 place count 36 transition count 56
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 118 place count 36 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 119 place count 35 transition count 55
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 127 place count 27 transition count 39
Iterating global reduction 6 with 8 rules applied. Total rules applied 135 place count 27 transition count 39
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 136 place count 27 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 137 place count 26 transition count 38
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 146 place count 17 transition count 26
Iterating global reduction 8 with 9 rules applied. Total rules applied 155 place count 17 transition count 26
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 158 place count 14 transition count 21
Iterating global reduction 8 with 3 rules applied. Total rules applied 161 place count 14 transition count 21
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 163 place count 12 transition count 18
Iterating global reduction 8 with 2 rules applied. Total rules applied 165 place count 12 transition count 18
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 166 place count 11 transition count 17
Iterating global reduction 8 with 1 rules applied. Total rules applied 167 place count 11 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 169 place count 10 transition count 17
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 170 place count 10 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 171 place count 9 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 172 place count 8 transition count 14
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 173 place count 7 transition count 13
Applied a total of 173 rules in 13 ms. Remains 7 /108 variables (removed 101) and now considering 13/142 (removed 129) transitions.
[2021-05-09 16:46:46] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 16:46:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:46:46] [INFO ] Implicit Places using invariants in 6 ms returned []
[2021-05-09 16:46:46] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 16:46:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:46:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 16:46:46] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 17 ms to find 0 implicit places.
[2021-05-09 16:46:46] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 16:46:46] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 7 cols
[2021-05-09 16:46:46] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 16:46:46] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/108 places, 13/142 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-12a-15 automaton TGBA [mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s5 1)), p0:(AND (EQ s5 0) (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, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-12a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-12a-15 finished in 112 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620578809503

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-12a"
export BK_EXAMINATION="LTLCardinality"
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-12a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r083-tall-162048875300332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-12a.tgz
mv DiscoveryGPU-PT-12a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;