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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 384K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K 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.4K Mar 23 10:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 23 10:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 22 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K 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 22K 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-06a-00
FORMULA_NAME DiscoveryGPU-PT-06a-01
FORMULA_NAME DiscoveryGPU-PT-06a-02
FORMULA_NAME DiscoveryGPU-PT-06a-03
FORMULA_NAME DiscoveryGPU-PT-06a-04
FORMULA_NAME DiscoveryGPU-PT-06a-05
FORMULA_NAME DiscoveryGPU-PT-06a-06
FORMULA_NAME DiscoveryGPU-PT-06a-07
FORMULA_NAME DiscoveryGPU-PT-06a-08
FORMULA_NAME DiscoveryGPU-PT-06a-09
FORMULA_NAME DiscoveryGPU-PT-06a-10
FORMULA_NAME DiscoveryGPU-PT-06a-11
FORMULA_NAME DiscoveryGPU-PT-06a-12
FORMULA_NAME DiscoveryGPU-PT-06a-13
FORMULA_NAME DiscoveryGPU-PT-06a-14
FORMULA_NAME DiscoveryGPU-PT-06a-15

=== Now, execution of the tool begins

BK_START 1620571463028

Running Version 0
[2021-05-09 14:44:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 14:44:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 14:44:25] [INFO ] Load time of PNML (sax parser for PT used): 35 ms
[2021-05-09 14:44:25] [INFO ] Transformed 63 places.
[2021-05-09 14:44:25] [INFO ] Transformed 85 transitions.
[2021-05-09 14:44:25] [INFO ] Found NUPN structural information;
[2021-05-09 14:44:25] [INFO ] Parsed PT model containing 63 places and 85 transitions in 74 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 14:44:25] [INFO ] Initial state test concluded for 3 properties.
FORMULA DiscoveryGPU-PT-06a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 63 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 63/63 places, 85/85 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 61 transition count 83
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 83
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 60 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 60 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 59 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 59 transition count 80
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 13 place count 59 transition count 75
Applied a total of 13 rules in 25 ms. Remains 59 /63 variables (removed 4) and now considering 75/85 (removed 10) transitions.
// Phase 1: matrix 75 rows 59 cols
[2021-05-09 14:44:25] [INFO ] Computed 2 place invariants in 5 ms
[2021-05-09 14:44:25] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 75 rows 59 cols
[2021-05-09 14:44:25] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 14:44:25] [INFO ] State equation strengthened by 47 read => feed constraints.
[2021-05-09 14:44:25] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
// Phase 1: matrix 75 rows 59 cols
[2021-05-09 14:44:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:25] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Finished structural reductions, in 1 iterations. Remains : 59/63 places, 75/85 transitions.
[2021-05-09 14:44:25] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-09 14:44:25] [INFO ] Flatten gal took : 25 ms
FORMULA DiscoveryGPU-PT-06a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 14:44:25] [INFO ] Flatten gal took : 9 ms
[2021-05-09 14:44:25] [INFO ] Input system was already deterministic with 75 transitions.
Finished random walk after 234 steps, including 3 resets, run visited all 25 properties in 6 ms. (steps per millisecond=39 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||X(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 51 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 48 transition count 64
Applied a total of 22 rules in 7 ms. Remains 48 /59 variables (removed 11) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:25] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 14:44:25] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:25] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:25] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:25] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:25] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/59 places, 64/75 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DiscoveryGPU-PT-06a-00 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s31 1) (EQ s46 1)), p1:(AND (EQ s43 1) (EQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06a-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-00 finished in 334 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((X((F(G(p2))&&p1))&&p0))))], workingDir=/home/mcc/execution]
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 50 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 50 transition count 66
Applied a total of 18 rules in 5 ms. Remains 50 /59 variables (removed 9) and now considering 66/75 (removed 9) transitions.
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:26] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:26] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:26] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/59 places, 66/75 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : DiscoveryGPU-PT-06a-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s47 1) (EQ s48 1)), p1:(AND (EQ s4 1) (EQ s49 1)), p2:(AND (EQ s2 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 79 steps with 0 reset in 2 ms.
FORMULA DiscoveryGPU-PT-06a-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-01 finished in 340 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X((G(p1)&&p0))||F((p1&&X(X(F(p2)))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 52 transition count 68
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 50 transition count 66
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 50 transition count 66
Applied a total of 18 rules in 5 ms. Remains 50 /59 variables (removed 9) and now considering 66/75 (removed 9) transitions.
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:26] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:26] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:26] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:26] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:26] [INFO ] Computed 2 place invariants in 4 ms
[2021-05-09 14:44:26] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/59 places, 66/75 transitions.
Stuttering acceptance computed with spot in 210 ms :[(NOT p2), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DiscoveryGPU-PT-06a-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(NOT p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 0}], [{ cond=p1, acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}]], initial=1, aps=[p2:(OR (NEQ s40 1) (NEQ s48 1)), p1:(OR (NEQ s17 1) (NEQ s49 1)), p0:(AND (EQ s2 1) (EQ s48 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 11719 reset in 251 ms.
Stack based approach found an accepted trace after 15 steps with 1 reset with depth 7 and stack size 7 in 1 ms.
FORMULA DiscoveryGPU-PT-06a-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-02 finished in 599 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 59 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 51 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 51 transition count 67
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 48 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 48 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 47 transition count 63
Applied a total of 24 rules in 28 ms. Remains 47 /59 variables (removed 12) and now considering 63/75 (removed 12) transitions.
// Phase 1: matrix 63 rows 47 cols
[2021-05-09 14:44:26] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 63 rows 47 cols
[2021-05-09 14:44:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
[2021-05-09 14:44:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 63 rows 47 cols
[2021-05-09 14:44:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 47/59 places, 63/75 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-03 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (NEQ s9 1) (NEQ s46 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 176 steps with 2 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-03 finished in 222 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 59 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 52 transition count 68
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 52 transition count 68
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 17 place count 49 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 20 place count 49 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 48 transition count 64
Applied a total of 22 rules in 9 ms. Remains 48 /59 variables (removed 11) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants and state equation in 69 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
[2021-05-09 14:44:27] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 47 cols
[2021-05-09 14:44:27] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 47/59 places, 64/75 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 35 transition count 52
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 31 transition count 44
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 31 transition count 44
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 27 transition count 36
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 27 transition count 36
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 44 place count 23 transition count 32
Iterating global reduction 0 with 4 rules applied. Total rules applied 48 place count 23 transition count 32
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 19 transition count 24
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 19 transition count 24
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 15 transition count 20
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 15 transition count 20
Applied a total of 64 rules in 9 ms. Remains 15 /47 variables (removed 32) and now considering 20/64 (removed 44) transitions.
[2021-05-09 14:44:27] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 14:44:27] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-09 14:44:27] [INFO ] Flow matrix only has 17 transitions (discarded 3 similar events)
// Phase 1: matrix 17 rows 15 cols
[2021-05-09 14:44:27] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 15/59 places, 20/75 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s7 0) (EQ s14 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 252 steps with 6 reset in 3 ms.
FORMULA DiscoveryGPU-PT-06a-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-04 finished in 253 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 59 transition count 70
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 54 transition count 70
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 50 transition count 66
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 50 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 47 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 47 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 46 transition count 62
Applied a total of 26 rules in 10 ms. Remains 46 /59 variables (removed 13) and now considering 62/75 (removed 13) transitions.
// Phase 1: matrix 62 rows 46 cols
[2021-05-09 14:44:27] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 62 rows 46 cols
[2021-05-09 14:44:27] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants and state equation in 68 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 103 ms to find 1 implicit places.
[2021-05-09 14:44:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 62 rows 45 cols
[2021-05-09 14:44:27] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 45/59 places, 62/75 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 33 transition count 50
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 29 place count 28 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 28 transition count 40
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 23 transition count 30
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 23 transition count 30
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 18 transition count 25
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 18 transition count 25
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 59 place count 13 transition count 15
Iterating global reduction 0 with 5 rules applied. Total rules applied 64 place count 13 transition count 15
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 68 place count 9 transition count 11
Iterating global reduction 0 with 4 rules applied. Total rules applied 72 place count 9 transition count 11
Applied a total of 72 rules in 5 ms. Remains 9 /45 variables (removed 36) and now considering 11/62 (removed 51) transitions.
[2021-05-09 14:44:27] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 14:44:27] [INFO ] Computed 1 place invariants in 1 ms
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants in 20 ms returned []
[2021-05-09 14:44:27] [INFO ] Flow matrix only has 10 transitions (discarded 1 similar events)
// Phase 1: matrix 10 rows 9 cols
[2021-05-09 14:44:27] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-09 14:44:27] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 9/59 places, 11/75 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Product exploration explored 100000 steps with 50000 reset in 145 ms.
[2021-05-09 14:44:28] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:44:28] [INFO ] Flatten gal took : 1 ms
[2021-05-09 14:44:28] [INFO ] Time to serialize gal into /tmp/LTL9217716135034321902.gal : 0 ms
[2021-05-09 14:44:28] [INFO ] Time to serialize properties into /tmp/LTL2408028613533687442.ltl : 4 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/LTL9217716135034321902.gal, -t, CGAL, -LTL, /tmp/LTL2408028613533687442.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/LTL9217716135034321902.gal -t CGAL -LTL /tmp/LTL2408028613533687442.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((p10==1)&&(p61==1))")))
Formula 0 simplified : !F"((p10==1)&&(p61==1))"
Reverse transition relation is NOT exact ! Due to transitions t70, t15.t61.t71, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/9/2/11
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 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.02905,16040,1,0,28,1103,46,16,287,1409,37
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06a-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DiscoveryGPU-PT-06a-06 finished in 963 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&X(G(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 53 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 51 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 51 transition count 67
Applied a total of 16 rules in 5 ms. Remains 51 /59 variables (removed 8) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:44:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:28] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:44:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:28] [INFO ] Implicit Places using invariants and state equation in 95 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 183 ms to find 1 implicit places.
// Phase 1: matrix 67 rows 50 cols
[2021-05-09 14:44:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:28] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Starting structural reductions, iteration 1 : 50/59 places, 67/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 67/67 (removed 0) transitions.
// Phase 1: matrix 67 rows 50 cols
[2021-05-09 14:44:28] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:28] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 50/59 places, 67/75 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : DiscoveryGPU-PT-06a-08 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(NEQ s1 1), p0:(NEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 124 steps with 1 reset in 1 ms.
FORMULA DiscoveryGPU-PT-06a-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-08 finished in 439 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(((F(p0)||X(p1)) U p2)))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 55 transition count 71
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 55 transition count 71
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 51 transition count 67
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 49 transition count 65
Applied a total of 20 rules in 4 ms. Remains 49 /59 variables (removed 10) and now considering 65/75 (removed 10) transitions.
// Phase 1: matrix 65 rows 49 cols
[2021-05-09 14:44:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:28] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 65 rows 49 cols
[2021-05-09 14:44:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:28] [INFO ] State equation strengthened by 43 read => feed constraints.
[2021-05-09 14:44:28] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 65 rows 49 cols
[2021-05-09 14:44:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:28] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 49/59 places, 65/75 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-06a-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (EQ s3 1) (AND (EQ s37 1) (EQ s48 1))), p0:(EQ s3 1), p1:(AND (EQ s37 1) (EQ s48 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 83 steps with 1 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-10 finished in 230 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 59 transition count 70
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 54 transition count 70
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 13 place count 51 transition count 67
Iterating global reduction 0 with 3 rules applied. Total rules applied 16 place count 51 transition count 67
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 49 transition count 65
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 49 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 48 transition count 64
Applied a total of 22 rules in 8 ms. Remains 48 /59 variables (removed 11) and now considering 64/75 (removed 11) transitions.
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:29] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:29] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2021-05-09 14:44:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 64 rows 48 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:29] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 48/59 places, 64/75 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-06a-12 automaton TGBA [mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s23 0) (OR (EQ s6 0) (EQ s47 0))), p0:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-12 finished in 202 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(G(p0))||(p1&&F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 53 transition count 69
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 51 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 51 transition count 67
Applied a total of 16 rules in 2 ms. Remains 51 /59 variables (removed 8) and now considering 67/75 (removed 8) transitions.
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:29] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 2 ms
[2021-05-09 14:44:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:29] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 67 rows 51 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:29] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 51/59 places, 67/75 transitions.
Stuttering acceptance computed with spot in 269 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : DiscoveryGPU-PT-06a-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p2:(AND (EQ s44 1) (EQ s49 1)), p1:(EQ s11 1), p0:(AND (EQ s8 1) (EQ s50 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-06a-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-13 finished in 390 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G((p1 U p2))||G(p3)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 56 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 56 transition count 72
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 53 transition count 69
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 53 transition count 69
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 50 transition count 66
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 50 transition count 66
Applied a total of 18 rules in 2 ms. Remains 50 /59 variables (removed 9) and now considering 66/75 (removed 9) transitions.
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-09 14:44:29] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 66 rows 50 cols
[2021-05-09 14:44:29] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-09 14:44:29] [INFO ] State equation strengthened by 44 read => feed constraints.
[2021-05-09 14:44:29] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 60 ms to find 1 implicit places.
// Phase 1: matrix 66 rows 49 cols
[2021-05-09 14:44:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:29] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 49/59 places, 66/75 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 49 cols
[2021-05-09 14:44:29] [INFO ] Computed 1 place invariants in 0 ms
[2021-05-09 14:44:29] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/59 places, 66/75 transitions.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DiscoveryGPU-PT-06a-15 automaton TGBA [mat=[[{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) p2) (AND (NOT p3) (NOT p0) p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p3 (NOT p0) p2) (AND p3 (NOT p0) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p3:(AND (EQ s39 1) (EQ s48 1)), p0:(EQ s8 1), p2:(EQ s32 1), p1:(AND (EQ s19 1) (EQ s48 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6555 reset in 210 ms.
Stack based approach found an accepted trace after 77 steps with 2 reset with depth 37 and stack size 37 in 1 ms.
FORMULA DiscoveryGPU-PT-06a-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-06a-15 finished in 446 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620571470975

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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