fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089416100628
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for RefineWMG-PT-010010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
433.535 12200.00 24535.00 105.40 FTFTFTFFTTFTFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 136K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K 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 2.9K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.7K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 25 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 25 14:01 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 24K 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-010010-00
FORMULA_NAME RefineWMG-PT-010010-01
FORMULA_NAME RefineWMG-PT-010010-02
FORMULA_NAME RefineWMG-PT-010010-03
FORMULA_NAME RefineWMG-PT-010010-04
FORMULA_NAME RefineWMG-PT-010010-05
FORMULA_NAME RefineWMG-PT-010010-06
FORMULA_NAME RefineWMG-PT-010010-07
FORMULA_NAME RefineWMG-PT-010010-08
FORMULA_NAME RefineWMG-PT-010010-09
FORMULA_NAME RefineWMG-PT-010010-10
FORMULA_NAME RefineWMG-PT-010010-11
FORMULA_NAME RefineWMG-PT-010010-12
FORMULA_NAME RefineWMG-PT-010010-13
FORMULA_NAME RefineWMG-PT-010010-14
FORMULA_NAME RefineWMG-PT-010010-15

=== Now, execution of the tool begins

BK_START 1621261680308

Running Version 0
[2021-05-17 14:28:02] [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:28:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 14:28:02] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-05-17 14:28:02] [INFO ] Transformed 54 places.
[2021-05-17 14:28:02] [INFO ] Transformed 43 transitions.
[2021-05-17 14:28:02] [INFO ] Parsed PT model containing 54 places and 43 transitions in 64 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:28:02] [INFO ] Initial state test concluded for 2 properties.
FORMULA RefineWMG-PT-010010-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-010010-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 12 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:02] [INFO ] Computed 22 place invariants in 6 ms
[2021-05-17 14:28:02] [INFO ] Dead Transitions using invariants and state equation in 121 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:02] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:02] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:02] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:28:02] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:02] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:02] [INFO ] Dead Transitions using invariants and state equation in 60 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
[2021-05-17 14:28:02] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-17 14:28:02] [INFO ] Flatten gal took : 32 ms
FORMULA RefineWMG-PT-010010-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-17 14:28:02] [INFO ] Flatten gal took : 17 ms
[2021-05-17 14:28:02] [INFO ] Input system was already deterministic with 43 transitions.
Incomplete random walk after 100007 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=649 ) properties (out of 21) seen :19
Running SMT prover for 2 properties.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:02] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:02] [INFO ] [Real]Absence check using 22 positive place invariants in 7 ms returned sat
[2021-05-17 14:28:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:28:03] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2021-05-17 14:28:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:28:03] [INFO ] [Nat]Absence check using 22 positive place invariants in 5 ms returned sat
[2021-05-17 14:28:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:28:03] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2021-05-17 14:28:03] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 14:28:03] [INFO ] Added : 22 causal constraints over 5 iterations in 29 ms. Result :sat
[2021-05-17 14:28:03] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2021-05-17 14:28:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 14:28:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-17 14:28:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 14:28:03] [INFO ] [Nat]Absence check using 22 positive place invariants in 3 ms returned sat
[2021-05-17 14:28:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 14:28:03] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2021-05-17 14:28:03] [INFO ] Computed and/alt/rep : 32/42/32 causal constraints (skipped 0 transitions) in 3 ms.
[2021-05-17 14:28:03] [INFO ] Added : 22 causal constraints over 5 iterations in 25 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U p1))], workingDir=/home/mcc/execution]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 28 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 2 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 34 place count 18 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 37 place count 18 transition count 13
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 41 place count 15 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 14 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 4 with 2 rules applied. Total rules applied 44 place count 13 transition count 11
Applied a total of 44 rules in 13 ms. Remains 13 /54 variables (removed 41) and now considering 11/43 (removed 32) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:28:03] [INFO ] Computed 4 place invariants in 3 ms
[2021-05-17 14:28:03] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:28:03] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-17 14:28:03] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:28:03] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:28:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2021-05-17 14:28:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2021-05-17 14:28:03] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-17 14:28:03] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/54 places, 11/43 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s9 s11), p0:(AND (LEQ s0 s5) (GT s9 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 2 ms.
FORMULA RefineWMG-PT-010010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-00 finished in 357 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((F(p0)&&(p1||X(p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:03] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:03] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:03] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 14:28:03] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:03] [INFO ] Computed 22 place invariants in 2 ms
[2021-05-17 14:28:03] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:03] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s2 s33), p1:(GT 1 s3)], 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][false, false, false]]
Product exploration explored 100000 steps with 47827 reset in 218 ms.
Product exploration explored 100000 steps with 47848 reset in 158 ms.
Knowledge obtained : [p0, p1]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 47837 reset in 132 ms.
Product exploration explored 100000 steps with 47839 reset in 184 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 3 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 28 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 19 place count 36 transition count 26
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 19 rules in 10 ms. Remains 36 /54 variables (removed 18) and now considering 26/43 (removed 17) transitions.
// Phase 1: matrix 26 rows 36 cols
[2021-05-17 14:28:05] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 14:28:05] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
[2021-05-17 14:28:05] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 26 rows 36 cols
[2021-05-17 14:28:05] [INFO ] Computed 13 place invariants in 1 ms
[2021-05-17 14:28:05] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 36/54 places, 26/43 transitions.
Product exploration explored 100000 steps with 47795 reset in 185 ms.
Product exploration explored 100000 steps with 47807 reset in 174 ms.
[2021-05-17 14:28:05] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:28:05] [INFO ] Flatten gal took : 3 ms
[2021-05-17 14:28:05] [INFO ] Time to serialize gal into /tmp/LTL5681781128432500001.gal : 6 ms
[2021-05-17 14:28:05] [INFO ] Time to serialize properties into /tmp/LTL12198023772791538623.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/LTL5681781128432500001.gal, -t, CGAL, -LTL, /tmp/LTL12198023772791538623.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/LTL5681781128432500001.gal -t CGAL -LTL /tmp/LTL12198023772791538623.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((F("(psecond>p30)"))&&(("(pterce<1)")||(X("(psecond>p30)")))))))
Formula 0 simplified : !XF(F"(psecond>p30)" & ("(pterce<1)" | X"(psecond>p30)"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
38 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.400315,28064,1,0,8,63998,26,0,1615,78860,14
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-010010-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property RefineWMG-PT-010010-01 finished in 2378 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-02 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:(LEQ s18 s48)], 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 13 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-02 finished in 255 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
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 41 place count 16 transition count 11
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 46 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 47 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 47 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 51 place count 9 transition count 8
Applied a total of 51 rules in 4 ms. Remains 9 /54 variables (removed 45) and now considering 8/43 (removed 35) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-17 14:28:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/54 places, 8/43 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s5)], 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 10 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-04 finished in 149 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 7 rules applied. Total rules applied 44 place count 16 transition count 8
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 51 place count 9 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 8 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 7 transition count 6
Applied a total of 55 rules in 4 ms. Remains 7 /54 variables (removed 47) and now considering 6/43 (removed 37) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants and state equation in 12 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
[2021-05-17 14:28:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-17 14:28:06] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/54 places, 6/43 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GT 2 s5)], 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 12 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-06 finished in 125 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 36 place count 18 transition count 17
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 38 place count 18 transition count 15
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 16 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 42 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 42 place count 15 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 46 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 4 with 2 rules applied. Total rules applied 48 place count 12 transition count 11
Applied a total of 48 rules in 12 ms. Remains 12 /54 variables (removed 42) and now considering 11/43 (removed 32) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:28:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:28:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:28:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 25 ms to find 0 implicit places.
[2021-05-17 14:28:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 11 rows 12 cols
[2021-05-17 14:28:06] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 12/54 places, 11/43 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-07 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GT s6 s9), p0:(LEQ 3 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 50 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-07 finished in 154 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:06] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:06] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010010-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(LEQ s15 s8), p0:(LEQ 3 s34)], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 122 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 121 ms.
Product exploration explored 100000 steps with 50000 reset in 117 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 54 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 27 edges and 54 vertex of which 18 / 54 are part of one of the 9 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 36 transition count 26
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 18 place count 36 transition count 26
Deduced a syphon composed of 9 places in 0 ms
Applied a total of 18 rules in 5 ms. Remains 36 /54 variables (removed 18) and now considering 26/43 (removed 17) transitions.
// Phase 1: matrix 26 rows 36 cols
[2021-05-17 14:28:07] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 14:28:07] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
[2021-05-17 14:28:07] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 26 rows 36 cols
[2021-05-17 14:28:07] [INFO ] Computed 13 place invariants in 0 ms
[2021-05-17 14:28:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 1 iterations. Remains : 36/54 places, 26/43 transitions.
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Product exploration explored 100000 steps with 50000 reset in 365 ms.
[2021-05-17 14:28:08] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:28:08] [INFO ] Flatten gal took : 4 ms
[2021-05-17 14:28:08] [INFO ] Time to serialize gal into /tmp/LTL3785366035816937582.gal : 2 ms
[2021-05-17 14:28:08] [INFO ] Time to serialize properties into /tmp/LTL5335342171195623573.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/LTL3785366035816937582.gal, -t, CGAL, -LTL, /tmp/LTL5335342171195623573.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/LTL3785366035816937582.gal -t CGAL -LTL /tmp/LTL5335342171195623573.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p31>=3)")||(F("(p12<=p5)")))))
Formula 0 simplified : !X("(p31>=3)" | F"(p12<=p5)")
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
84 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.872714,27908,1,0,6,63998,18,0,1605,78860,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA RefineWMG-PT-010010-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property RefineWMG-PT-010010-09 finished in 2866 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(G(p0)) U p1)&&G(F(p2))))], workingDir=/home/mcc/execution]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 25 edges and 54 vertex of which 16 / 54 are part of one of the 8 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 38 transition count 28
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 35 place count 20 transition count 19
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 40 place count 20 transition count 14
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 45 place count 15 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 45 place count 15 transition count 12
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 49 place count 13 transition count 12
Applied a total of 49 rules in 8 ms. Remains 13 /54 variables (removed 41) and now considering 12/43 (removed 31) transitions.
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:28:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:28:09] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:28:09] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-17 14:28:09] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:28:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:28:09] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2021-05-17 14:28:09] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 12 rows 13 cols
[2021-05-17 14:28:09] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-17 14:28:09] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 13/54 places, 12/43 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (NOT p1), (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-010010-10 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 2 s5), p2:(LEQ s8 s6), p0:(LEQ s11 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-010010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-10 finished in 337 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:09] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:10] [INFO ] Dead Transitions using invariants and state equation in 122 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:10] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:10] [INFO ] Computed 22 place invariants in 0 ms
[2021-05-17 14:28:10] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:10] [INFO ] Dead Transitions using invariants and state equation in 72 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-010010-12 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(LEQ 1 s33), p0:(GT 3 s13)], 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 6157 reset in 201 ms.
Stack based approach found an accepted trace after 34 steps with 1 reset with depth 28 and stack size 28 in 1 ms.
FORMULA RefineWMG-PT-010010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-12 finished in 600 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(G((G((p1||X(p2))) U p3)))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 43/43 (removed 0) transitions.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:10] [INFO ] Computed 22 place invariants in 3 ms
[2021-05-17 14:28:10] [INFO ] Dead Transitions using invariants and state equation in 52 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:10] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:10] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
// Phase 1: matrix 43 rows 54 cols
[2021-05-17 14:28:10] [INFO ] Computed 22 place invariants in 1 ms
[2021-05-17 14:28:10] [INFO ] Dead Transitions using invariants and state equation in 81 ms returned []
Finished structural reductions, in 1 iterations. Remains : 54/54 places, 43/43 transitions.
Stuttering acceptance computed with spot in 487 ms :[(OR (NOT p0) (NOT p3)), (NOT p3), (NOT p0), (AND (NOT p3) (NOT p1) (NOT p2)), (NOT p3), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-010010-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(NOT p3), acceptance={} source=0 dest: 3}, { cond=(NOT p3), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}, { cond=(NOT p3), acceptance={1} source=1 dest: 3}, { cond=(NOT p3), acceptance={0, 1} source=1 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={1} source=3 dest: 3}, { cond=p3, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={1} source=4 dest: 3}, { cond=(NOT p3), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={0, 1} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={1} source=5 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(AND (LEQ 2 s43) (LEQ 1 s19)), p3:(LEQ 2 s43), p1:(GT s14 s1), p2:(GT 2 s15)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2515 reset in 316 ms.
Stack based approach found an accepted trace after 17 steps with 3 reset with depth 10 and stack size 10 in 0 ms.
FORMULA RefineWMG-PT-010010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-14 finished in 1074 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 54 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 54/54 places, 43/43 transitions.
Graph (trivial) has 29 edges and 54 vertex of which 20 / 54 are part of one of the 10 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 34 transition count 24
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 27 rules applied. Total rules applied 37 place count 16 transition count 15
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 42 place count 16 transition count 10
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 47 place count 11 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 47 place count 11 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 49 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 51 place count 9 transition count 8
Applied a total of 51 rules in 5 ms. Remains 9 /54 variables (removed 45) and now considering 8/43 (removed 35) transitions.
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:11] [INFO ] Dead Transitions using invariants and state equation in 80 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:11] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:11] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-17 14:28:11] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 159 ms to find 0 implicit places.
[2021-05-17 14:28:11] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2021-05-17 14:28:11] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-17 14:28:11] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 9/54 places, 8/43 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-010010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6 s8)], 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 20647 steps with 0 reset in 22 ms.
FORMULA RefineWMG-PT-010010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-010010-15 finished in 389 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621261692508

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

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