About the Execution of ITS-Tools for DiscoveryGPU-PT-10a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
512.287 | 28985.00 | 40472.00 | 333.60 | TFTTFFTFFTFFTTTF | normal |
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-162048875200300.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-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875200300
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K 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.4K 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 15K Mar 28 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 23 10:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 10:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 22 17:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 17:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 36K 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-10a-00
FORMULA_NAME DiscoveryGPU-PT-10a-01
FORMULA_NAME DiscoveryGPU-PT-10a-02
FORMULA_NAME DiscoveryGPU-PT-10a-03
FORMULA_NAME DiscoveryGPU-PT-10a-04
FORMULA_NAME DiscoveryGPU-PT-10a-05
FORMULA_NAME DiscoveryGPU-PT-10a-06
FORMULA_NAME DiscoveryGPU-PT-10a-07
FORMULA_NAME DiscoveryGPU-PT-10a-08
FORMULA_NAME DiscoveryGPU-PT-10a-09
FORMULA_NAME DiscoveryGPU-PT-10a-10
FORMULA_NAME DiscoveryGPU-PT-10a-11
FORMULA_NAME DiscoveryGPU-PT-10a-12
FORMULA_NAME DiscoveryGPU-PT-10a-13
FORMULA_NAME DiscoveryGPU-PT-10a-14
FORMULA_NAME DiscoveryGPU-PT-10a-15
=== Now, execution of the tool begins
BK_START 1620575333192
Running Version 0
[2021-05-09 15:48:54] [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 15:48:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 15:48:55] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2021-05-09 15:48:55] [INFO ] Transformed 103 places.
[2021-05-09 15:48:55] [INFO ] Transformed 141 transitions.
[2021-05-09 15:48:55] [INFO ] Found NUPN structural information;
[2021-05-09 15:48:55] [INFO ] Parsed PT model containing 103 places and 141 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 15:48:55] [INFO ] Initial state test concluded for 2 properties.
FORMULA DiscoveryGPU-PT-10a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 103 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 103/103 places, 141/141 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 98 transition count 136
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 98 transition count 136
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 94 transition count 132
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 94 transition count 132
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 92 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 92 transition count 128
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 30 place count 92 transition count 120
Applied a total of 30 rules in 25 ms. Remains 92 /103 variables (removed 11) and now considering 120/141 (removed 21) transitions.
// Phase 1: matrix 120 rows 92 cols
[2021-05-09 15:48:55] [INFO ] Computed 2 place invariants in 16 ms
[2021-05-09 15:48:55] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 120 rows 92 cols
[2021-05-09 15:48:55] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 15:48:55] [INFO ] State equation strengthened by 76 read => feed constraints.
[2021-05-09 15:48:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned [91]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 271 ms to find 1 implicit places.
// Phase 1: matrix 120 rows 91 cols
[2021-05-09 15:48:55] [INFO ] Computed 1 place invariants in 4 ms
[2021-05-09 15:48:55] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Starting structural reductions, iteration 1 : 91/103 places, 120/141 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 120/120 (removed 0) transitions.
// Phase 1: matrix 120 rows 91 cols
[2021-05-09 15:48:55] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:48:55] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Finished structural reductions, in 2 iterations. Remains : 91/103 places, 120/141 transitions.
[2021-05-09 15:48:55] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-09 15:48:55] [INFO ] Flatten gal took : 37 ms
FORMULA DiscoveryGPU-PT-10a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-10a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 15:48:55] [INFO ] Flatten gal took : 12 ms
[2021-05-09 15:48:55] [INFO ] Input system was already deterministic with 120 transitions.
Incomplete random walk after 100000 steps, including 922 resets, run finished after 308 ms. (steps per millisecond=324 ) properties (out of 16) seen :14
Running SMT prover for 2 properties.
// Phase 1: matrix 120 rows 91 cols
[2021-05-09 15:48:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:48:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 15:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:48:56] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2021-05-09 15:48:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:48:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned unsat
[2021-05-09 15:48:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 15:48:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 15:48:56] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-09 15:48:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 15:48:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2021-05-09 15:48:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-09 15:48:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
[2021-05-09 15:48:56] [INFO ] Initial state test concluded for 1 properties.
FORMULA DiscoveryGPU-PT-10a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 120/120 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 91 transition count 113
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 84 transition count 113
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 80 transition count 109
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 80 transition count 109
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 25 place count 77 transition count 106
Iterating global reduction 2 with 3 rules applied. Total rules applied 28 place count 77 transition count 106
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 66 place count 58 transition count 87
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 74 place count 50 transition count 71
Iterating global reduction 2 with 8 rules applied. Total rules applied 82 place count 50 transition count 71
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 90 place count 42 transition count 55
Iterating global reduction 2 with 8 rules applied. Total rules applied 98 place count 42 transition count 55
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 105 place count 35 transition count 48
Iterating global reduction 2 with 7 rules applied. Total rules applied 112 place count 35 transition count 48
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 118 place count 29 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 124 place count 29 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 24 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 24 transition count 31
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 135 place count 24 transition count 31
Applied a total of 135 rules in 55 ms. Remains 24 /91 variables (removed 67) and now considering 31/120 (removed 89) transitions.
[2021-05-09 15:48:56] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 24 cols
[2021-05-09 15:48:56] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:48:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2021-05-09 15:48:56] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 24 cols
[2021-05-09 15:48:56] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:48:56] [INFO ] State equation strengthened by 19 read => feed constraints.
[2021-05-09 15:48:56] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2021-05-09 15:48:56] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:48:56] [INFO ] Flow matrix only has 28 transitions (discarded 3 similar events)
// Phase 1: matrix 28 rows 24 cols
[2021-05-09 15:48:56] [INFO ] Computed 1 place invariants in 6 ms
[2021-05-09 15:48:56] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/91 places, 31/120 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (NEQ s7 1) (AND (NEQ s11 0) (NEQ s15 1))), p0:(AND (NEQ s20 0) (NEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-01 finished in 382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0)))&&F((X((p2 U (G(p2)||p3)))&&p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 120/120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 79 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 79 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 75 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 75 transition count 104
Applied a total of 32 rules in 15 ms. Remains 75 /91 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:56] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:48:56] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:56] [INFO ] Computed 1 place invariants in 2 ms
[2021-05-09 15:48:56] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 15:48:56] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:56] [INFO ] Computed 1 place invariants in 9 ms
[2021-05-09 15:48:57] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 75/91 places, 104/120 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p0), true]
Running random walk in product with property : DiscoveryGPU-PT-10a-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (NEQ s54 0) (NEQ s4 1)), p3:(OR (NEQ s19 0) (NEQ s14 1)), p2:(AND (NEQ s54 0) (NEQ s4 1)), p0:(AND (NEQ s14 0) (NEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63 steps with 1 reset in 2 ms.
FORMULA DiscoveryGPU-PT-10a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-04 finished in 474 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 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 120/120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 79 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 79 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 75 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 75 transition count 104
Applied a total of 32 rules in 9 ms. Remains 75 /91 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:48:57] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:48:57] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 15:48:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:48:57] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 75/91 places, 104/120 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s15 0) (EQ s0 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]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 1 ms.
FORMULA DiscoveryGPU-PT-10a-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-05 finished in 232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 120/120 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 84 transition count 113
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 84 transition count 113
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 79 transition count 108
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 79 transition count 108
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 75 transition count 104
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 75 transition count 104
Applied a total of 32 rules in 6 ms. Remains 75 /91 variables (removed 16) and now considering 104/120 (removed 16) transitions.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:57] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:48:57] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:57] [INFO ] Computed 1 place invariants in 8 ms
[2021-05-09 15:48:57] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 15:48:57] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 104 rows 75 cols
[2021-05-09 15:48:57] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:48:57] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 1 iterations. Remains : 75/91 places, 104/120 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s24 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 351 ms.
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Graph (complete) has 206 edges and 75 vertex of which 74 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 196 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 75 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 75/75 places, 104/104 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 75 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 75 transition count 104
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 21 rules applied. Total rules applied 22 place count 75 transition count 124
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 31 place count 66 transition count 106
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 40 place count 66 transition count 106
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 58 place count 48 transition count 70
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 18 rules applied. Total rules applied 76 place count 48 transition count 70
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 85 place count 39 transition count 61
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 94 place count 39 transition count 61
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 103 place count 30 transition count 43
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 9 rules applied. Total rules applied 112 place count 30 transition count 43
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 129 place count 13 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 146 place count 13 transition count 17
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 146 rules in 12 ms. Remains 13 /75 variables (removed 62) and now considering 17/104 (removed 87) transitions.
[2021-05-09 15:48:58] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:48:58] [INFO ] Flow matrix only has 16 transitions (discarded 1 similar events)
// Phase 1: matrix 16 rows 13 cols
[2021-05-09 15:48:58] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:48:58] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/75 places, 17/104 transitions.
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
[2021-05-09 15:48:59] [INFO ] Flatten gal took : 7 ms
[2021-05-09 15:48:59] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:48:59] [INFO ] Time to serialize gal into /tmp/LTL12393957098137609398.gal : 77 ms
[2021-05-09 15:48:59] [INFO ] Time to serialize properties into /tmp/LTL2362827846346644451.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/LTL12393957098137609398.gal, -t, CGAL, -LTL, /tmp/LTL2362827846346644451.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/LTL12393957098137609398.gal -t CGAL -LTL /tmp/LTL2362827846346644451.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("(p30==1)"))))
Formula 0 simplified : !XF"(p30==1)"
Reverse transition relation is NOT exact ! Due to transitions t30, t32, t34, t36, t38, t40, t41, t43, t45, t47, t105, t107, t109, t110, t112, t113, t114, t115, t117, t118, t119, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/21/104
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
1024 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,10.2524,244128,1,0,149,1.10497e+06,234,99,2329,1.48154e+06,221
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-10a-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-10a-09 finished in 13927 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 114
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 80 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 80 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 76 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 76 transition count 105
Applied a total of 30 rules in 4 ms. Remains 76 /91 variables (removed 15) and now considering 105/120 (removed 15) transitions.
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:11] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 15:49:11] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:11] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/91 places, 105/120 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s15 0) (NEQ s16 1) (NEQ s3 0) (NEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-11 finished in 238 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(G((p1&&F(G(p1)))))||p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 120/120 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 85 transition count 114
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 85 transition count 114
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 80 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 80 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 26 place count 76 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 30 place count 76 transition count 105
Applied a total of 30 rules in 3 ms. Remains 76 /91 variables (removed 15) and now considering 105/120 (removed 15) transitions.
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:11] [INFO ] Computed 1 place invariants in 15 ms
[2021-05-09 15:49:11] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:11] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 15:49:11] [INFO ] State equation strengthened by 51 read => feed constraints.
[2021-05-09 15:49:11] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
// Phase 1: matrix 105 rows 76 cols
[2021-05-09 15:49:11] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:11] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 76/91 places, 105/120 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-10a-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s3 0) (EQ s73 1)), p1:(OR (EQ s42 0) (EQ s35 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 177 ms.
Product exploration explored 100000 steps with 50000 reset in 181 ms.
Graph (complete) has 207 edges and 76 vertex of which 75 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Product exploration explored 100000 steps with 50000 reset in 169 ms.
Product exploration explored 100000 steps with 50000 reset in 180 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1)]
Support contains 4 out of 76 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 76/76 places, 105/105 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 76 transition count 123
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 68 transition count 107
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 68 transition count 107
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 50 place count 54 transition count 79
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 64 place count 54 transition count 79
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 48 transition count 73
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 48 transition count 73
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 43 transition count 63
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 43 transition count 63
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 96 place count 33 transition count 48
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 106 place count 33 transition count 48
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 106 rules in 15 ms. Remains 33 /76 variables (removed 43) and now considering 48/105 (removed 57) transitions.
[2021-05-09 15:49:12] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:49:12] [INFO ] Flow matrix only has 44 transitions (discarded 4 similar events)
// Phase 1: matrix 44 rows 33 cols
[2021-05-09 15:49:12] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 15:49:12] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 33/76 places, 48/105 transitions.
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 219 ms.
[2021-05-09 15:49:13] [INFO ] Flatten gal took : 6 ms
[2021-05-09 15:49:13] [INFO ] Flatten gal took : 5 ms
[2021-05-09 15:49:13] [INFO ] Time to serialize gal into /tmp/LTL17179545202659126836.gal : 2 ms
[2021-05-09 15:49:13] [INFO ] Time to serialize properties into /tmp/LTL7825121166140695375.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/LTL17179545202659126836.gal, -t, CGAL, -LTL, /tmp/LTL7825121166140695375.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/LTL17179545202659126836.gal -t CGAL -LTL /tmp/LTL7825121166140695375.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((p3==0)||(p99==1))")||(X(G(("((p56==0)||(p46==1))")&&(F(G("((p56==0)||(p46==1))")))))))))
Formula 0 simplified : !X("((p3==0)||(p99==1))" | XG("((p56==0)||(p46==1))" & FG"((p56==0)||(p46==1))"))
Reverse transition relation is NOT exact ! Due to transitions t23, t26, t30, t32, t34, t36, t38, t41, t43, t45, t47, t105, t107, t109, t110, t112, t113, t114, t115, t117, t118, t119, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/83/22/105
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
686 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,6.88312,175484,1,0,152,807282,230,99,2350,1.0001e+06,221
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-10a-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DiscoveryGPU-PT-10a-12 finished in 9533 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 91/91 places, 120/120 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (trivial) has 101 edges and 89 vertex of which 40 / 89 are part of one of the 20 SCC in 2 ms
Free SCC test removed 20 places
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 69 transition count 96
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 68 place count 46 transition count 76
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 42 transition count 68
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 42 transition count 68
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 77 place count 42 transition count 67
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 41 transition count 67
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 83 place count 36 transition count 57
Iterating global reduction 4 with 5 rules applied. Total rules applied 88 place count 36 transition count 57
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 93 place count 31 transition count 47
Iterating global reduction 4 with 5 rules applied. Total rules applied 98 place count 31 transition count 47
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 103 place count 26 transition count 41
Iterating global reduction 4 with 5 rules applied. Total rules applied 108 place count 26 transition count 41
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 25 transition count 40
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 25 transition count 40
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 124 place count 18 transition count 33
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 126 place count 16 transition count 29
Iterating global reduction 4 with 2 rules applied. Total rules applied 128 place count 16 transition count 29
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 14 transition count 23
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 14 transition count 23
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 134 place count 12 transition count 21
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 12 transition count 21
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 12 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 11 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 10 transition count 18
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 9 transition count 17
Applied a total of 140 rules in 16 ms. Remains 9 /91 variables (removed 82) and now considering 17/120 (removed 103) transitions.
[2021-05-09 15:49:21] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 15:49:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:49:21] [INFO ] Implicit Places using invariants in 10 ms returned []
[2021-05-09 15:49:21] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 15:49:21] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 15:49:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-09 15:49:21] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-09 15:49:21] [INFO ] Redundant transitions in 0 ms returned []
[2021-05-09 15:49:21] [INFO ] Flow matrix only has 12 transitions (discarded 5 similar events)
// Phase 1: matrix 12 rows 9 cols
[2021-05-09 15:49:21] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 15:49:21] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/91 places, 17/120 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-10a-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (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][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-10a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-10a-15 finished in 124 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620575362177
--------------------
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-10a"
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-10a, 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-162048875200300"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-10a.tgz
mv DiscoveryGPU-PT-10a 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 '
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 ;