Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089416000604.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 RefineWMG-PT-005006, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416000604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 9.6K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 14:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.4K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 14K 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 RefineWMG-PT-005006-00
FORMULA_NAME RefineWMG-PT-005006-01
FORMULA_NAME RefineWMG-PT-005006-02
FORMULA_NAME RefineWMG-PT-005006-03
FORMULA_NAME RefineWMG-PT-005006-04
FORMULA_NAME RefineWMG-PT-005006-05
FORMULA_NAME RefineWMG-PT-005006-06
FORMULA_NAME RefineWMG-PT-005006-07
FORMULA_NAME RefineWMG-PT-005006-08
FORMULA_NAME RefineWMG-PT-005006-09
FORMULA_NAME RefineWMG-PT-005006-10
FORMULA_NAME RefineWMG-PT-005006-11
FORMULA_NAME RefineWMG-PT-005006-12
FORMULA_NAME RefineWMG-PT-005006-13
FORMULA_NAME RefineWMG-PT-005006-14
FORMULA_NAME RefineWMG-PT-005006-15

=== Now, execution of the tool begins

BK_START 1621261542444

Running Version 0
[2021-05-17 14:25:44] [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-17 14:25:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:25:44] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2021-05-17 14:25:44] [INFO ] Transformed 29 places.
[2021-05-17 14:25:44] [INFO ] Transformed 23 transitions.
[2021-05-17 14:25:44] [INFO ] Parsed PT model containing 29 places and 23 transitions in 67 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:25:44] [INFO ] Initial state test concluded for 2 properties.
FORMULA RefineWMG-PT-005006-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 38 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:44] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-17 14:25:44] [INFO ] Dead Transitions using invariants and state equation in 130 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:44] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:44] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:44] [INFO ] Computed 12 place invariants in 5 ms
[2021-05-17 14:25:44] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:44] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:44] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
[2021-05-17 14:25:45] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-17 14:25:45] [INFO ] Flatten gal took : 23 ms
FORMULA RefineWMG-PT-005006-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005006-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-005006-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:25:45] [INFO ] Flatten gal took : 5 ms
[2021-05-17 14:25:45] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 4506 steps, including 0 resets, run visited all 26 properties in 18 ms. (steps per millisecond=250 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 13 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 19 place count 11 transition count 11
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 11 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 9 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 23 place count 9 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 25 place count 8 transition count 8
Applied a total of 25 rules in 12 ms. Remains 8 /29 variables (removed 21) and now considering 8/23 (removed 15) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:25:45] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 14 ms
[2021-05-17 14:25:45] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-17 14:25:45] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-17 14:25:45] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:25:45] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/29 places, 8/23 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT s7 s5)], 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 0 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-005006-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-00 finished in 342 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 14 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 11 transition count 10
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 18 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 10 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 19 place count 10 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 21 place count 9 transition count 8
Applied a total of 21 rules in 3 ms. Remains 9 /29 variables (removed 20) and now considering 8/23 (removed 15) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:45] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:25:45] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2021-05-17 14:25:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:45] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:45] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/29 places, 8/23 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ 1 s7), p1:(GT s4 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-01 finished in 208 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((F((p0&&X((p1 U p2)))) U p3))))], workingDir=/home/mcc/execution]
Support contains 6 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:45] [INFO ] Computed 12 place invariants in 8 ms
[2021-05-17 14:25:45] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:45] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 14:25:45] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:45] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:45] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:45] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : RefineWMG-PT-005006-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p3) p0 (NOT p2)) (AND (NOT p3) (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND p3 p0 (NOT p2)) (AND p3 (NOT p2) p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p3 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p3:(OR (GT s17 s18) (GT s0 s12)), p0:(GT 3 s26), p2:(LEQ 2 s24), p1:(LEQ s0 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 48 reset in 436 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 2 ms.
FORMULA RefineWMG-PT-005006-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-03 finished in 723 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:46] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:46] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:46] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-17 14:25:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:46] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-005006-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GT s0 s2), p1:(GT 3 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 141 ms.
Stack based approach found an accepted trace after 19 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RefineWMG-PT-005006-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-04 finished in 397 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-005006-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GT s15 s2) (GT s5 s22)), p0:(GT s15 s2)], 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 7 reset in 146 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 27 in 0 ms.
FORMULA RefineWMG-PT-005006-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-05 finished in 387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0||G(p1)) U X(p2)))], workingDir=/home/mcc/execution]
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 3 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-005006-08 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p0 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GT s16 s0), p1:(GT s24 s7), p2:(LEQ 1 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 201 steps with 3 reset in 1 ms.
FORMULA RefineWMG-PT-005006-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-08 finished in 278 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 14 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 17 place count 11 transition count 10
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 21 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 21 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 23 place count 8 transition count 7
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 3 with 2 rules applied. Total rules applied 25 place count 7 transition count 6
Applied a total of 25 rules in 8 ms. Remains 7 /29 variables (removed 22) and now considering 6/23 (removed 17) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:25:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:25:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:25:47] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 14:25:47] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:25:47] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/29 places, 6/23 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-09 finished in 96 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((X(p0)||F(((p1&&X(X(F(p2))))||G(F(p2))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:47] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:47] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:47] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-005006-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=(NOT p1), acceptance={} source=6 dest: 6}, { cond=p1, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=0, aps=[p1:(LEQ 2 s28), p0:(GT s12 s15), p2:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Product exploration explored 100000 steps with 25000 reset in 162 ms.
Knowledge obtained : [(NOT p1), p0, p2]
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 120 ms.
Applying partial POR strategy [false, false, false, false, false, true, false, false]
Stuttering acceptance computed with spot in 228 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2)]
Support contains 4 out of 29 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 10 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 7 place count 23 transition count 18
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 2 ms. Remains 23 /29 variables (removed 6) and now considering 18/23 (removed 5) transitions.
// Phase 1: matrix 18 rows 23 cols
[2021-05-17 14:25:49] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 14:25:49] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
[2021-05-17 14:25:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 18 rows 23 cols
[2021-05-17 14:25:49] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-17 14:25:49] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/29 places, 18/23 transitions.
Product exploration explored 100000 steps with 25000 reset in 94 ms.
Product exploration explored 100000 steps with 25000 reset in 167 ms.
[2021-05-17 14:25:49] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:25:49] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:25:49] [INFO ] Time to serialize gal into /tmp/LTL6131471739994274940.gal : 2 ms
[2021-05-17 14:25:49] [INFO ] Time to serialize properties into /tmp/LTL12957083620445752327.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/LTL6131471739994274940.gal, -t, CGAL, -LTL, /tmp/LTL12957083620445752327.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/LTL6131471739994274940.gal -t CGAL -LTL /tmp/LTL12957083620445752327.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X((X("(p9>p12)"))||(F((("(p25>=2)")&&(X(X(F("(p<1)")))))||(G(F("(p<1)")))))))))
Formula 0 simplified : !XX(X"(p9>p12)" | F(("(p25>=2)" & XXF"(p<1)") | GF"(p<1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9 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.110535,20508,1,0,11,17561,29,0,805,20266,26
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-005006-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RefineWMG-PT-005006-10 finished in 2064 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 23/23 (removed 0) transitions.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:49] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:49] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:49] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:49] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:49] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-17 14:25:49] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
// Phase 1: matrix 23 rows 29 cols
[2021-05-17 14:25:49] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-17 14:25:49] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 29/29 places, 23/23 transitions.
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ s15 s21) (LEQ s13 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-11 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 12 edges and 29 vertex of which 8 / 29 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 21 transition count 16
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 16 place count 13 transition count 12
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 13 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 20 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 20 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 22 place count 10 transition count 9
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 3 with 2 rules applied. Total rules applied 24 place count 9 transition count 8
Applied a total of 24 rules in 3 ms. Remains 9 /29 variables (removed 20) and now considering 8/23 (removed 15) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:49] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:25:50] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:50] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:25:50] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:25:50] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-17 14:25:50] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:25:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:25:50] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/29 places, 8/23 transitions.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-005006-12 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:(GT s6 s8)], 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 7 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-12 finished in 122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 10 edges and 29 vertex of which 6 / 29 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 23 transition count 18
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 15 transition count 14
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 16 place count 15 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 14 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 17 place count 14 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 19 place count 13 transition count 12
Applied a total of 19 rules in 2 ms. Remains 13 /29 variables (removed 16) and now considering 12/23 (removed 11) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:25:50] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:25:50] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:25:50] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 29 ms to find 0 implicit places.
[2021-05-17 14:25:50] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:25:50] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/29 places, 12/23 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-005006-14 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(LEQ s5 s12), p0:(LEQ s9 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-14 finished in 122 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((p0&&(p1 U p2)))||G(p3))))], workingDir=/home/mcc/execution]
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 29/29 places, 23/23 transitions.
Graph (trivial) has 12 edges and 29 vertex of which 10 / 29 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 19 transition count 14
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 11 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 11 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 15 place count 13 transition count 10
Applied a total of 15 rules in 1 ms. Remains 13 /29 variables (removed 16) and now considering 10/23 (removed 13) transitions.
// Phase 1: matrix 10 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:25:50] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:25:50] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:25:50] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-17 14:25:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 13 cols
[2021-05-17 14:25:50] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:25:50] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/29 places, 10/23 transitions.
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-005006-15 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p3) p2) (AND p0 (NOT p3) p1)), acceptance={1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p3) (AND p3 (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p3 p2) (AND p0 p3 p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 p3 (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s11 s7), p3:(LEQ 1 s3), p2:(LEQ 2 s8), p1:(LEQ 1 s5)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-005006-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-005006-15 finished in 141 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621261550827

--------------------
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="RefineWMG-PT-005006"
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 RefineWMG-PT-005006, 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 r178-tajo-162089416000604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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