Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.2K Feb 25 20:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 20:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 20:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 20:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 20:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 25 20:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 20:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 20:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FMS-PT-05000-LTLFireability-00
FORMULA_NAME FMS-PT-05000-LTLFireability-01
FORMULA_NAME FMS-PT-05000-LTLFireability-02
FORMULA_NAME FMS-PT-05000-LTLFireability-03
FORMULA_NAME FMS-PT-05000-LTLFireability-04
FORMULA_NAME FMS-PT-05000-LTLFireability-05
FORMULA_NAME FMS-PT-05000-LTLFireability-06
FORMULA_NAME FMS-PT-05000-LTLFireability-07
FORMULA_NAME FMS-PT-05000-LTLFireability-08
FORMULA_NAME FMS-PT-05000-LTLFireability-09
FORMULA_NAME FMS-PT-05000-LTLFireability-10
FORMULA_NAME FMS-PT-05000-LTLFireability-11
FORMULA_NAME FMS-PT-05000-LTLFireability-12
FORMULA_NAME FMS-PT-05000-LTLFireability-13
FORMULA_NAME FMS-PT-05000-LTLFireability-14
FORMULA_NAME FMS-PT-05000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679452300940

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FMS-PT-05000
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-22 02:31:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-22 02:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:31:42] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-22 02:31:42] [INFO ] Transformed 22 places.
[2023-03-22 02:31:42] [INFO ] Transformed 20 transitions.
[2023-03-22 02:31:42] [INFO ] Parsed PT model containing 22 places and 20 transitions and 50 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA FMS-PT-05000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FMS-PT-05000-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 13 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-22 02:31:42] [INFO ] Computed 6 place invariants in 6 ms
[2023-03-22 02:31:42] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-22 02:31:42] [INFO ] Invariant cache hit.
[2023-03-22 02:31:42] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-22 02:31:42] [INFO ] Invariant cache hit.
[2023-03-22 02:31:42] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 22/22 places, 20/20 transitions.
Support contains 18 out of 22 places after structural reductions.
[2023-03-22 02:31:43] [INFO ] Flatten gal took : 15 ms
[2023-03-22 02:31:43] [INFO ] Flatten gal took : 4 ms
[2023-03-22 02:31:43] [INFO ] Input system was already deterministic with 20 transitions.
Incomplete random walk after 10003 steps, including 1 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 02:31:43] [INFO ] Invariant cache hit.
[2023-03-22 02:31:43] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-22 02:31:43] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:31:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 02:31:43] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 02:31:43] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 02:31:43] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 10000 steps, including 0 resets, run visited all 1 properties in 49 ms. (steps per millisecond=204 )
Parikh walk visited 1 properties in 49 ms.
FORMULA FMS-PT-05000-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 9 edges and 16 vertex of which 6 / 16 are part of one of the 2 SCC in 2 ms
Free SCC test removed 4 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 12 transition count 14
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 8 rules applied. Total rules applied 21 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 22 place count 8 transition count 9
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 8 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 23 place count 8 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 26 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 27 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 29 place count 5 transition count 5
Applied a total of 29 rules in 9 ms. Remains 5 /22 variables (removed 17) and now considering 5/20 (removed 15) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 02:31:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-22 02:31:43] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-22 02:31:43] [INFO ] Invariant cache hit.
[2023-03-22 02:31:43] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2023-03-22 02:31:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:31:43] [INFO ] Invariant cache hit.
[2023-03-22 02:31:43] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/22 places, 5/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 86 ms. Remains : 5/22 places, 5/20 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : FMS-PT-05000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s4 1)), p1:(LT s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 4 ms.
FORMULA FMS-PT-05000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-LTLFireability-00 finished in 273 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-22 02:31:44] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-22 02:31:44] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : FMS-PT-05000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(GEQ s9 1), p1:(GEQ s12 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][false, false, false, false]]
Product exploration explored 100000 steps with 1303 reset in 229 ms.
Stack based approach found an accepted trace after 259 steps with 4 reset with depth 4 and stack size 4 in 1 ms.
FORMULA FMS-PT-05000-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-05000-LTLFireability-01 finished in 453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(X(G((X(G(p2))&&p1)))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:44] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:44] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-05000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=1, aps=[p0:(LT s0 1), p1:(AND (GEQ s13 1) (GEQ s15 1)), p2:(AND (GEQ s13 1) (GEQ s15 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 3 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-LTLFireability-02 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||F((p0&&G(p1)))))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 4 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:44] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:44] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2023-03-22 02:31:44] [INFO ] Invariant cache hit.
[2023-03-22 02:31:45] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : FMS-PT-05000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s19 1), p1:(GEQ s6 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 0 reset in 151 ms.
Stack based approach found an accepted trace after 1640 steps with 0 reset with depth 1641 and stack size 1637 in 3 ms.
FORMULA FMS-PT-05000-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-05000-LTLFireability-03 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X(G(p0)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 7 places and 0 transitions.
Graph (trivial) has 9 edges and 15 vertex of which 6 / 15 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 1 with 8 rules applied. Total rules applied 13 place count 11 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 17 place count 11 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 17 place count 11 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 24 place count 7 transition count 8
Applied a total of 24 rules in 3 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
[2023-03-22 02:31:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
// Phase 1: matrix 7 rows 7 cols
[2023-03-22 02:31:45] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 02:31:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 02:31:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-22 02:31:45] [INFO ] Invariant cache hit.
[2023-03-22 02:31:45] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-22 02:31:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:31:45] [INFO ] Flow matrix only has 7 transitions (discarded 1 similar events)
[2023-03-22 02:31:45] [INFO ] Invariant cache hit.
[2023-03-22 02:31:45] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : FMS-PT-05000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s2 1), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-LTLFireability-04 finished in 245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0) U (p1 U p2))))))'
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-22 02:31:45] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-22 02:31:45] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-22 02:31:45] [INFO ] Invariant cache hit.
[2023-03-22 02:31:45] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-22 02:31:45] [INFO ] Invariant cache hit.
[2023-03-22 02:31:45] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 275 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : FMS-PT-05000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s9 1), p0:(OR (AND (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s13 1) (GEQ s15 1))), p1:(AND (GEQ s13 1) (GEQ s15 1) (GEQ s16 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][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 148 ms.
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 116 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-22 02:31:47] [INFO ] Invariant cache hit.
[2023-03-22 02:31:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-22 02:31:47] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-22 02:31:47] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 02:31:47] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-22 02:31:47] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 02:31:47] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Finished Parikh walk after 9993 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=624 )
Parikh walk visited 5 properties in 651 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), true, (G (NOT (AND (NOT p0) (NOT p2) p1)))]
False Knowledge obtained : [(F p0), (F (AND (NOT p2) p1)), (F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 3 factoid took 228 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2023-03-22 02:31:48] [INFO ] Invariant cache hit.
[2023-03-22 02:31:48] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 02:31:48] [INFO ] Invariant cache hit.
[2023-03-22 02:31:48] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2023-03-22 02:31:48] [INFO ] Invariant cache hit.
[2023-03-22 02:31:48] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 22/22 places, 20/20 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 02:31:49] [INFO ] Invariant cache hit.
[2023-03-22 02:31:49] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 02:31:49] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 02:31:49] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-22 02:31:49] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 02:31:49] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 02:31:49] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 5002 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1250 )
Parikh walk visited 3 properties in 78 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), true]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p2))), (F (AND p0 (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Stuttering acceptance computed with spot in 221 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Stuttering acceptance computed with spot in 231 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 76 ms.
Product exploration explored 100000 steps with 25000 reset in 68 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 214 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), true, (NOT p0)]
Support contains 6 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 22 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 22 transition count 20
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 22 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 22 transition count 21
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 22 transition count 24
Deduced a syphon composed of 6 places in 0 ms
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 22 transition count 22
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 8 rules in 9 ms. Remains 22 /22 variables (removed 0) and now considering 22/20 (removed -2) transitions.
[2023-03-22 02:31:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 22 rows 22 cols
[2023-03-22 02:31:50] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 02:31:50] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/22 places, 22/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 47 ms. Remains : 22/22 places, 22/20 transitions.
Built C files in :
/tmp/ltsmin14706908635321854361
[2023-03-22 02:31:50] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14706908635321854361
Running compilation step : cd /tmp/ltsmin14706908635321854361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 171 ms.
Running link step : cd /tmp/ltsmin14706908635321854361;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14706908635321854361;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11818769773442860174.hoa' '--buchi-type=spotba'
LTSmin run took 364 ms.
FORMULA FMS-PT-05000-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FMS-PT-05000-LTLFireability-05 finished in 5763 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(!p1)&&p0)))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 16
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 8 edges and 16 vertex of which 3 / 16 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 13 place count 14 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 12 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 11 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 19 place count 11 transition count 10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 21 place count 10 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 4 with 2 rules applied. Total rules applied 23 place count 9 transition count 9
Applied a total of 23 rules in 4 ms. Remains 9 /22 variables (removed 13) and now considering 9/20 (removed 11) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-03-22 02:31:51] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-22 02:31:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-22 02:31:51] [INFO ] Invariant cache hit.
[2023-03-22 02:31:51] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
[2023-03-22 02:31:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:31:51] [INFO ] Invariant cache hit.
[2023-03-22 02:31:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/22 places, 9/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 9/22 places, 9/20 transitions.
Stuttering acceptance computed with spot in 102 ms :[p1, (OR (NOT p0) p1)]
Running random walk in product with property : FMS-PT-05000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s7 1), p0:(AND (GEQ s3 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, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-LTLFireability-06 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||G(p1)) U (G(p2) U p3)))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 17
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 10 place count 17 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 15 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 15 transition count 13
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 16 place count 13 transition count 13
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 11 transition count 11
Applied a total of 20 rules in 7 ms. Remains 11 /22 variables (removed 11) and now considering 11/20 (removed 9) transitions.
// Phase 1: matrix 11 rows 11 cols
[2023-03-22 02:31:51] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-22 02:31:51] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 02:31:51] [INFO ] Invariant cache hit.
[2023-03-22 02:31:51] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2023-03-22 02:31:51] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:31:51] [INFO ] Invariant cache hit.
[2023-03-22 02:31:51] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/22 places, 11/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 104 ms. Remains : 11/22 places, 11/20 transitions.
Stuttering acceptance computed with spot in 373 ms :[(NOT p3), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : FMS-PT-05000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(OR (LT s4 1) (AND (GEQ s5 1) (GEQ s7 1))), p2:(AND (GEQ s5 1) (GEQ s7 1)), p0:(GEQ s0 1), p1:(GEQ s4 1)], nbAcceptance=1, 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 16475 reset in 130 ms.
Stack based approach found an accepted trace after 125 steps with 20 reset with depth 2 and stack size 2 in 0 ms.
FORMULA FMS-PT-05000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-05000-LTLFireability-08 finished in 634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(X(F(!p2)))))'
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-22 02:31:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 02:31:52] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-22 02:31:52] [INFO ] Invariant cache hit.
[2023-03-22 02:31:52] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-22 02:31:52] [INFO ] Invariant cache hit.
[2023-03-22 02:31:52] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p0), (NOT p1), p2, p2]
Running random walk in product with property : FMS-PT-05000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s18 1)), p1:(GEQ s6 1), p2:(GEQ s19 1)], nbAcceptance=0, 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 4764 reset in 99 ms.
Stack based approach found an accepted trace after 187 steps with 8 reset with depth 11 and stack size 11 in 0 ms.
FORMULA FMS-PT-05000-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-05000-LTLFireability-09 finished in 462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(!p1)))))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 10 edges and 14 vertex of which 6 / 14 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 10 rules applied. Total rules applied 15 place count 10 transition count 14
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 22 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 23 place count 7 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 23 place count 7 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 25 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 26 place count 6 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 26 place count 6 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 3 rules applied. Total rules applied 29 place count 4 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 4 transition count 6
Applied a total of 30 rules in 5 ms. Remains 4 /22 variables (removed 18) and now considering 6/20 (removed 14) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-22 02:31:52] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 02:31:52] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-22 02:31:52] [INFO ] Invariant cache hit.
[2023-03-22 02:31:52] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-22 02:31:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 02:31:52] [INFO ] Invariant cache hit.
[2023-03-22 02:31:52] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/22 places, 6/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63 ms. Remains : 4/22 places, 6/20 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : FMS-PT-05000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s3 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-LTLFireability-10 finished in 198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))||G(!p1))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-22 02:31:52] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-22 02:31:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 02:31:53] [INFO ] Invariant cache hit.
[2023-03-22 02:31:53] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-22 02:31:53] [INFO ] Invariant cache hit.
[2023-03-22 02:31:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 90 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : FMS-PT-05000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(GEQ s12 1), p0:(OR (LT s12 1) (LT s10 1) (LT s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 119 ms.
Stack based approach found an accepted trace after 1258 steps with 0 reset with depth 1259 and stack size 1253 in 2 ms.
FORMULA FMS-PT-05000-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FMS-PT-05000-LTLFireability-11 finished in 428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 22 transition count 15
Reduce places removed 8 places and 0 transitions.
Graph (trivial) has 9 edges and 14 vertex of which 3 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 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 1 with 12 rules applied. Total rules applied 17 place count 12 transition count 12
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 23 place count 9 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 24 place count 8 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 24 place count 8 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 26 place count 7 transition count 8
Applied a total of 26 rules in 4 ms. Remains 7 /22 variables (removed 15) and now considering 8/20 (removed 12) transitions.
// Phase 1: matrix 8 rows 7 cols
[2023-03-22 02:31:53] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 02:31:53] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-22 02:31:53] [INFO ] Invariant cache hit.
[2023-03-22 02:31:53] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-22 02:31:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 02:31:53] [INFO ] Invariant cache hit.
[2023-03-22 02:31:53] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 8/20 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 7/22 places, 8/20 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FMS-PT-05000-LTLFireability-14 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 s6 1) (LT s0 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 2 steps with 0 reset in 0 ms.
FORMULA FMS-PT-05000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-LTLFireability-14 finished in 168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(G((X(!p1)||G(!p2)))))))))'
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 20/20 (removed 0) transitions.
// Phase 1: matrix 20 rows 22 cols
[2023-03-22 02:31:53] [INFO ] Computed 6 place invariants in 7 ms
[2023-03-22 02:31:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-22 02:31:53] [INFO ] Invariant cache hit.
[2023-03-22 02:31:53] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-22 02:31:53] [INFO ] Invariant cache hit.
[2023-03-22 02:31:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 22/22 places, 20/20 transitions.
Stuttering acceptance computed with spot in 261 ms :[true, (AND p1 p2 (NOT p0)), (AND p1 p2), (AND p1 p2), (AND p2 p1), p1, (AND p1 p2), p2]
Running random walk in product with property : FMS-PT-05000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={} source=7 dest: 0}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=1, aps=[p0:(GEQ s9 1), p2:(LT s0 1), p1:(GEQ s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 99566 steps with 0 reset in 113 ms.
FORMULA FMS-PT-05000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FMS-PT-05000-LTLFireability-15 finished in 475 ms.
All properties solved by simple procedures.
Total runtime 11722 ms.

BK_STOP 1679452314897

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FMS-PT-05000"
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-5348"
echo " Executing tool itstools"
echo " Input is FMS-PT-05000, 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 r165-tall-167838850200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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