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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 164K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K 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 25K 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.1K Mar 27 10:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 10:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 25 14:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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-007007-00
FORMULA_NAME RefineWMG-PT-007007-01
FORMULA_NAME RefineWMG-PT-007007-02
FORMULA_NAME RefineWMG-PT-007007-03
FORMULA_NAME RefineWMG-PT-007007-04
FORMULA_NAME RefineWMG-PT-007007-05
FORMULA_NAME RefineWMG-PT-007007-06
FORMULA_NAME RefineWMG-PT-007007-07
FORMULA_NAME RefineWMG-PT-007007-08
FORMULA_NAME RefineWMG-PT-007007-09
FORMULA_NAME RefineWMG-PT-007007-10
FORMULA_NAME RefineWMG-PT-007007-11
FORMULA_NAME RefineWMG-PT-007007-12
FORMULA_NAME RefineWMG-PT-007007-13
FORMULA_NAME RefineWMG-PT-007007-14
FORMULA_NAME RefineWMG-PT-007007-15

=== Now, execution of the tool begins

BK_START 1621261580197

Running Version 0
[2021-05-17 14:26:22] [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:26:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:26:22] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2021-05-17 14:26:22] [INFO ] Transformed 39 places.
[2021-05-17 14:26:22] [INFO ] Transformed 31 transitions.
[2021-05-17 14:26:22] [INFO ] Parsed PT model containing 39 places and 31 transitions in 84 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-17 14:26:22] [INFO ] Initial state test concluded for 1 properties.
FORMULA RefineWMG-PT-007007-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007007-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007007-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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:22] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-17 14:26:22] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:22] [INFO ] Computed 16 place invariants in 13 ms
[2021-05-17 14:26:22] [INFO ] Implicit Places using invariants in 36 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:22] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:22] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:22] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:22] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
[2021-05-17 14:26:22] [INFO ] Flatten gal took : 21 ms
FORMULA RefineWMG-PT-007007-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:26:22] [INFO ] Flatten gal took : 6 ms
[2021-05-17 14:26:22] [INFO ] Input system was already deterministic with 31 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 181 ms. (steps per millisecond=552 ) properties (out of 23) seen :22
Running SMT prover for 1 properties.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:23] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:23] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2021-05-17 14:26:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:26:23] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-17 14:26:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:26:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2021-05-17 14:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:26:23] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2021-05-17 14:26:23] [INFO ] Computed and/alt/rep : 23/30/23 causal constraints (skipped 0 transitions) in 7 ms.
[2021-05-17 14:26:23] [INFO ] Added : 15 causal constraints over 3 iterations in 43 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F((G(p1)&&X(G(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 2 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:23] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:23] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:23] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:23] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:23] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:23] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-17 14:26:23] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-007007-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=p1, acceptance={1} source=1 dest: 3}, { cond=p1, acceptance={0, 1} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0, 1} source=3 dest: 1}, { cond=p1, acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={1} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=p2, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s3), p0:(GT s25 s22), p2:(GT s5 s2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 267 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 1 ms.
FORMULA RefineWMG-PT-007007-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-00 finished in 823 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 21 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 1 with 21 rules applied. Total rules applied 28 place count 11 transition count 11
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 33 place count 11 transition count 6
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 38 place count 6 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 38 place count 6 transition count 5
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 40 place count 5 transition count 5
Applied a total of 40 rules in 20 ms. Remains 5 /39 variables (removed 34) and now considering 5/31 (removed 26) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:26:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:26:24] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:26:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 14:26:24] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-17 14:26:24] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/39 places, 5/31 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 s4)], 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 7 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-01 finished in 118 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G((X((p1 U (p2||G(p1))))||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:26:24] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:24] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : RefineWMG-PT-007007-03 automaton TGBA [mat=[[{ cond=(OR (AND (NOT p0) p2) (AND (NOT p2) p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}], [{ 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}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(OR (GT 1 s8) (GT s36 s8)), p2:(AND (GT s36 s8) (GT 3 s33)), p1:(GT 3 s33)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 227 steps with 0 reset in 3 ms.
FORMULA RefineWMG-PT-007007-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-03 finished in 309 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(!p0)&&(G(p1) U G(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 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 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 27 place count 15 transition count 11
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 12 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 30 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 34 place count 10 transition count 9
Applied a total of 34 rules in 4 ms. Remains 10 /39 variables (removed 29) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:26:24] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:26:24] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants in 9 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:26:24] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
[2021-05-17 14:26:24] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-17 14:26:24] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/39 places, 9/31 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p2) p0), p0, (NOT p2), (AND p0 (NOT p1) p2), (NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : RefineWMG-PT-007007-04 automaton TGBA [mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p2 p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(LEQ s9 s5), p1:(GT 3 s2), p0:(LEQ 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-04 finished in 295 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (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.
Graph (trivial) has 19 edges and 39 vertex of which 12 / 39 are part of one of the 6 SCC in 1 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 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 31 place count 13 transition count 9
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 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 35 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 37 place count 8 transition count 8
Applied a total of 37 rules in 7 ms. Remains 8 /39 variables (removed 31) and now considering 8/31 (removed 23) transitions.
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:26:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:26:24] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:26:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2021-05-17 14:26:24] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-17 14:26:24] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:26:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/39 places, 8/31 transitions.
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007007-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT 1 s4), p0:(GT 2 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-07 finished in 172 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(((p0&&X(p1)) U 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:26:25] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:25] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:25] [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 101 ms :[p0, p0, p0, p0, true]
Running random walk in product with property : RefineWMG-PT-007007-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ s1 s21), p1:(LEQ 3 s28)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-08 finished in 247 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F(p1)))))], 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 19 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
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 22 place count 15 transition count 13
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 24 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 13 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 26 place count 13 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 30 place count 11 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 32 place count 10 transition count 8
Applied a total of 32 rules in 3 ms. Remains 10 /39 variables (removed 29) and now considering 8/31 (removed 23) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:26:25] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:26:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:26:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:26:25] [INFO ] Implicit Places using invariants and state equation in 11 ms returned []
Implicit Place search using SMT with State Equation took 21 ms to find 0 implicit places.
[2021-05-17 14:26:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 10 cols
[2021-05-17 14:26:25] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:26:25] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/39 places, 8/31 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007007-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s3), p1:(AND (LEQ s3 s9) (LEQ 2 s6))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 33348 reset in 110 ms.
Product exploration explored 100000 steps with 33372 reset in 128 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 33211 reset in 100 ms.
Product exploration explored 100000 steps with 33489 reset in 145 ms.
[2021-05-17 14:26:26] [INFO ] Flatten gal took : 1 ms
[2021-05-17 14:26:26] [INFO ] Flatten gal took : 2 ms
[2021-05-17 14:26:26] [INFO ] Time to serialize gal into /tmp/LTL4348219612318624474.gal : 1 ms
[2021-05-17 14:26:26] [INFO ] Time to serialize properties into /tmp/LTL10914789282868568466.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4348219612318624474.gal, -t, CGAL, -LTL, /tmp/LTL10914789282868568466.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/LTL4348219612318624474.gal -t CGAL -LTL /tmp/LTL10914789282868568466.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F(("(pterce>=1)")||(G(F("((pterce<=p23)&&(p8>=2))"))))))
Formula 0 simplified : !F("(pterce>=1)" | GF"((pterce<=p23)&&(p8>=2))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
1 unique states visited
0 strongly connected components in search stack
1 transitions explored
1 items max in DFS search stack
3 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.048453,16804,1,0,6,2322,20,1,299,2510,13
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-007007-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RefineWMG-PT-007007-10 finished in 1008 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X(X(X(X(X(G(p1))))))))], 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:26:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:26] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:26] [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 254 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007007-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=true, acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 4}, { cond=p0, acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 6}], [{ cond=(NOT p0), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}], [{ cond=(NOT p0), acceptance={} source=10 dest: 11}, { cond=p0, acceptance={} source=10 dest: 12}], [{ cond=true, acceptance={} source=11 dest: 8}], [{ cond=(NOT p0), acceptance={} source=12 dest: 8}, { cond=p0, acceptance={} source=12 dest: 9}]], initial=10, aps=[p1:(GT s32 s15), p0:(LEQ s32 s14)], 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, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 124 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-11 finished in 447 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], 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.
Graph (trivial) has 13 edges and 39 vertex of which 8 / 39 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 31 transition count 24
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 21 transition count 19
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 21 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 23 place count 19 transition count 17
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 19 transition count 16
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 18 transition count 16
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 27 place count 17 transition count 15
Applied a total of 27 rules in 3 ms. Remains 17 /39 variables (removed 22) and now considering 15/31 (removed 16) transitions.
// Phase 1: matrix 15 rows 17 cols
[2021-05-17 14:26:26] [INFO ] Computed 7 place invariants in 11 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2021-05-17 14:26:26] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2021-05-17 14:26:26] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-17 14:26:26] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 15 rows 17 cols
[2021-05-17 14:26:26] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-17 14:26:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 17/39 places, 15/31 transitions.
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-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:(OR (LEQ s11 s7) (AND (LEQ s13 s6) (LEQ s16 s0)))], 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 50 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-12 finished in 251 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0) U p1)))], 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:26:27] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:27] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:27] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:27] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:27] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:27] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:27] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:27] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (LEQ 1 s9) (GT s11 s9)), p0:(GT 3 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 175 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), true, (NOT p0)]
Support contains 3 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 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: 0
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 27 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 12 rules in 3 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:26:28] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
[2021-05-17 14:26:28] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 20 rows 27 cols
[2021-05-17 14:26:28] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-17 14:26:28] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/39 places, 20/31 transitions.
Product exploration explored 100000 steps with 50000 reset in 247 ms.
Product exploration explored 100000 steps with 50000 reset in 249 ms.
[2021-05-17 14:26:28] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:26:28] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:26:28] [INFO ] Time to serialize gal into /tmp/LTL15881189548317447696.gal : 2 ms
[2021-05-17 14:26:28] [INFO ] Time to serialize properties into /tmp/LTL1689837407084933261.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/LTL15881189548317447696.gal, -t, CGAL, -LTL, /tmp/LTL1689837407084933261.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/LTL15881189548317447696.gal -t CGAL -LTL /tmp/LTL1689837407084933261.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((G("(p9<3)"))U("((p6>=1)||(p8>p6))"))))
Formula 0 simplified : !X(G"(p9<3)" U "((p6>=1)||(p8>p6))")
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
19 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.198251,22332,1,0,6,31726,21,0,1089,38011,9
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-007007-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-007007-13 finished in 2105 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(F(p0))&&F(p1)))))], 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:26:29] [INFO ] Computed 16 place invariants in 0 ms
[2021-05-17 14:26:29] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:29] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:29] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:29] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:29] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
// Phase 1: matrix 31 rows 39 cols
[2021-05-17 14:26:29] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-17 14:26:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-007007-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ s31 s18), p1:(OR (LEQ s18 s20) (LEQ s31 s18))], 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]]
Product exploration explored 100000 steps with 538 reset in 185 ms.
Stack based approach found an accepted trace after 87 steps with 0 reset with depth 88 and stack size 88 in 1 ms.
FORMULA RefineWMG-PT-007007-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-14 finished in 590 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], 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 19 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
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 22 place count 15 transition count 13
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 24 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 26 place count 13 transition count 10
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 28 place count 12 transition count 10
Applied a total of 28 rules in 3 ms. Remains 12 /39 variables (removed 27) and now considering 10/31 (removed 21) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:26:29] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:26:29] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:26:29] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:26:29] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:26:29] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:26:29] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2021-05-17 14:26:29] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-17 14:26:29] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:26:29] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/39 places, 10/31 transitions.
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007007-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(GT s10 s7), p0:(GT s4 s11)], nbAcceptance=1, 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 1 ms.
FORMULA RefineWMG-PT-007007-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-15 finished in 241 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621261590235

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

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