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-162089416100621.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-007008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-162089416100621
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 126K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.3K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 25 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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 18K 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-007008-00
FORMULA_NAME RefineWMG-PT-007008-01
FORMULA_NAME RefineWMG-PT-007008-02
FORMULA_NAME RefineWMG-PT-007008-03
FORMULA_NAME RefineWMG-PT-007008-04
FORMULA_NAME RefineWMG-PT-007008-05
FORMULA_NAME RefineWMG-PT-007008-06
FORMULA_NAME RefineWMG-PT-007008-07
FORMULA_NAME RefineWMG-PT-007008-08
FORMULA_NAME RefineWMG-PT-007008-09
FORMULA_NAME RefineWMG-PT-007008-10
FORMULA_NAME RefineWMG-PT-007008-11
FORMULA_NAME RefineWMG-PT-007008-12
FORMULA_NAME RefineWMG-PT-007008-13
FORMULA_NAME RefineWMG-PT-007008-14
FORMULA_NAME RefineWMG-PT-007008-15

=== Now, execution of the tool begins

BK_START 1621261615187

Running Version 0
[2021-05-17 14:26:56] [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-17 14:26:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:26:56] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-17 14:26:56] [INFO ] Transformed 39 places.
[2021-05-17 14:26:56] [INFO ] Transformed 31 transitions.
[2021-05-17 14:26:56] [INFO ] Parsed PT model containing 39 places and 31 transitions in 60 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:26:56] [INFO ] Initial state test concluded for 1 properties.
Support contains 22 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 8 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 5 ms
[2021-05-17 14:26:57] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:57] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:57] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:57] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
[2021-05-17 14:26:57] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:26:57] [INFO ] Flatten gal took : 21 ms
FORMULA RefineWMG-PT-007008-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:26:57] [INFO ] Flatten gal took : 6 ms
[2021-05-17 14:26:57] [INFO ] Input system was already deterministic with 31 transitions.
Finished random walk after 1246 steps, including 0 resets, run visited all 16 properties in 10 ms. (steps per millisecond=124 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(F(p0))&&((p0&&F(p1))||G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:57] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-17 14:26:57] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:57] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:57] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-17 14:26:57] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
[2021-05-17 14:26:57] [INFO ] Initial state test concluded for 1 properties.
Stuttering acceptance computed with spot in 322 ms :[(NOT p0), true, (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-007008-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s25 1), p1:(LT s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 671 reset in 266 ms.
Stack based approach found an accepted trace after 43 steps with 3 reset with depth 38 and stack size 37 in 1 ms.
FORMULA RefineWMG-PT-007008-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-01 finished in 772 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((G(p0)||F(p1))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:58] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-17 14:26:58] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:58] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007008-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(LT s3 3), p0:(LT s7 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 22379 reset in 162 ms.
Stack based approach found an accepted trace after 300 steps with 73 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RefineWMG-PT-007008-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-02 finished in 455 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:58] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:58] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:58] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:58] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:58] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-03 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:(LT s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-03 finished in 254 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:59] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:59] [INFO ] Dead Transitions using invariants and state equation in 76 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:59] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:59] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:59] [INFO ] Computed 16 place invariants in 13 ms
[2021-05-17 14:26:59] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:59] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2636 reset in 267 ms.
Stack based approach found an accepted trace after 117 steps with 51 reset with depth 4 and stack size 4 in 0 ms.
FORMULA RefineWMG-PT-007008-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-04 finished in 571 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)||X((F(p1)||X(p2)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:59] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:59] [INFO ] Dead Transitions using invariants and state equation in 325 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:59] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:59] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:59] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:00] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007008-05 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s32 1) (GEQ s34 1)), p1:(LT s25 1), p2:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 163 ms.
Product exploration explored 100000 steps with 50000 reset in 236 ms.
Knowledge obtained : [(NOT p0), p1, p2]
Stuttering acceptance computed with spot in 212 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 50000 reset in 153 ms.
Product exploration explored 100000 steps with 50000 reset in 152 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 16 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
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 10 place count 27 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 10 rules in 13 ms. Remains 27 /39 variables (removed 12) and now considering 20/31 (removed 11) transitions.
// Phase 1: matrix 20 rows 27 cols
[2021-05-17 14:27:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 14:27:02] [INFO ] Dead Transitions using invariants and state equation in 1091 ms returned []
[2021-05-17 14:27:02] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 20 rows 27 cols
[2021-05-17 14:27:02] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 14:27:03] [INFO ] Dead Transitions using invariants and state equation in 1097 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/39 places, 20/31 transitions.
Product exploration explored 100000 steps with 50000 reset in 160 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
[2021-05-17 14:27:04] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:27:04] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:27:04] [INFO ] Time to serialize gal into /tmp/LTL5825365634180862752.gal : 10 ms
[2021-05-17 14:27:04] [INFO ] Time to serialize properties into /tmp/LTL5994496646724881580.ltl : 27 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/LTL5825365634180862752.gal, -t, CGAL, -LTL, /tmp/LTL5994496646724881580.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/LTL5825365634180862752.gal -t CGAL -LTL /tmp/LTL5994496646724881580.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((F("(((p28>=1)&&(p29>=1))&&(p31>=1))"))||(X((F("(p22<1)"))||(X("(p2<1)"))))))
Formula 0 simplified : !(F"(((p28>=1)&&(p29>=1))&&(p31>=1))" | X(F"(p22<1)" | X"(p2<1)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
17 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.194848,22620,1,0,6,35494,19,0,1111,43076,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-007008-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-007008-05 finished in 5124 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:04] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:04] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:04] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:04] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:04] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:06] [INFO ] Dead Transitions using invariants and state equation in 1504 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s21 1) (LT s22 1) (LT s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 104 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-007008-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-06 finished in 1734 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G((F(p1)&&F(!p2))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 16 edges and 39 vertex of which 10 / 39 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 29 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 17 transition count 16
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 26 place count 17 transition count 13
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 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 29 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 31 place count 13 transition count 12
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 33 place count 12 transition count 11
Applied a total of 33 rules in 16 ms. Remains 12 /39 variables (removed 27) and now considering 11/31 (removed 20) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:27:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:27:06] [INFO ] Dead Transitions using invariants and state equation in 90 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:27:06] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:27:06] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:27:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:27:06] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2021-05-17 14:27:06] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:27:06] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:27:06] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/39 places, 11/31 transitions.
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2)]
Running random walk in product with property : RefineWMG-PT-007008-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s9 1) (GEQ s10 1)) (GEQ s10 1)), p1:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s10 1)), p2:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 94 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-07 finished in 382 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:06] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:06] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:06] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:07] [INFO ] Implicit Places using invariants in 870 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:07] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-17 14:27:07] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 953 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:07] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:07] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 186 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s16 1) (LT s17 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 84 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-007008-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-08 finished in 1272 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||F(((p1 U p2)||X(X(F(!p3))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 39 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:08] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:08] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:08] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:08] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:08] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:08] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:08] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p2) p0 p3), (AND (NOT p2) p3), (AND (NOT p2) p0 p3), (AND (NOT p2) p3)]
Running random walk in product with property : RefineWMG-PT-007008-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) p3), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s31 1) (GEQ s32 1) (GEQ s34 1)), p0:(LT s38 1), p3:(LT s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 12126 reset in 266 ms.
Stack based approach found an accepted trace after 24 steps with 2 reset with depth 19 and stack size 19 in 0 ms.
FORMULA RefineWMG-PT-007008-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-09 finished in 695 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:08] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:09] [INFO ] Dead Transitions using invariants and state equation in 1058 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:09] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:27:09] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:09] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:09] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:09] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:09] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-10 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:(LT s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-10 finished in 1257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 19 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 27 place count 13 transition count 13
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 13 transition count 8
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 37 place count 8 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 37 place count 8 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 39 place count 7 transition count 7
Applied a total of 39 rules in 3 ms. Remains 7 /39 variables (removed 32) and now considering 7/31 (removed 24) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-17 14:27:10] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/39 places, 7/31 transitions.
Stuttering acceptance computed with spot in 24 ms :[p0]
Running random walk in product with property : RefineWMG-PT-007008-11 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-11 finished in 90 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 18 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 24 place count 15 transition count 14
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 29 place count 15 transition count 9
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 34 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 36 place count 9 transition count 8
Applied a total of 36 rules in 3 ms. Remains 9 /39 variables (removed 30) and now considering 8/31 (removed 23) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:27:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:27:10] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:27:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2021-05-17 14:27:10] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:27:10] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/39 places, 8/31 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-007008-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s6 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-12 finished in 99 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 19 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 20
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 27 place count 13 transition count 13
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 5 rules applied. Total rules applied 32 place count 13 transition count 8
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 37 place count 8 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 37 place count 8 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 39 place count 7 transition count 7
Applied a total of 39 rules in 4 ms. Remains 7 /39 variables (removed 32) and now considering 7/31 (removed 24) transitions.
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 19 ms to find 0 implicit places.
[2021-05-17 14:27:10] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2021-05-17 14:27:10] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/39 places, 7/31 transitions.
Stuttering acceptance computed with spot in 56 ms :[p0, p0]
Running random walk in product with property : RefineWMG-PT-007008-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007008-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-13 finished in 117 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007008-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}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)), p0:(AND (GEQ s0 1) (GEQ s36 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 8531 reset in 167 ms.
Stack based approach found an accepted trace after 19 steps with 3 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RefineWMG-PT-007008-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-14 finished in 435 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((p0 U !p1)&&X(G((F(!p3)&&p2))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 39 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:27:10] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:27:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) p3 p1), p1, (OR (NOT p2) p3), p3]
Running random walk in product with property : RefineWMG-PT-007008-15 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}, { cond=(OR (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p2 p3), acceptance={} source=2 dest: 3}], [{ cond=p3, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LT s16 1) (LT s17 1) (LT s19 1)), p0:(AND (GEQ s0 1) (GEQ s36 1) (GEQ s37 1)), p2:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s19 1)), p3:(LT s28 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 554 reset in 276 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA RefineWMG-PT-007008-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007008-15 finished in 675 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621261631849

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

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