Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110500564.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FMS-PT-00500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110500564
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.8K Apr 30 02:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 30 02:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Apr 30 02:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 30 02:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 16K May 10 09:33 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 FMS-PT-00500-LTLFireability-00
FORMULA_NAME FMS-PT-00500-LTLFireability-01
FORMULA_NAME FMS-PT-00500-LTLFireability-02
FORMULA_NAME FMS-PT-00500-LTLFireability-03
FORMULA_NAME FMS-PT-00500-LTLFireability-04
FORMULA_NAME FMS-PT-00500-LTLFireability-05
FORMULA_NAME FMS-PT-00500-LTLFireability-06
FORMULA_NAME FMS-PT-00500-LTLFireability-07
FORMULA_NAME FMS-PT-00500-LTLFireability-08
FORMULA_NAME FMS-PT-00500-LTLFireability-09
FORMULA_NAME FMS-PT-00500-LTLFireability-10
FORMULA_NAME FMS-PT-00500-LTLFireability-11
FORMULA_NAME FMS-PT-00500-LTLFireability-12
FORMULA_NAME FMS-PT-00500-LTLFireability-13
FORMULA_NAME FMS-PT-00500-LTLFireability-14
FORMULA_NAME FMS-PT-00500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652689961757

Running Version 202205111006
[2022-05-16 08:32:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 08:32:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 08:32:43] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2022-05-16 08:32:43] [INFO ] Transformed 22 places.
[2022-05-16 08:32:43] [INFO ] Transformed 20 transitions.
[2022-05-16 08:32:43] [INFO ] Parsed PT model containing 22 places and 20 transitions in 139 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA FMS-PT-00500-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-00500-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:43] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-16 08:32:43] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:43] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:43] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 08:32:43] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Support contains 21 out of 22 places after structural reductions.
[2022-05-16 08:32:43] [INFO ] Flatten gal took : 15 ms
[2022-05-16 08:32:43] [INFO ] Flatten gal took : 4 ms
[2022-05-16 08:32:43] [INFO ] Input system was already deterministic with 20 transitions.
Support contains 20 out of 22 places (down from 21) after GAL structural reductions.
Finished random walk after 5791 steps, including 1 resets, run visited all 19 properties in 35 ms. (steps per millisecond=165 )
FORMULA FMS-PT-00500-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(X((X(p1)||p2))&&X(p0))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:43] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:43] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:43] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:44] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 376 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(LT s0 1), p2:(LT s16 1), p1:(OR (LT s2 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 127 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p0), (X (NOT (AND p0 (NOT p2)))), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p2))))
Knowledge based reduction with 7 factoid took 139 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-00500-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00500-LTLFireability-00 finished in 956 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p1)))&&p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:44] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:44] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:44] [INFO ] Computed 6 place invariants in 5 ms
[2022-05-16 08:32:44] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:44] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:44] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 6}, { cond=p0, acceptance={0} source=2 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 5}], [{ cond=p0, acceptance={0} source=5 dest: 2}, { cond=(NOT p0), acceptance={0} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 7}]], initial=4, aps=[p0:(AND (GEQ s9 1) (LT s0 1)), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5865 reset in 192 ms.
Stack based approach found an accepted trace after 32 steps with 1 reset with depth 20 and stack size 20 in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLFireability-02 finished in 607 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p1))&&p0))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:45] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s13 1) (GEQ s15 1)), p1:(AND (GEQ s13 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-05 finished in 459 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(!(p1 U !p0)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:45] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:45] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:45] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:45] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s9 1), p0:(LT s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9 reset in 139 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA FMS-PT-00500-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-00500-LTLFireability-06 finished in 330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(G(p1)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 8 edges and 15 vertex of which 3 / 15 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
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 10 rules applied. Total rules applied 15 place count 13 transition count 13
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 9 transition count 9
Applied a total of 23 rules in 16 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 08:32:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 08:32:46] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 08:32:46] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-16 08:32:46] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-16 08:32:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 9 cols
[2022-05-16 08:32:46] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-16 08:32:46] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 9/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=2 dest: 1}, { cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s4 1)), p1:(AND (GEQ s4 1) (GEQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-07 finished in 237 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(X(p0)) U !F(p1))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 12 place count 12 transition count 15
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 18 place count 10 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 18 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 23 place count 7 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 24 place count 7 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 24 place count 7 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 27 place count 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 4 transition count 6
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 4 transition count 6
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 4 transition count 5
Applied a total of 30 rules in 8 ms. Remains 4 /22 variables (removed 18) and now considering 5/20 (removed 15) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 08:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 08:32:46] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 08:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 08:32:46] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2022-05-16 08:32:46] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-16 08:32:46] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-16 08:32:46] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 5/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 5/20 transitions.
Stuttering acceptance computed with spot in 63 ms :[p1, (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s0 1), p0:(LT s2 1)], 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 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-00500-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-08 finished in 141 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0)) U (p1 U X(p2)))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:46] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:46] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:46] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:46] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Running random walk in product with property : FMS-PT-00500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s1 1), p2:(GEQ s20 1), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 40044 reset in 133 ms.
Product exploration explored 100000 steps with 40064 reset in 108 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Incomplete random walk after 10204 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=537 ) properties (out of 4) seen :3
Finished Best-First random walk after 1299 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=259 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 299 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:48] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:48] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:48] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:48] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:48] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 08:32:48] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 220 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Incomplete random walk after 10050 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=913 ) properties (out of 4) seen :2
Finished Best-First random walk after 559 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=139 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 6 factoid took 322 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 39897 reset in 75 ms.
Product exploration explored 100000 steps with 40059 reset in 81 ms.
Applying partial POR strategy [false, true, false, true]
Stuttering acceptance computed with spot in 132 ms :[(NOT p2), (AND (NOT p2) (NOT p0)), (NOT p2), (NOT p0)]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 4 place count 22 transition count 20
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 22 transition count 23
Deduced a syphon composed of 8 places in 1 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 22 transition count 21
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 10 rules in 8 ms. Remains 22 /22 variables (removed 0) and now considering 21/20 (removed -1) transitions.
[2022-05-16 08:32:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 22 cols
[2022-05-16 08:32:49] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-16 08:32:49] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 21/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 21/20 transitions.
Product exploration explored 100000 steps with 39985 reset in 169 ms.
Product exploration explored 100000 steps with 40066 reset in 125 ms.
Built C files in :
/tmp/ltsmin1366328956061731323
[2022-05-16 08:32:50] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1366328956061731323
Running compilation step : cd /tmp/ltsmin1366328956061731323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 174 ms.
Running link step : cd /tmp/ltsmin1366328956061731323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1366328956061731323;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13232946709363596627.hoa' '--buchi-type=spotba'
LTSmin run took 1694 ms.
FORMULA FMS-PT-00500-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-00500-LTLFireability-09 finished in 5493 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X(G(X(p0)))||G(X(F(p1)))) U !X(p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:52] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:52] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:52] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:52] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 223 ms :[p2, p2, (OR p2 (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FMS-PT-00500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s12 1), p0:(GEQ s3 1), p1:(AND (GEQ s5 1) (GEQ s7 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 46 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 5 factoid took 132 ms. Reduced automaton from 6 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-00500-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00500-LTLFireability-10 finished in 581 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(X(p0)))||G(p1)||p2)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:52] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:52] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:52] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:52] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-00500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (LT s19 1) (OR (LT s8 1) (LT s10 1))), p2:(LT s11 1), p1:(OR (LT s8 1) (LT s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Product exploration explored 100000 steps with 50000 reset in 66 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 4 factoid took 142 ms. Reduced automaton from 6 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FMS-PT-00500-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FMS-PT-00500-LTLFireability-11 finished in 575 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||(G(X(p2))&&X(p3))))'
Support contains 5 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:53] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:53] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:53] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-16 08:32:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 20 rows 22 cols
[2022-05-16 08:32:53] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-16 08:32:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-00500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p3 p2), acceptance={} source=4 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p2))), acceptance={} source=5 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p3)) (AND (NOT p1) p0 (NOT p2))), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p3 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s17 1)) (LT s20 1)), p0:(GEQ s11 1), p2:(GEQ s6 1), p3:(GEQ s20 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-13 finished in 325 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(F(p0)) U !p0))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 11 edges and 16 vertex of which 9 / 16 are part of one of the 3 SCC in 0 ms
Free SCC test removed 6 places
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 10 transition count 16
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 18 place count 9 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 18 place count 9 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 20 place count 8 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 22 place count 7 transition count 8
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 7 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 24 place count 7 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 29 place count 4 transition count 4
Applied a total of 29 rules in 6 ms. Remains 4 /22 variables (removed 18) and now considering 4/20 (removed 16) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 08:32:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 08:32:53] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 08:32:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 08:32:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2022-05-16 08:32:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-16 08:32:53] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-16 08:32:53] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 4/20 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/22 places, 4/20 transitions.
Stuttering acceptance computed with spot in 76 ms :[p0, p0]
Running random walk in product with property : FMS-PT-00500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1))], 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 11 steps with 0 reset in 1 ms.
FORMULA FMS-PT-00500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-00500-LTLFireability-15 finished in 159 ms.
All properties solved by simple procedures.
Total runtime 10869 ms.

BK_STOP 1652689973849

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="FMS-PT-00500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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