About the Execution of ITS-Tools for Eratosthenes-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 302.672 | 7561.00 | 14188.00 | 119.80 | TFFFTFTFTFFTFTTT | 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.r083-tall-162048875700685.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Eratosthenes-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-162048875700685
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 23 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 22 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 22 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 4.5K 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 Eratosthenes-PT-010-00
FORMULA_NAME Eratosthenes-PT-010-01
FORMULA_NAME Eratosthenes-PT-010-02
FORMULA_NAME Eratosthenes-PT-010-03
FORMULA_NAME Eratosthenes-PT-010-04
FORMULA_NAME Eratosthenes-PT-010-05
FORMULA_NAME Eratosthenes-PT-010-06
FORMULA_NAME Eratosthenes-PT-010-07
FORMULA_NAME Eratosthenes-PT-010-08
FORMULA_NAME Eratosthenes-PT-010-09
FORMULA_NAME Eratosthenes-PT-010-10
FORMULA_NAME Eratosthenes-PT-010-11
FORMULA_NAME Eratosthenes-PT-010-12
FORMULA_NAME Eratosthenes-PT-010-13
FORMULA_NAME Eratosthenes-PT-010-14
FORMULA_NAME Eratosthenes-PT-010-15
=== Now, execution of the tool begins
BK_START 1620659163109
Running Version 0
[2021-05-10 15:06:04] [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]
[2021-05-10 15:06:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-10 15:06:04] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2021-05-10 15:06:04] [INFO ] Transformed 9 places.
[2021-05-10 15:06:04] [INFO ] Transformed 8 transitions.
[2021-05-10 15:06:04] [INFO ] Parsed PT model containing 9 places and 8 transitions in 58 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-10 15:06:04] [INFO ] Initial state test concluded for 5 properties.
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA Eratosthenes-PT-010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 6/6 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 5 transition count 5
Applied a total of 1 rules in 8 ms. Remains 5 /5 variables (removed 0) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:04] [INFO ] Computed 0 place invariants in 3 ms
[2021-05-10 15:06:04] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:04] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:04] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
// Phase 1: matrix 5 rows 5 cols
[2021-05-10 15:06:04] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:04] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 5/6 transitions.
[2021-05-10 15:06:05] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-10 15:06:05] [INFO ] Flatten gal took : 14 ms
FORMULA Eratosthenes-PT-010-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-010-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-10 15:06:05] [INFO ] Flatten gal took : 2 ms
[2021-05-10 15:06:05] [INFO ] Input system was already deterministic with 5 transitions.
Finished random walk after 6 steps, including 1 resets, run visited all 7 properties in 2 ms. (steps per millisecond=3 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 3 transition count 3
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 8 ms. Remains 2 /5 variables (removed 3) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 7 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 20 ms to find 0 implicit places.
[2021-05-10 15:06:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 2/5 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Eratosthenes-PT-010-02 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:(GEQ s0 1), p1:(LT s1 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 2 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-02 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2 transition count 2
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2 transition count 2
Applied a total of 6 rules in 1 ms. Remains 2 /5 variables (removed 3) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 2/5 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-010-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(GEQ s1 1)], 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 9 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-03 finished in 147 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1)&&F(p2))))], workingDir=/home/mcc/execution]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/5 places, 4/5 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-010-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s3 1), p2:(LT s1 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 0 ms.
FORMULA Eratosthenes-PT-010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-05 finished in 166 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F(p0)&&F(G(!p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants in 8 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:05] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:05] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:05] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1]
Running random walk in product with property : Eratosthenes-PT-010-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s1 1) (LT s2 1)), p1:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 19489 reset in 200 ms.
Product exploration explored 100000 steps with 19461 reset in 111 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p0)), (F (G (NOT p1))), (NOT p0), p1]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1]
Product exploration explored 100000 steps with 19429 reset in 96 ms.
Product exploration explored 100000 steps with 19432 reset in 101 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (NOT p0), p1]
Support contains 2 out of 3 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2021-05-10 15:06:06] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:06] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:06] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/3 places, 3/3 transitions.
Product exploration explored 100000 steps with 19487 reset in 228 ms.
Product exploration explored 100000 steps with 19513 reset in 177 ms.
[2021-05-10 15:06:07] [INFO ] Flatten gal took : 2 ms
[2021-05-10 15:06:07] [INFO ] Flatten gal took : 0 ms
[2021-05-10 15:06:07] [INFO ] Time to serialize gal into /tmp/LTL16288644982483241265.gal : 1 ms
[2021-05-10 15:06:07] [INFO ] Time to serialize properties into /tmp/LTL8413834171794738225.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/LTL16288644982483241265.gal, -t, CGAL, -LTL, /tmp/LTL8413834171794738225.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/LTL16288644982483241265.gal -t CGAL -LTL /tmp/LTL8413834171794738225.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F("((p9<1)&&(p10<1))"))&&(F(G("(p10<1)"))))))
Formula 0 simplified : !X(F"((p9<1)&&(p10<1))" & FG"(p10<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 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.016023,16688,1,0,38,115,33,36,52,241,115
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-010-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Eratosthenes-PT-010-06 finished in 1613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 2 transition count 2
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 2 transition count 2
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 1 transition count 1
Applied a total of 5 rules in 2 ms. Remains 1 /5 variables (removed 4) and now considering 1/5 (removed 4) transitions.
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
[2021-05-10 15:06:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 1 rows 1 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Dead Transitions using invariants and state equation in 5 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1/5 places, 1/5 transitions.
Stuttering acceptance computed with spot in 23 ms :[p0]
Running random walk in product with property : Eratosthenes-PT-010-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s0 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 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 50 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Eratosthenes-PT-010-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-010-08 finished in 300 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants in 6 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : Eratosthenes-PT-010-09 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(GEQ s2 1), p0:(GEQ s0 1)], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-09 finished in 106 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((p0||X((G(((p0 U G(!p1))||(G(p0)&&X(!p1)))) U (p0&&G(((p0 U G(!p1))||(G(p0)&&X(!p1))))))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 3 transition count 3
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 3 transition count 3
Applied a total of 4 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants and state equation in 9 ms returned []
Implicit Place search using SMT with State Equation took 14 ms to find 0 implicit places.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : Eratosthenes-PT-010-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s2 1), p1:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-10 finished in 137 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 3
Applied a total of 1 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 3/5 (removed 2) transitions.
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants and state equation in 7 ms returned []
Implicit Place search using SMT with State Equation took 13 ms to find 0 implicit places.
[2021-05-10 15:06:07] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 3 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 2 ms
[2021-05-10 15:06:07] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3/5 places, 3/5 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : Eratosthenes-PT-010-12 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (GEQ s2 1) (GEQ s0 1) (GEQ s1 1)), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-010-12 finished in 85 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((G(!p0)||(p1&&X(!p0))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4 transition count 4
Applied a total of 2 rules in 1 ms. Remains 4 /5 variables (removed 1) and now considering 4/5 (removed 1) transitions.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants in 5 ms returned []
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 16 ms to find 0 implicit places.
// Phase 1: matrix 4 rows 4 cols
[2021-05-10 15:06:07] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:07] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 4/5 places, 4/5 transitions.
Stuttering acceptance computed with spot in 75 ms :[p0, p0, p0]
Running random walk in product with property : Eratosthenes-PT-010-13 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(OR (LT s1 1) (LT s2 1)), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21964 reset in 77 ms.
Product exploration explored 100000 steps with 21945 reset in 86 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G p1)), (F (G (NOT p0))), (NOT p1), p0]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
FORMULA Eratosthenes-PT-010-13 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property Eratosthenes-PT-010-13 finished in 361 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||X(X(G(!p0)))))))], workingDir=/home/mcc/execution]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5/5 places, 5/5 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2 transition count 2
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2 transition count 2
Applied a total of 6 rules in 0 ms. Remains 2 /5 variables (removed 3) and now considering 2/5 (removed 3) transitions.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:08] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-10 15:06:08] [INFO ] Implicit Places using invariants in 7 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:08] [INFO ] Implicit Places using invariants and state equation in 8 ms returned []
Implicit Place search using SMT with State Equation took 15 ms to find 0 implicit places.
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:08] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:08] [INFO ] Dead Transitions using invariants and state equation in 7 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/5 places, 2/5 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, false, p0, p0, false, false]
Running random walk in product with property : Eratosthenes-PT-010-14 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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]]
Product exploration explored 100000 steps with 19049 reset in 76 ms.
Product exploration explored 100000 steps with 19053 reset in 86 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(F (G (NOT p0))), p0]
Stuttering acceptance computed with spot in 114 ms :[true, false, p0, p0, false, false]
Product exploration explored 100000 steps with 19068 reset in 67 ms.
Product exploration explored 100000 steps with 19018 reset in 87 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 203 ms :[true, false, p0, p0, false, false]
Support contains 1 out of 2 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2021-05-10 15:06:09] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2021-05-10 15:06:09] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-10 15:06:09] [INFO ] Dead Transitions using invariants and state equation in 6 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2/2 places, 2/2 transitions.
Product exploration explored 100000 steps with 19017 reset in 74 ms.
Product exploration explored 100000 steps with 19043 reset in 71 ms.
[2021-05-10 15:06:09] [INFO ] Flatten gal took : 1 ms
[2021-05-10 15:06:09] [INFO ] Flatten gal took : 0 ms
[2021-05-10 15:06:09] [INFO ] Time to serialize gal into /tmp/LTL4448931881627065074.gal : 0 ms
[2021-05-10 15:06:09] [INFO ] Time to serialize properties into /tmp/LTL8123024400041060796.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/LTL4448931881627065074.gal, -t, CGAL, -LTL, /tmp/LTL8123024400041060796.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/LTL4448931881627065074.gal -t CGAL -LTL /tmp/LTL8123024400041060796.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(("(p10>=1)")||(X(X(G("(p10<1)"))))))))
Formula 0 simplified : !XX("(p10>=1)" | XXG"(p10<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
0 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
0 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.008919,16372,1,0,13,33,17,10,35,41,37
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-010-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Eratosthenes-PT-010-14 finished in 1106 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620659170670
--------------------
content from stderr:
+ 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
+ [[ -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 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=/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="Eratosthenes-PT-010"
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 Eratosthenes-PT-010, 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 r083-tall-162048875700685"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-010.tgz
mv Eratosthenes-PT-010 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 ;