About the Execution of ITS-Tools for Philosophers-PT-000005
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 294.216 | 24832.00 | 18408.00 | 4142.40 | FFTFFFTFFFFFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r140-tall-162298995900100.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 Philosophers-PT-000005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162298995900100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 24K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 177K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 137K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.4K Mar 28 16:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Mar 28 16:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Mar 28 16:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 27 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 27 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 25 08:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 08:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 22K May 5 16:51 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 Philosophers-PT-000005-00
FORMULA_NAME Philosophers-PT-000005-01
FORMULA_NAME Philosophers-PT-000005-02
FORMULA_NAME Philosophers-PT-000005-03
FORMULA_NAME Philosophers-PT-000005-04
FORMULA_NAME Philosophers-PT-000005-05
FORMULA_NAME Philosophers-PT-000005-06
FORMULA_NAME Philosophers-PT-000005-07
FORMULA_NAME Philosophers-PT-000005-08
FORMULA_NAME Philosophers-PT-000005-09
FORMULA_NAME Philosophers-PT-000005-10
FORMULA_NAME Philosophers-PT-000005-11
FORMULA_NAME Philosophers-PT-000005-12
FORMULA_NAME Philosophers-PT-000005-13
FORMULA_NAME Philosophers-PT-000005-14
FORMULA_NAME Philosophers-PT-000005-15
=== Now, execution of the tool begins
BK_START 1623004555747
Running Version 0
[2021-06-06 18:35:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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]
[2021-06-06 18:35:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-06-06 18:35:57] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2021-06-06 18:35:57] [INFO ] Transformed 25 places.
[2021-06-06 18:35:57] [INFO ] Transformed 25 transitions.
[2021-06-06 18:35:57] [INFO ] Found NUPN structural information;
[2021-06-06 18:35:57] [INFO ] Parsed PT model containing 25 places and 25 transitions in 65 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2021-06-06 18:35:57] [INFO ] Initial state test concluded for 4 properties.
FORMULA Philosophers-PT-000005-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000005-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:57] [INFO ] Computed 10 place invariants in 6 ms
[2021-06-06 18:35:57] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:57] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-06 18:35:57] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:57] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
[2021-06-06 18:35:57] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-06-06 18:35:57] [INFO ] Flatten gal took : 20 ms
FORMULA Philosophers-PT-000005-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-06-06 18:35:57] [INFO ] Flatten gal took : 7 ms
[2021-06-06 18:35:57] [INFO ] Input system was already deterministic with 25 transitions.
Incomplete random walk after 100000 steps, including 2811 resets, run finished after 222 ms. (steps per millisecond=450 ) properties (out of 20) seen :19
Running SMT prover for 1 properties.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:58] [INFO ] Computed 10 place invariants in 3 ms
[2021-06-06 18:35:58] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
[2021-06-06 18:35:58] [INFO ] Initial state test concluded for 1 properties.
FORMULA Philosophers-PT-000005-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:58] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:58] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-06 18:35:58] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:58] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 248 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000005-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 2 (ADD s15 s16 s17 s18 s20)), p0:(LEQ 1 (ADD s15 s16 s17 s18 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 1 reset in 2 ms.
FORMULA Philosophers-PT-000005-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-00 finished in 384 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0 U (G(p0)||(F(p2)&&p1))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:58] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:58] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2021-06-06 18:35:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000005-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GT (ADD s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14)) (GT (ADD s10 s11 s12 s13 s14) (ADD s15 s16 s17 s18 s20))), p0:(AND (GT (ADD s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14)) (GT (ADD s10 s11 s12 s13 s14) (ADD s15 s16 s17 s18 s20))), p2:(AND (LEQ (ADD s5 s6 s7 s8 s9) (ADD s10 s11 s12 s13 s14)) (LEQ 1 (ADD s0 s1 s2 s3 s4)))], 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 29 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000005-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-01 finished in 219 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G((G(p0) U X(p1)))&&F(p2)))], workingDir=/home/mcc/execution]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:59] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:59] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:59] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (NOT p2), (NOT p1), true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=p0, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LEQ 3 (ADD s10 s11 s12 s13 s14)), p2:(LEQ (ADD s15 s16 s17 s18 s20) (ADD s0 s1 s2 s3 s4)), p1:(GT 1 (ADD s0 s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-03 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||X(X((G(F(p1))||G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:35:59] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:35:59] [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.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:35:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:35:59] [INFO ] Dead Transitions using invariants and state equation in 46 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 2061 ms :[(AND p0 (NOT p2) (NOT p1)), (AND p0 (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000005-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 1 (ADD s15 s16 s17 s18 s20)), p2:(GT (ADD s10 s11 s12 s13 s14) (ADD s19 s21 s22 s23 s24)), p1:(GT 2 (ADD s0 s1 s2 s3 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15395 reset in 241 ms.
Stack based approach found an accepted trace after 60 steps with 11 reset with depth 15 and stack size 15 in 1 ms.
FORMULA Philosophers-PT-000005-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-04 finished in 2418 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(!p0)||G((p1||X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 20 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:01] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:01] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:01] [INFO ] Computed 10 place invariants in 4 ms
[2021-06-06 18:36:01] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 2592 ms :[(NOT p2), (AND (NOT p2) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) p0 (NOT p1)), true, p0]
Running random walk in product with property : Philosophers-PT-000005-05 automaton TGBA [mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=3, aps=[p2:(GT 2 (ADD s10 s11 s12 s13 s14)), p0:(GT (ADD s10 s11 s12 s13 s14) (ADD s19 s21 s22 s23 s24)), p1:(GT (ADD s5 s6 s7 s8 s9) (ADD s15 s16 s17 s18 s20))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 6 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-05 finished in 2683 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:04] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2021-06-06 18:36:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:04] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000005-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LEQ 1 (ADD s19 s21 s22 s23 s24)) (LEQ 1 (ADD s15 s16 s17 s18 s20))), p1:(AND (LEQ (ADD s15 s16 s17 s18 s20) (ADD s19 s21 s22 s23 s24)) (LEQ 1 (ADD s19 s21 s22 s23 s24)))], 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 95 steps with 3 reset in 0 ms.
FORMULA Philosophers-PT-000005-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-07 finished in 270 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 23
Applied a total of 4 rules in 5 ms. Remains 23 /25 variables (removed 2) and now considering 23/25 (removed 2) transitions.
// Phase 1: matrix 23 rows 23 cols
[2021-06-06 18:36:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:04] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-06-06 18:36:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-06-06 18:36:04] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 23 rows 23 cols
[2021-06-06 18:36:04] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:04] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 23/25 places, 23/25 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s6 0) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3104 reset in 144 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Philosophers-PT-000005-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-08 finished in 257 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 21 transition count 21
Applied a total of 8 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 21/25 (removed 4) transitions.
// Phase 1: matrix 21 rows 21 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:05] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:05] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2021-06-06 18:36:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 21 rows 21 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 2 ms
[2021-06-06 18:36:05] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/25 places, 21/25 transitions.
Stuttering acceptance computed with spot in 32 ms :[true, (NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-09 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s19 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000005-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-09 finished in 127 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:05] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:05] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:05] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000005-10 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (NEQ s9 0) (NEQ s16 1)) (AND (NEQ s0 0) (NEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000005-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000005-10 finished in 197 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((((F(p1)&&X(F(p2)))||p0) U (G(((F(p1)&&X(F(p2)))||p3))||(((F(p1)&&X(F(p2)))||p5)&&p4))))], workingDir=/home/mcc/execution]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:05] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:05] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:05] [INFO ] Computed 10 place invariants in 0 ms
[2021-06-06 18:36:05] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Stuttering acceptance computed with spot in 454 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p5))), (NOT p1), (NOT p2), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : Philosophers-PT-000005-15 automaton TGBA [mat=[[{ cond=(NOT p4), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p5) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p5) (NOT p0))), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p4) p0) (AND p4 (NOT p5) p0)), acceptance={} source=0 dest: 3}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p4) p0) (AND (NOT p1) p4 (NOT p5) p0)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p3 (NOT p4) (NOT p0)) (AND p3 (NOT p5) (NOT p0))), acceptance={} source=0 dest: 5}, { cond=(OR (AND p3 (NOT p1) (NOT p4) (NOT p0)) (AND p3 (NOT p1) (NOT p5) (NOT p0))), acceptance={} source=0 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND (NOT p3) (NOT p4) (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p5) (NOT p0) (NOT p2))), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p3) (NOT p4) p0 (NOT p2)) (AND (NOT p3) (NOT p5) p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p3 (NOT p4) p0 (NOT p2)) (AND p3 (NOT p5) p0 (NOT p2))), acceptance={} source=3 dest: 3}, { cond=(OR (AND p3 (NOT p4) (NOT p0) (NOT p2)) (AND p3 (NOT p5) (NOT p0) (NOT p2))), acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p3) (NOT p1) (NOT p4) (NOT p0)) (AND (NOT p3) (NOT p1) (NOT p5) (NOT p0))), acceptance={} source=4 dest: 1}, { cond=(OR (AND (NOT p3) (NOT p1) (NOT p4) p0) (AND (NOT p3) (NOT p1) (NOT p5) p0)), acceptance={0} source=4 dest: 4}, { cond=(OR (AND p3 (NOT p1) (NOT p4) p0) (AND p3 (NOT p1) (NOT p5) p0)), acceptance={} source=4 dest: 4}, { cond=(OR (AND p3 (NOT p1) (NOT p4) (NOT p0)) (AND p3 (NOT p1) (NOT p5) (NOT p0))), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p3 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(AND (NEQ s10 0) (NEQ s21 1)), p3:(OR (NEQ s22 0) (NEQ s20 1)), p1:(AND (NEQ s20 0) (NEQ s22 1)), p0:(OR (NEQ s22 0) (NEQ s20 1)), p5:(OR (NEQ s22 0) (NEQ s20 1)), p2:(OR (EQ s10 0) (EQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 13391 reset in 322 ms.
Product exploration explored 100000 steps with 13360 reset in 306 ms.
Knowledge obtained : [(NOT p4), p3, (NOT p1), p0, p5, p2]
Stuttering acceptance computed with spot in 297 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p5))), (NOT p1), (NOT p2), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Product exploration explored 100000 steps with 13410 reset in 309 ms.
Product exploration explored 100000 steps with 13352 reset in 297 ms.
Applying partial POR strategy [false, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 292 ms :[(OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p5))), (NOT p1), (NOT p2), (OR (AND (NOT p2) (NOT p3) (NOT p5)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p5)) (AND (NOT p1) (NOT p3) (NOT p4))), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Support contains 4 out of 25 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 25/25 places, 25/25 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 25 transition count 25
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2021-06-06 18:36:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 25 rows 25 cols
[2021-06-06 18:36:09] [INFO ] Computed 10 place invariants in 1 ms
[2021-06-06 18:36:09] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 25/25 places, 25/25 transitions.
Product exploration explored 100000 steps with 13360 reset in 337 ms.
Product exploration explored 100000 steps with 13421 reset in 332 ms.
[2021-06-06 18:36:09] [INFO ] Flatten gal took : 4 ms
[2021-06-06 18:36:09] [INFO ] Flatten gal took : 3 ms
[2021-06-06 18:36:09] [INFO ] Time to serialize gal into /tmp/LTL4258028439943953119.gal : 1 ms
[2021-06-06 18:36:09] [INFO ] Time to serialize properties into /tmp/LTL72695688807945707.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4258028439943953119.gal, -t, CGAL, -LTL, /tmp/LTL72695688807945707.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4258028439943953119.gal -t CGAL -LTL /tmp/LTL72695688807945707.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !(((("((Eat_2==1)||(Catch2_5==0))")||((F("((Catch2_5==1)&&(Eat_2==0))"))&&(X(F("((Catch1_1==0)||(Eat_3==1))")))))U((G(("((Eat_2==1)||(Catch2_5==0))")||((F("((Catch2_5==1)&&(Eat_2==0))"))&&(X(F("((Catch1_1==0)||(Eat_3==1))"))))))||(("((Catch1_1==1)&&(Eat_3==0))")&&(("((Eat_2==1)||(Catch2_5==0))")||((F("((Catch2_5==1)&&(Eat_2==0))"))&&(X(F("((Catch1_1==0)||(Eat_3==1))")))))))))
Formula 0 simplified : !(("((Eat_2==1)||(Catch2_5==0))" | (F"((Catch2_5==1)&&(Eat_2==0))" & XF"((Catch1_1==0)||(Eat_3==1))")) U (G("((Eat_2==1)||(Catch2_5==0))" | (F"((Catch2_5==1)&&(Eat_2==0))" & XF"((Catch1_1==0)||(Eat_3==1))")) | ("((Catch1_1==1)&&(Eat_3==0))" & ("((Eat_2==1)||(Catch2_5==0))" | (F"((Catch2_5==1)&&(Eat_2==0))" & XF"((Catch1_1==0)||(Eat_3==1))")))))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.034706,18608,1,0,21,2665,32,16,627,2225,45
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-PT-000005-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-PT-000005-15 finished in 4434 ms.
All properties solved without resorting to model-checking.
BK_STOP 1623004580579
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="Philosophers-PT-000005"
export BK_EXAMINATION="LTLCardinality"
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 Philosophers-PT-000005, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r140-tall-162298995900100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000005.tgz
mv Philosophers-PT-000005 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;