About the Execution of ITS-Tools for JoinFreeModules-PT-0004
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
237.636 | 6446.00 | 12022.00 | 47.90 | FFTFFFFFTFFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r132-tall-165271820500148.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is JoinFreeModules-PT-0004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271820500148
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 9.3K Apr 30 02:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 30 02:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K May 9 08:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 13K 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 JoinFreeModules-PT-0004-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0004-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652746456759
Running Version 202205111006
[2022-05-17 00:14:17] [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-17 00:14:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 00:14:18] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2022-05-17 00:14:18] [INFO ] Transformed 21 places.
[2022-05-17 00:14:18] [INFO ] Transformed 33 transitions.
[2022-05-17 00:14:18] [INFO ] Parsed PT model containing 21 places and 33 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0004-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0004-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA JoinFreeModules-PT-0004-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 11 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:18] [INFO ] Computed 4 place invariants in 7 ms
[2022-05-17 00:14:18] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:18] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:14:18] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:18] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:18] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:18] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-17 00:14:18] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Support contains 15 out of 20 places after structural reductions.
[2022-05-17 00:14:18] [INFO ] Flatten gal took : 18 ms
[2022-05-17 00:14:18] [INFO ] Flatten gal took : 5 ms
[2022-05-17 00:14:18] [INFO ] Input system was already deterministic with 33 transitions.
Support contains 14 out of 20 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 34 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 21) seen :20
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:18] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 00:14:18] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA JoinFreeModules-PT-0004-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(G(p1)))))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 7 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:19] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 5 ms
[2022-05-17 00:14:19] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:19] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2022-05-17 00:14:19] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:14:19] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s17 1), p1:(LT s12 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 2 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-00 finished in 477 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((p0 U X(X(p1))) U X(p2)))'
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:19] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:19] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:19] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:19] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:19] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 423 ms :[p2, (AND p1 p2), (AND p1 p2), p1, true, p1, p2, p2, (AND p1 p2), (AND p1 p2), p1]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 6}, { cond=p0, acceptance={} source=0 dest: 7}], [{ cond=(AND p2 p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 9}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p2 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 10}], [{ cond=p2, acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 2}, { cond=p2, acceptance={} source=7 dest: 4}], [{ cond=(AND p2 p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=9 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=9 dest: 2}, { cond=(AND p2 p1), acceptance={} source=9 dest: 4}], [{ cond=p1, acceptance={} source=10 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s17 1) (GEQ s8 4)), p2:(AND (GEQ s17 1) (GEQ s2 4) (GEQ s7 4) (GEQ s12 4) (GEQ s17 4)), p1:(GEQ s7 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-01 finished in 588 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p0) U (p1 U p2))) U (G(p3)&&p2)))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:20] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:20] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 2 ms
[2022-05-17 00:14:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:20] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2022-05-17 00:14:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:20] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 490 ms :[(OR (NOT p2) (NOT p3)), true, (NOT p0), (NOT p2), (NOT p2), (NOT p2), (NOT p3), (NOT p3), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) p1 (NOT p3))), (AND p0 (NOT p2) (NOT p3))]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0) (AND p2 (NOT p3))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0) (AND p2 (NOT p3))), acceptance={} source=0 dest: 5}, { cond=(AND p2 p3), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 4}, { cond=(OR p2 p1 p0), acceptance={} source=5 dest: 5}], [{ cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={} source=6 dest: 5}, { cond=(OR (AND p2 p3) (AND p3 p1) (AND p3 p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p3 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) p3 p1 (NOT p0)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p3), acceptance={} source=7 dest: 1}, { cond=p3, acceptance={} source=7 dest: 7}], [{ cond=(OR (AND p2 (NOT p3) (NOT p0)) (AND (NOT p3) p1 (NOT p0))), acceptance={} source=8 dest: 1}, { cond=(OR (AND p2 (NOT p3) p0) (AND (NOT p3) p1 p0)), acceptance={} source=8 dest: 2}, { cond=(OR (AND p2 p3 (NOT p0)) (AND p3 p1 (NOT p0))), acceptance={} source=8 dest: 7}, { cond=(OR (AND p2 p3 p0) (AND p3 p1 p0)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p2) p3 (NOT p1) p0), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p2) p3 p1 p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(GEQ s4 5), p1:(GEQ s10 3), p0:(LT s18 4), p3:(GEQ s5 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-03 finished in 645 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!X(G(!p0))) U (G((p1 U F(p1)))&&G(p2))))'
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:20] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:20] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2022-05-17 00:14:20] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:20] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:20] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p1)), (NOT p0), (AND (NOT p0) p2), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(GEQ s17 2), p0:(GEQ s4 5), p1:(GEQ s8 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-05 finished in 281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U X(G((X(X(p0)) U p0))))||X(p1)))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:21] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p1:(GEQ s16 2), p0:(GEQ s13 4)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-06 finished in 298 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((!F(p0) U p1)))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:21] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:21] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), true, p0]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(GEQ s5 5), p0:(GEQ s15 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-07 finished in 243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)||F(G(p1)))))'
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:21] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:21] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:21] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s6 2) (GEQ s17 1)), p0:(LT s13 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-0004-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-0004-LTLFireability-11 finished in 773 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:22] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-17 00:14:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:22] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s16 2)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-13 finished in 191 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(!(p0 U F(p1))))&&F(p2)))'
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:22] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:22] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:22] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 125 ms :[p1, true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s12 2), p2:(GEQ s15 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-14 finished in 271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(G(F(p0)))))))'
Support contains 4 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 33/33 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 33/33 (removed 0) transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 00:14:22] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 00:14:22] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2022-05-17 00:14:22] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 33 rows 20 cols
[2022-05-17 00:14:22] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 00:14:22] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 33/33 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0004-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2 4) (GEQ s7 4) (GEQ s12 4) (GEQ s17 4))], 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 1192 steps with 0 reset in 11 ms.
FORMULA JoinFreeModules-PT-0004-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0004-LTLFireability-15 finished in 256 ms.
All properties solved by simple procedures.
Total runtime 5283 ms.
BK_STOP 1652746463205
--------------------
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="JoinFreeModules-PT-0004"
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 JoinFreeModules-PT-0004, 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 r132-tall-165271820500148"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0004.tgz
mv JoinFreeModules-PT-0004 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 '
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 ;