Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281598700028.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/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 RobotManipulation-PT-00010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281598700028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 284K
-rw-r--r-- 1 mcc users 9.6K Apr 29 13:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 29 13:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 29 13:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 9 08:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.4K May 10 09:34 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 RobotManipulation-PT-00010-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-00010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652943902945

Running Version 202205111006
[2022-05-19 07:05:03] [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-19 07:05:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:05:04] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2022-05-19 07:05:04] [INFO ] Transformed 15 places.
[2022-05-19 07:05:04] [INFO ] Transformed 11 transitions.
[2022-05-19 07:05:04] [INFO ] Parsed PT model containing 15 places and 11 transitions in 131 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 3 formulas.
FORMULA RobotManipulation-PT-00010-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 8 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:04] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-19 07:05:04] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:04] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-19 07:05:04] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:05:04] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-19 07:05:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
Support contains 14 out of 15 places after structural reductions.
[2022-05-19 07:05:04] [INFO ] Flatten gal took : 12 ms
[2022-05-19 07:05:04] [INFO ] Flatten gal took : 4 ms
[2022-05-19 07:05:04] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 254 steps, including 0 resets, run visited all 12 properties in 16 ms. (steps per millisecond=15 )
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' '!(F(G(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction 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 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
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 2 with 2 rules applied. Total rules applied 10 place count 9 transition count 7
Applied a total of 10 rules in 8 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-19 07:05:04] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:04] [INFO ] Implicit Places using invariants in 30 ms returned [4, 7, 8]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 32 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 7/11 transitions.
Graph (trivial) has 5 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 3 transition count 4
Applied a total of 3 rules in 4 ms. Remains 3 /6 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2022-05-19 07:05:04] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-19 07:05:04] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 4 rows 3 cols
[2022-05-19 07:05:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 07:05:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/15 places, 4/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 3/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-00 finished in 273 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&F(F((X(!p0)||p1)))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:05] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:05] [INFO ] Implicit Places using invariants in 28 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:05] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:05:05] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:05] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:05] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s4 1)), p1:(OR (LT s3 1) (LT s5 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][false, false, false, false]]
Product exploration explored 100000 steps with 3913 reset in 195 ms.
Stack based approach found an accepted trace after 5096 steps with 194 reset with depth 260 and stack size 258 in 7 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-02 finished in 474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(X(p0))))&&F(F(G(p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 12 transition count 10
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 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Applied a total of 6 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 11 cols
[2022-05-19 07:05:05] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:05] [INFO ] Implicit Places using invariants in 23 ms returned [9, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 9/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 9
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 8 cols
[2022-05-19 07:05:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:05] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 9 rows 8 cols
[2022-05-19 07:05:05] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/15 places, 9/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 8/15 places, 9/11 transitions.
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s7 1), p0:(OR (LT s0 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-04 finished in 334 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(p0))))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:05] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:05] [INFO ] Implicit Places using invariants in 22 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 24 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 16 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-06 finished in 141 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G((X((G(p0)||p1))||p2)))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:05:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:05:06] [INFO ] Implicit Places using invariants in 22 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(GEQ s9 1), p1:(AND (GEQ s0 1) (GEQ s4 1)), p0:(AND (GEQ s10 1) (GEQ s11 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 102 ms.
Stack based approach found an accepted trace after 1683 steps with 0 reset with depth 1684 and stack size 1662 in 3 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-07 finished in 253 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (X(F(p1)) U X(X(p2)))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 0 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2022-05-19 07:05:06] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:05:06] [INFO ] Implicit Places using invariants in 21 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:06] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-19 07:05:06] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:06] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:06] [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.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=p0, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(GEQ s10 1), p1:(AND (GEQ s0 1) (GEQ s4 1)), p2:(AND (GEQ s2 1) (GEQ s8 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, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 6431 reset in 88 ms.
Stack based approach found an accepted trace after 205 steps with 15 reset with depth 8 and stack size 8 in 1 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-08 finished in 532 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(p0))))'
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:06] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:06] [INFO ] Implicit Places using invariants in 20 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 21 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:05:06] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:06] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:05:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 11/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s3 1) (LT s5 1) (AND (GEQ s0 1) (GEQ s4 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 57 ms.
Product exploration explored 100000 steps with 33333 reset in 59 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-00010-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00010-LTLFireability-09 finished in 387 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:07] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:07] [INFO ] Implicit Places using invariants in 27 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 29 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:07] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:05:07] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s5 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 62 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-00010-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00010-LTLFireability-10 finished in 321 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 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 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 11 transition count 7
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 10 place count 9 transition count 7
Applied a total of 10 rules in 2 ms. Remains 9 /15 variables (removed 6) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 9 cols
[2022-05-19 07:05:07] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:07] [INFO ] Implicit Places using invariants in 25 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/15 places, 7/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 7 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 4 transition count 4
Applied a total of 6 rules in 2 ms. Remains 4 /7 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 4 cols
[2022-05-19 07:05:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:07] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2022-05-19 07:05:07] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:07] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/15 places, 4/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/15 places, 4/11 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 57 ms.
Product exploration explored 100000 steps with 50000 reset in 91 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 : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA RobotManipulation-PT-00010-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RobotManipulation-PT-00010-LTLFireability-11 finished in 360 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(G((G((X(G(!(X(p1) U p2)))||p0))&&!p2)))))'
Support contains 2 out of 15 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
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 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Applied a total of 5 rules in 2 ms. Remains 12 /15 variables (removed 3) and now considering 9/11 (removed 2) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-19 07:05:07] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:05:07] [INFO ] Implicit Places using invariants in 25 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 26 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/15 places, 9/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 9/9 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 9/11 transitions.
Stuttering acceptance computed with spot in 50 ms :[p2]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 122 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-12 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p0) U (F(p1)&&p0)))&&X(G(p1)))))'
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:08] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants in 26 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 11/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 10 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 10
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:08] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:08] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/15 places, 10/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s9 1), p1:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-13 finished in 252 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!G(F((G(p0)&&p1))) U G(X(p2))))'
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 0 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:05:08] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:08] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13/15 places, 11/11 transitions.
Finished structural reductions, in 1 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 208 ms :[p2, p2, p2, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s7 1) (GEQ s10 1)), p1:(GEQ s6 1), p0:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 7443 reset in 105 ms.
Stack based approach found an accepted trace after 35 steps with 2 reset with depth 18 and stack size 18 in 0 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-14 finished in 402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 14 transition count 8
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 11 transition count 8
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 2 with 2 rules applied. Total rules applied 9 place count 10 transition count 7
Applied a total of 9 rules in 1 ms. Remains 10 /15 variables (removed 5) and now considering 7/11 (removed 4) transitions.
// Phase 1: matrix 7 rows 10 cols
[2022-05-19 07:05:08] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants in 28 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/15 places, 7/11 transitions.
Graph (trivial) has 3 edges and 8 vertex of which 2 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
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 0 with 2 rules applied. Total rules applied 3 place count 6 transition count 5
Applied a total of 3 rules in 0 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:05:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:05:08] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:05:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/15 places, 5/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00010-LTLFireability-15 automaton TGBA Formula[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:(OR (LT s4 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00010-LTLFireability-15 finished in 142 ms.
All properties solved by simple procedures.
Total runtime 4982 ms.

BK_STOP 1652943908975

--------------------
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="RobotManipulation-PT-00010"
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 RobotManipulation-PT-00010, 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 r204-oct2-165281598700028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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