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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 112K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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 24K 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 16K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 22 17:58 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 25K 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-07a-00
FORMULA_NAME DiscoveryGPU-PT-07a-01
FORMULA_NAME DiscoveryGPU-PT-07a-02
FORMULA_NAME DiscoveryGPU-PT-07a-03
FORMULA_NAME DiscoveryGPU-PT-07a-04
FORMULA_NAME DiscoveryGPU-PT-07a-05
FORMULA_NAME DiscoveryGPU-PT-07a-06
FORMULA_NAME DiscoveryGPU-PT-07a-07
FORMULA_NAME DiscoveryGPU-PT-07a-08
FORMULA_NAME DiscoveryGPU-PT-07a-09
FORMULA_NAME DiscoveryGPU-PT-07a-10
FORMULA_NAME DiscoveryGPU-PT-07a-11
FORMULA_NAME DiscoveryGPU-PT-07a-12
FORMULA_NAME DiscoveryGPU-PT-07a-13
FORMULA_NAME DiscoveryGPU-PT-07a-14
FORMULA_NAME DiscoveryGPU-PT-07a-15

=== Now, execution of the tool begins

BK_START 1620572084142

Running Version 0
[2021-05-09 14:54:45] [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 14:54:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:54:46] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2021-05-09 14:54:46] [INFO ] Transformed 73 places.
[2021-05-09 14:54:46] [INFO ] Transformed 99 transitions.
[2021-05-09 14:54:46] [INFO ] Found NUPN structural information;
[2021-05-09 14:54:46] [INFO ] Parsed PT model containing 73 places and 99 transitions in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:54:46] [INFO ] Initial state test concluded for 4 properties.
FORMULA DiscoveryGPU-PT-07a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 99/99 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 97
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 97
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 70 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 70 transition count 96
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 13 place count 70 transition count 89
Applied a total of 13 rules in 41 ms. Remains 70 /73 variables (removed 3) and now considering 89/99 (removed 10) transitions.
// Phase 1: matrix 89 rows 70 cols
[2021-05-09 14:54:46] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 14:54:46] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 89 rows 70 cols
[2021-05-09 14:54:46] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 14:54:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2021-05-09 14:54:46] [INFO ] Implicit Places using invariants and state equation in 93 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 223 ms to find 1 implicit places.
// Phase 1: matrix 89 rows 69 cols
[2021-05-09 14:54:46] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:46] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
Starting structural reductions, iteration 1 : 69/73 places, 89/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 69 cols
[2021-05-09 14:54:46] [INFO ] Computed 1 place invariants in 5 ms
[2021-05-09 14:54:46] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 69/73 places, 89/99 transitions.
[2021-05-09 14:54:46] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 14:54:46] [INFO ] Flatten gal took : 29 ms
FORMULA DiscoveryGPU-PT-07a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-07a-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:54:46] [INFO ] Flatten gal took : 10 ms
[2021-05-09 14:54:46] [INFO ] Input system was already deterministic with 89 transitions.
Incomplete random walk after 100000 steps, including 1316 resets, run finished after 289 ms. (steps per millisecond=346 ) properties (out of 14) seen :12
Running SMT prover for 2 properties.
// Phase 1: matrix 89 rows 69 cols
[2021-05-09 14:54:47] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 14:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:54:47] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-09 14:54:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:54:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-09 14:54:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 14:54:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 14:54:47] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2021-05-09 14:54:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 14:54:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 71 edges and 67 vertex of which 26 / 67 are part of one of the 13 SCC in 2 ms
Free SCC test removed 13 places
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 54 transition count 67
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 35 rules applied. Total rules applied 58 place count 33 transition count 53
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 59 place count 32 transition count 53
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 62 place count 29 transition count 47
Iterating global reduction 3 with 3 rules applied. Total rules applied 65 place count 29 transition count 47
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 68 place count 26 transition count 41
Iterating global reduction 3 with 3 rules applied. Total rules applied 71 place count 26 transition count 41
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 73 place count 24 transition count 37
Iterating global reduction 3 with 2 rules applied. Total rules applied 75 place count 24 transition count 37
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 77 place count 22 transition count 35
Iterating global reduction 3 with 2 rules applied. Total rules applied 79 place count 22 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 89 place count 17 transition count 30
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 91 place count 15 transition count 26
Iterating global reduction 3 with 2 rules applied. Total rules applied 93 place count 15 transition count 26
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 94 place count 14 transition count 23
Iterating global reduction 3 with 1 rules applied. Total rules applied 95 place count 14 transition count 23
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 96 place count 13 transition count 22
Iterating global reduction 3 with 1 rules applied. Total rules applied 97 place count 13 transition count 22
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 3 with 2 rules applied. Total rules applied 99 place count 12 transition count 22
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 100 place count 11 transition count 19
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 11 transition count 19
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 102 place count 10 transition count 18
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 10 transition count 18
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 9 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 8 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 7 transition count 14
Applied a total of 107 rules in 26 ms. Remains 7 /69 variables (removed 62) and now considering 14/89 (removed 75) transitions.
[2021-05-09 14:54:47] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 7 cols
[2021-05-09 14:54:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:54:47] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 14:54:47] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 7 cols
[2021-05-09 14:54:47] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:54:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:54:47] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2021-05-09 14:54:47] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:54:47] [INFO ] Flow matrix only has 11 transitions (discarded 3 similar events)
// Phase 1: matrix 11 rows 7 cols
[2021-05-09 14:54:47] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:54:47] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/69 places, 14/89 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-01 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:(OR (EQ s5 0) (EQ s0 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 2 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-07a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-01 finished in 246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((X((p0&&G(p1)))||F(p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 89/89 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 60 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 60 transition count 80
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 58 transition count 78
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 58 transition count 78
Applied a total of 22 rules in 6 ms. Remains 58 /69 variables (removed 11) and now considering 78/89 (removed 11) transitions.
// Phase 1: matrix 78 rows 58 cols
[2021-05-09 14:54:47] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:47] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 78 rows 58 cols
[2021-05-09 14:54:47] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:47] [INFO ] State equation strengthened by 37 read => feed constraints.
[2021-05-09 14:54:47] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 58 cols
[2021-05-09 14:54:47] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:47] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Finished structural reductions, in 1 iterations. Remains : 58/69 places, 78/89 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-07a-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(OR (EQ s46 0) (EQ s13 1)), p0:(OR (EQ s0 0) (EQ s49 1)), p1:(AND (EQ s42 0) (EQ s21 1) (EQ s25 0))], 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24445 reset in 350 ms.
Stack based approach found an accepted trace after 1133 steps with 278 reset with depth 9 and stack size 9 in 4 ms.
FORMULA DiscoveryGPU-PT-07a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-02 finished in 770 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 89/89 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 60 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 60 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 57 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 57 transition count 77
Applied a total of 24 rules in 6 ms. Remains 57 /69 variables (removed 12) and now considering 77/89 (removed 12) transitions.
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:54:48] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:48] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:54:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:48] [INFO ] State equation strengthened by 37 read => feed constraints.
[2021-05-09 14:54:48] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:54:48] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/69 places, 77/89 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s12 0) (EQ s32 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][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Product exploration explored 100000 steps with 33333 reset in 186 ms.
Graph (complete) has 150 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 147 ms.
Product exploration explored 100000 steps with 33333 reset in 125 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 57/57 places, 77/77 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 57 transition count 77
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 77
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 16 place count 57 transition count 90
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 20 place count 53 transition count 82
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 24 place count 53 transition count 82
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 32 place count 45 transition count 66
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 45 transition count 66
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 44 place count 41 transition count 62
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 48 place count 41 transition count 62
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 37 transition count 54
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 37 transition count 54
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 64 place count 29 transition count 42
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 72 place count 29 transition count 42
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 72 rules in 13 ms. Remains 29 /57 variables (removed 28) and now considering 42/77 (removed 35) transitions.
[2021-05-09 14:54:49] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:54:49] [INFO ] Flow matrix only has 38 transitions (discarded 4 similar events)
// Phase 1: matrix 38 rows 29 cols
[2021-05-09 14:54:49] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/57 places, 42/77 transitions.
Product exploration explored 100000 steps with 33333 reset in 248 ms.
Product exploration explored 100000 steps with 33333 reset in 231 ms.
[2021-05-09 14:54:50] [INFO ] Flatten gal took : 5 ms
[2021-05-09 14:54:50] [INFO ] Flatten gal took : 6 ms
[2021-05-09 14:54:50] [INFO ] Time to serialize gal into /tmp/LTL5650544431030776297.gal : 2 ms
[2021-05-09 14:54:50] [INFO ] Time to serialize properties into /tmp/LTL91174017359453115.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/LTL5650544431030776297.gal, -t, CGAL, -LTL, /tmp/LTL91174017359453115.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/LTL5650544431030776297.gal -t CGAL -LTL /tmp/LTL91174017359453115.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X("((p15==0)||(p41==1))"))))
Formula 0 simplified : !XX"((p15==0)||(p41==1))"
Reverse transition relation is NOT exact ! Due to transitions t23, t27, t28, t30, t32, t34, t77, t79, t80, t81, t83, t84, t85, t87, t88, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/15/77
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
44 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.458748,29984,1,0,113,70921,174,75,1734,91239,168
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07a-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-07a-06 finished in 2291 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(F((p1||G(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 89/89 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 63 transition count 83
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 83
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 58 transition count 78
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 58 transition count 78
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 55 transition count 75
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 55 transition count 75
Applied a total of 28 rules in 5 ms. Remains 55 /69 variables (removed 14) and now considering 75/89 (removed 14) transitions.
// Phase 1: matrix 75 rows 55 cols
[2021-05-09 14:54:50] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:50] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 75 rows 55 cols
[2021-05-09 14:54:50] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:50] [INFO ] State equation strengthened by 36 read => feed constraints.
[2021-05-09 14:54:50] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 55 cols
[2021-05-09 14:54:50] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:50] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 55/69 places, 75/89 transitions.
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-07a-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s33 0) (EQ s37 1)), p1:(NEQ s33 1), p2:(OR (EQ s32 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 144 ms.
Graph (complete) has 147 edges and 55 vertex of which 54 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 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 50000 reset in 130 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 55 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 55/55 places, 75/75 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 55 transition count 86
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 18 place count 50 transition count 76
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 23 place count 50 transition count 76
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 33 place count 40 transition count 56
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 43 place count 40 transition count 56
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 48 place count 35 transition count 51
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 53 place count 35 transition count 51
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 57 place count 31 transition count 43
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 0 with 4 rules applied. Total rules applied 61 place count 31 transition count 43
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 69 place count 23 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 77 place count 23 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 77 rules in 8 ms. Remains 23 /55 variables (removed 32) and now considering 31/75 (removed 44) transitions.
[2021-05-09 14:54:51] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:54:51] [INFO ] Flow matrix only has 30 transitions (discarded 1 similar events)
// Phase 1: matrix 30 rows 23 cols
[2021-05-09 14:54:51] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:51] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/55 places, 31/75 transitions.
Product exploration explored 100000 steps with 50000 reset in 263 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
[2021-05-09 14:54:52] [INFO ] Flatten gal took : 11 ms
[2021-05-09 14:54:52] [INFO ] Flatten gal took : 14 ms
[2021-05-09 14:54:52] [INFO ] Time to serialize gal into /tmp/LTL2459779424933332124.gal : 2 ms
[2021-05-09 14:54:52] [INFO ] Time to serialize properties into /tmp/LTL8259654240159318033.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/LTL2459779424933332124.gal, -t, CGAL, -LTL, /tmp/LTL8259654240159318033.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/LTL2459779424933332124.gal -t CGAL -LTL /tmp/LTL8259654240159318033.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((G("((p44==0)||(p48==1))"))||(X(F(("(p44!=1)")||(G(F("((p43==0)||(p9==1))"))))))))
Formula 0 simplified : !(G"((p44==0)||(p48==1))" | XF("(p44!=1)" | GF"((p43==0)||(p9==1))"))
Reverse transition relation is NOT exact ! Due to transitions t7, t19, t23, t27, t28, t30, t32, t34, t77, t79, t81, t83, t84, t85, t87, t88, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/59/16/75
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
77 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.776411,38232,1,0,113,108465,188,72,1703,144260,170
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07a-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-07a-07 finished in 2693 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 89/89 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 64 transition count 84
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 64 transition count 84
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 60 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 60 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 57 transition count 77
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 57 transition count 77
Applied a total of 24 rules in 5 ms. Remains 57 /69 variables (removed 12) and now considering 77/89 (removed 12) transitions.
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:54:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:53] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:54:53] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:54:53] [INFO ] State equation strengthened by 37 read => feed constraints.
[2021-05-09 14:54:53] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
// Phase 1: matrix 77 rows 57 cols
[2021-05-09 14:54:53] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:53] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 57/69 places, 77/89 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s18 0) (EQ s6 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Graph (complete) has 150 edges and 57 vertex of which 55 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 147 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 57 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 57/57 places, 77/77 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 77
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 57 transition count 77
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 57 transition count 77
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 15 rules applied. Total rules applied 17 place count 57 transition count 91
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 22 place count 52 transition count 81
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 27 place count 52 transition count 81
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 36 place count 43 transition count 63
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 45 place count 43 transition count 63
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 49 place count 39 transition count 59
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 53 place count 39 transition count 59
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 57 place count 35 transition count 51
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 61 place count 35 transition count 51
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 69 place count 27 transition count 39
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 77 place count 27 transition count 39
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 77 rules in 10 ms. Remains 27 /57 variables (removed 30) and now considering 39/77 (removed 38) transitions.
[2021-05-09 14:54:54] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:54:54] [INFO ] Flow matrix only has 35 transitions (discarded 4 similar events)
// Phase 1: matrix 35 rows 27 cols
[2021-05-09 14:54:54] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:54] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/57 places, 39/77 transitions.
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 202 ms.
[2021-05-09 14:54:54] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:54:54] [INFO ] Flatten gal took : 4 ms
[2021-05-09 14:54:54] [INFO ] Time to serialize gal into /tmp/LTL1634803857045591828.gal : 1 ms
[2021-05-09 14:54:54] [INFO ] Time to serialize properties into /tmp/LTL13006086595670329263.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/LTL1634803857045591828.gal, -t, CGAL, -LTL, /tmp/LTL13006086595670329263.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/LTL1634803857045591828.gal -t CGAL -LTL /tmp/LTL13006086595670329263.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((p21==0)||(p6==1))"))))
Formula 0 simplified : !XF"((p21==0)||(p6==1))"
Reverse transition relation is NOT exact ! Due to transitions t23, t25, t28, t30, t32, t34, t77, t79, t81, t82, t83, t84, t85, t87, t88, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/62/15/77
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
56 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.57787,32620,1,0,112,84330,180,74,1728,107277,167
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-07a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-07a-12 finished in 2054 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 89/89 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 69 transition count 83
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 63 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 62 transition count 82
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 58 transition count 78
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 58 transition count 78
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 25 place count 55 transition count 75
Iterating global reduction 3 with 3 rules applied. Total rules applied 28 place count 55 transition count 75
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 56 place count 41 transition count 61
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 60 place count 37 transition count 53
Iterating global reduction 3 with 4 rules applied. Total rules applied 64 place count 37 transition count 53
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 68 place count 33 transition count 45
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 33 transition count 45
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 76 place count 29 transition count 41
Iterating global reduction 3 with 4 rules applied. Total rules applied 80 place count 29 transition count 41
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 84 place count 25 transition count 33
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 25 transition count 33
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 92 place count 21 transition count 29
Iterating global reduction 3 with 4 rules applied. Total rules applied 96 place count 21 transition count 29
Applied a total of 96 rules in 12 ms. Remains 21 /69 variables (removed 48) and now considering 29/89 (removed 60) transitions.
[2021-05-09 14:54:55] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2021-05-09 14:54:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:55] [INFO ] Implicit Places using invariants in 13 ms returned []
[2021-05-09 14:54:55] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2021-05-09 14:54:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:55] [INFO ] State equation strengthened by 18 read => feed constraints.
[2021-05-09 14:54:55] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2021-05-09 14:54:55] [INFO ] Redundant transitions in 1 ms returned []
[2021-05-09 14:54:55] [INFO ] Flow matrix only has 25 transitions (discarded 4 similar events)
// Phase 1: matrix 25 rows 21 cols
[2021-05-09 14:54:55] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:54:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/69 places, 29/89 transitions.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-07a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s7 0) (EQ s0 1) (OR (EQ s13 0) (EQ s13 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 1 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-13 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((G(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 69/69 places, 89/89 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 72 edges and 67 vertex of which 28 / 67 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 53 transition count 68
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 56 place count 33 transition count 54
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 29 transition count 46
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 29 transition count 46
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 65 place count 29 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 66 place count 28 transition count 45
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 70 place count 24 transition count 37
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 24 transition count 37
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 77 place count 21 transition count 31
Iterating global reduction 4 with 3 rules applied. Total rules applied 80 place count 21 transition count 31
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 83 place count 18 transition count 28
Iterating global reduction 4 with 3 rules applied. Total rules applied 86 place count 18 transition count 28
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 92 place count 15 transition count 25
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 14 transition count 23
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 14 transition count 23
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 4 with 2 rules applied. Total rules applied 96 place count 13 transition count 23
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 97 place count 12 transition count 20
Iterating global reduction 4 with 1 rules applied. Total rules applied 98 place count 12 transition count 20
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 11 transition count 19
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 11 transition count 19
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 11 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 10 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 103 place count 9 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 104 place count 8 transition count 15
Applied a total of 104 rules in 13 ms. Remains 8 /69 variables (removed 61) and now considering 15/89 (removed 74) transitions.
[2021-05-09 14:54:55] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 14:54:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:54:55] [INFO ] Implicit Places using invariants in 11 ms returned []
[2021-05-09 14:54:55] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 14:54:55] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 14:54:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 14:54:55] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-09 14:54:55] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 14:54:55] [INFO ] Flow matrix only has 11 transitions (discarded 4 similar events)
// Phase 1: matrix 11 rows 8 cols
[2021-05-09 14:54:55] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 14:54:55] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/69 places, 15/89 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-07a-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (EQ s4 0) (EQ s2 1)), p0:(AND (EQ s2 0) (EQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 51 steps with 2 reset in 0 ms.
FORMULA DiscoveryGPU-PT-07a-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-07a-14 finished in 173 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620572096630

--------------------
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-07a"
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-07a, 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-162048875100252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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