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-165281598700020.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-00005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-oct2-165281598700020
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 236K
-rw-r--r-- 1 mcc users 6.8K Apr 29 13:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Apr 29 13:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 13:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 3.7K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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-00005-LTLFireability-00
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-01
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-02
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-03
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-04
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-05
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-06
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-07
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-08
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-09
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-10
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-11
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-12
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-13
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-14
FORMULA_NAME RobotManipulation-PT-00005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652943895033

Running Version 202205111006
[2022-05-19 07:04:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 07:04:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 07:04:56] [INFO ] Load time of PNML (sax parser for PT used): 36 ms
[2022-05-19 07:04:56] [INFO ] Transformed 15 places.
[2022-05-19 07:04:56] [INFO ] Transformed 11 transitions.
[2022-05-19 07:04:56] [INFO ] Parsed PT model containing 15 places and 11 transitions in 128 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RobotManipulation-PT-00005-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00005-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 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 6 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:04:56] [INFO ] Computed 6 place invariants in 6 ms
[2022-05-19 07:04:56] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:04:56] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 07:04:56] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2022-05-19 07:04:56] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-19 07:04:56] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
Support contains 15 out of 15 places after structural reductions.
[2022-05-19 07:04:56] [INFO ] Flatten gal took : 12 ms
[2022-05-19 07:04:56] [INFO ] Flatten gal took : 3 ms
[2022-05-19 07:04:56] [INFO ] Input system was already deterministic with 11 transitions.
Finished random walk after 2979 steps, including 0 resets, run visited all 16 properties in 39 ms. (steps per millisecond=76 )
FORMULA RobotManipulation-PT-00005-LTLFireability-05 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' '!((X(F((G(p0)||G(F(p1))||(G(p3)&&p2)))) U p3))'
Support contains 5 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. 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 10 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:04:57] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:04:57] [INFO ] Implicit Places using invariants in 25 ms returned [8]
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 0 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 361 ms :[(NOT p3), (OR (NOT p3) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p3 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p3 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 4}, { cond=(AND p3 p2), acceptance={} source=2 dest: 5}], [{ cond=(OR (AND (NOT p3) p0 (NOT p1)) (AND p0 (NOT p1) (NOT p2))), acceptance={1} source=3 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p3 p0 (NOT p1) p2), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p1) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) p0 (NOT p1)), acceptance={1} source=4 dest: 3}, { cond=(AND (NOT p3) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p3 p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (GEQ s9 1) (GEQ s10 1)), p2:(AND (GEQ s9 1) (GEQ s10 1)), p1:(AND (GEQ s1 1) (GEQ s4 1)), p0:(GEQ s7 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 5325 reset in 186 ms.
Stack based approach found an accepted trace after 183 steps with 9 reset with depth 10 and stack size 10 in 1 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-00 finished in 651 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0) U (p1&&G(!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 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:04:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:04:57] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:04:57] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:04:57] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2022-05-19 07:04:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:04:57] [INFO ] Dead Transitions using invariants and state equation in 23 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 154 ms :[(OR (NOT p1) p2), p0, p2, true, (AND p2 (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND p2 p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s11 1), p2:(AND (GEQ s7 1) (GEQ s10 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 487 steps with 50 reset in 1 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-01 finished in 256 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p0))&&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:04:57] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:04:57] [INFO ] Implicit Places using invariants in 24 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 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:04:57] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:04:58] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:04:58] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 07:04:58] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 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 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ 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, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-02 finished in 218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||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 3 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:04:58] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:04:58] [INFO ] Implicit Places using invariants in 28 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 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 4 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 7 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:04:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:04:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:04:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:04:58] [INFO ] Implicit Places using invariants and state equation in 18 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 25 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 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 24964 reset in 68 ms.
Product exploration explored 100000 steps with 24941 reset in 94 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 (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:04:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:04:58] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2022-05-19 07:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:04:58] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2022-05-19 07:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:04:58] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2022-05-19 07:04:58] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-19 07:04:58] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:04:58] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:04:58] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:04:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:04:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2022-05-19 07:04:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:04:58] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:04:58] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 5/5 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Finished random walk after 13 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=13 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:04:59] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-19 07:04:59] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2022-05-19 07:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 07:04:59] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2022-05-19 07:04:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:04:59] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-19 07:04:59] [INFO ] Computed and/alt/rep : 4/5/4 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-19 07:04:59] [INFO ] Added : 0 causal constraints over 0 iterations in 15 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 25074 reset in 81 ms.
Product exploration explored 100000 steps with 25093 reset in 108 ms.
Built C files in :
/tmp/ltsmin15502018085387027072
[2022-05-19 07:04:59] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-19 07:04:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:04:59] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-19 07:04:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:04:59] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-19 07:04:59] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 07:04:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15502018085387027072
Running compilation step : cd /tmp/ltsmin15502018085387027072;'/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 160 ms.
Running link step : cd /tmp/ltsmin15502018085387027072;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15502018085387027072;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3910438251208772530.hoa' '--buchi-type=spotba'
LTSmin run took 54 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-00005-LTLFireability-04 finished in 1553 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(X(p0)))&&X((X(p1)||p2)))))'
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 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:04:59] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:04:59] [INFO ] Implicit Places using invariants in 34 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 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 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), (NOT p0), true]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(LT s9 1), p0:(AND (GEQ s1 1) (GEQ s5 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 5387 reset in 62 ms.
Stack based approach found an accepted trace after 113 steps with 5 reset with depth 12 and stack size 12 in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-06 finished in 284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G(p0)||(X(!p0)&&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 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 1 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:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 26 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 27 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 1 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 156 ms :[true, (AND (NOT p0) (NOT p1)), (OR (NOT p1) p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(GEQ s9 1), p1:(AND (GEQ s2 1) (GEQ 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-08 finished in 202 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))&&((p1 U (F(p0)&&p2))||p3))))'
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 15/15 places, 11/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 15 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Applied a total of 2 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 14 cols
[2022-05-19 07:05:00] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 23 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 SI_LTL mode, iteration 1 : 12/15 places, 10/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 12 transition count 9
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 11 transition count 9
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 4 place count 10 transition count 9
Applied a total of 4 rules in 2 ms. Remains 10 /12 variables (removed 2) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 07:05:00] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2022-05-19 07:05:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/15 places, 9/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 10/15 places, 9/11 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(OR p3 p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(OR (AND p3 (NOT p0)) (AND p2 (NOT p0)) (AND (NOT p0) p1)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND p3 (NOT p2) (NOT p0) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(AND (GEQ s8 1) (GEQ s9 1)), p2:(AND (GEQ s8 1) (GEQ s9 1)), p1:(AND (GEQ s2 1) (GEQ s6 1)), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 385 reset in 117 ms.
Stack based approach found an accepted trace after 144 steps with 1 reset with depth 73 and stack size 71 in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-09 finished in 379 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(F(!(p0 U !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 1 places :
Implicit places reduction removed 1 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 3 rules applied. Total rules applied 3 place count 14 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 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 2 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 3 ms. Remains 11 /15 variables (removed 4) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 11 cols
[2022-05-19 07:05:00] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 23 ms returned [4, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/15 places, 8/11 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 2 place count 8 transition count 7
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 4 place count 7 transition count 7
Applied a total of 4 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 07:05:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 7 rows 7 cols
[2022-05-19 07:05:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/15 places, 7/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/15 places, 7/11 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s6 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18717 reset in 52 ms.
Stack based approach found an accepted trace after 109 steps with 20 reset with depth 6 and stack size 6 in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-10 finished in 191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!((p0 U p1)&&(F(p0)||p2)) U p0))'
Support contains 3 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 1 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:00] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 21 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 SI_LTL mode, iteration 1 : 10/15 places, 9/11 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 8
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 9 transition count 8
Applied a total of 2 rules in 1 ms. Remains 9 /10 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 9 cols
[2022-05-19 07:05:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 8 rows 9 cols
[2022-05-19 07:05:00] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/15 places, 8/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 9/15 places, 8/11 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), true]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s6 1), p1:(AND (GEQ s0 1) (GEQ s4 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, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-11 finished in 127 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(!p0 U X(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 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 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 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 3 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2022-05-19 07:05:00] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 21 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/15 places, 6/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5 transition count 5
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5 transition count 5
Applied a total of 3 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 07:05:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2022-05-19 07:05:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:00] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/15 places, 5/11 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 62 ms :[p0, p0]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5034 reset in 90 ms.
Stack based approach found an accepted trace after 49 steps with 4 reset with depth 9 and stack size 8 in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-12 finished in 216 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))&&p0))))'
Support contains 2 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:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants in 23 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 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 0 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:01] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2022-05-19 07:05:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 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 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(AND (GEQ s3 1) (GEQ 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6399 reset in 68 ms.
Stack based approach found an accepted trace after 146 steps with 10 reset with depth 32 and stack size 32 in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-13 finished in 306 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 2 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:01] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants in 24 ms returned [4, 6]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 25 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 2 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:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-19 07:05:01] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 07:05:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants and state equation in 22 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 37 ms :[(NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-14 finished in 122 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(((!X(F(p1))&&p0) U (G(p2)||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 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:01] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants in 19 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 20 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 0 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:01] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2022-05-19 07:05:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 07:05:01] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 37 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 210 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, p1, (NOT p2), (AND (NOT p1) (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-00005-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p1 p2), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(GEQ s7 1), p0:(AND (GEQ s9 1) (GEQ s7 1)), p2:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00005-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00005-LTLFireability-15 finished in 285 ms.
All properties solved by simple procedures.
Total runtime 5759 ms.

BK_STOP 1652943901894

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

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