About the Execution of LoLa+red for Eratosthenes-PT-500
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 543.296 | 16297.00 | 23166.00 | 492.60 | FFFFFFFFTTFFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r167-tall-167838852600180.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Eratosthenes-PT-500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838852600180
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.5M
-rw-r--r-- 1 mcc users 7.8K Feb 25 11:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 11:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 11:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 25 11:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1006K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-500-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678446230148
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Eratosthenes-PT-500
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 11:03:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 11:03:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 11:03:51] [INFO ] Load time of PNML (sax parser for PT used): 117 ms
[2023-03-10 11:03:51] [INFO ] Transformed 499 places.
[2023-03-10 11:03:51] [INFO ] Transformed 2191 transitions.
[2023-03-10 11:03:52] [INFO ] Parsed PT model containing 499 places and 2191 transitions and 6573 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 95 places and 0 transitions.
Ensure Unique test removed 509 transitions
Reduce redundant transitions removed 509 transitions.
FORMULA Eratosthenes-PT-500-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-500-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 404 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 404/404 places, 1682/1682 transitions.
Discarding 70 places :
Symmetric choice reduction at 0 with 70 rule applications. Total rules 70 place count 334 transition count 1612
Iterating global reduction 0 with 70 rules applied. Total rules applied 140 place count 334 transition count 1612
Drop transitions removed 1278 transitions
Redundant transition composition rules discarded 1278 transitions
Iterating global reduction 0 with 1278 rules applied. Total rules applied 1418 place count 334 transition count 334
Discarding 287 places :
Symmetric choice reduction at 0 with 287 rule applications. Total rules 1705 place count 47 transition count 47
Iterating global reduction 0 with 287 rules applied. Total rules applied 1992 place count 47 transition count 47
Applied a total of 1992 rules in 51 ms. Remains 47 /404 variables (removed 357) and now considering 47/1682 (removed 1635) transitions.
// Phase 1: matrix 47 rows 47 cols
[2023-03-10 11:03:52] [INFO ] Computed 0 place invariants in 4 ms
[2023-03-10 11:03:52] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-10 11:03:52] [INFO ] Invariant cache hit.
[2023-03-10 11:03:52] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-10 11:03:52] [INFO ] Invariant cache hit.
[2023-03-10 11:03:52] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 47/404 places, 47/1682 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 306 ms. Remains : 47/404 places, 47/1682 transitions.
Support contains 46 out of 47 places after structural reductions.
[2023-03-10 11:03:52] [INFO ] Flatten gal took : 16 ms
[2023-03-10 11:03:52] [INFO ] Flatten gal took : 5 ms
[2023-03-10 11:03:52] [INFO ] Input system was already deterministic with 47 transitions.
Finished random walk after 1223 steps, including 3 resets, run visited all 29 properties in 31 ms. (steps per millisecond=39 )
FORMULA Eratosthenes-PT-500-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 47 stabilizing places and 47 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 47
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G(((p1 U p2)&&F(p0)))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 5 transition count 5
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 5 transition count 5
Applied a total of 84 rules in 2 ms. Remains 5 /47 variables (removed 42) and now considering 5/47 (removed 42) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-10 11:03:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 11:03:53] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:03:53] [INFO ] Invariant cache hit.
[2023-03-10 11:03:53] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2023-03-10 11:03:53] [INFO ] Invariant cache hit.
[2023-03-10 11:03:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/47 places, 5/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 96 ms. Remains : 5/47 places, 5/47 transitions.
Stuttering acceptance computed with spot in 711 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), true, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 4}, { cond=(OR p2 p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 7}, { cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s2 1)), p1:(GEQ s4 1), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 406 steps with 1 reset in 9 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-00 finished in 878 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0) U p1)&&X(G(p2))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 5 transition count 5
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 5 transition count 5
Applied a total of 84 rules in 1 ms. Remains 5 /47 variables (removed 42) and now considering 5/47 (removed 42) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-10 11:03:53] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:53] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 11:03:53] [INFO ] Invariant cache hit.
[2023-03-10 11:03:53] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 11:03:53] [INFO ] Invariant cache hit.
[2023-03-10 11:03:53] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/47 places, 5/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 5/47 places, 5/47 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), true, (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p2 p0), acceptance={0} source=3 dest: 0}, { cond=(OR (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p2:(LT s3 1), p1:(GEQ s2 1), p0:(AND (GEQ s1 1) (GEQ s4 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-02 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0 U p1))||G(p2))))'
Support contains 5 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 5 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 42 output transitions
Drop transitions removed 42 transitions
Applied a total of 1 rules in 4 ms. Remains 5 /47 variables (removed 42) and now considering 5/47 (removed 42) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-10 11:03:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2023-03-10 11:03:54] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/47 places, 5/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 5/47 places, 5/47 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p1) (AND p2 p0)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s0 1) (GEQ s2 1) (GEQ s3 1)), p1:(GEQ s1 1), p0:(OR (GEQ s0 1) (GEQ s4 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-04 finished in 200 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p1)))))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 5 transition count 5
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 5 transition count 5
Applied a total of 84 rules in 1 ms. Remains 5 /47 variables (removed 42) and now considering 5/47 (removed 42) transitions.
// Phase 1: matrix 5 rows 5 cols
[2023-03-10 11:03:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5/47 places, 5/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 5/47 places, 5/47 transitions.
Stuttering acceptance computed with spot in 135 ms :[p1, p1, p1, true]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s2 1)), p0:(AND (GEQ s3 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 411 steps with 1 reset in 4 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-05 finished in 223 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3 transition count 3
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3 transition count 3
Applied a total of 88 rules in 1 ms. Remains 3 /47 variables (removed 44) and now considering 3/47 (removed 44) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 11:03:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants in 18 ms returned []
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [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.
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/47 places, 3/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 3/47 places, 3/47 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s1 1) (GEQ s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 9 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-06 finished in 206 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X(F(p2)))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 7 transition count 7
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 7 transition count 7
Applied a total of 80 rules in 1 ms. Remains 7 /47 variables (removed 40) and now considering 7/47 (removed 40) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-10 11:03:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:54] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/47 places, 7/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 7/47 places, 7/47 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s5 1)), p0:(AND (GEQ s2 1) (GEQ s3 1)), p2:(AND (GEQ s1 1) (GEQ s6 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 408 steps with 2 reset in 4 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-07 finished in 214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1||X(X(F(p2)))))||p0)))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 7 transition count 7
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 7 transition count 7
Applied a total of 80 rules in 1 ms. Remains 7 /47 variables (removed 40) and now considering 7/47 (removed 40) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-10 11:03:54] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 11:03:54] [INFO ] Invariant cache hit.
[2023-03-10 11:03:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-10 11:03:55] [INFO ] Invariant cache hit.
[2023-03-10 11:03:55] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/47 places, 7/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 7/47 places, 7/47 transitions.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (LT s2 1) (LT s6 1)), p1:(LT s5 1), p2:(OR (LT s3 1) (LT s4 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 26468 reset in 196 ms.
Product exploration explored 100000 steps with 26499 reset in 110 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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 : [(AND (NOT p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 4 factoid took 199 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-09 finished in 816 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 4 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.1 ms
Discarding 43 places :
Also discarding 43 output transitions
Drop transitions removed 43 transitions
Applied a total of 1 rules in 1 ms. Remains 4 /47 variables (removed 43) and now considering 4/47 (removed 43) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-10 11:03:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 11:03:55] [INFO ] Invariant cache hit.
[2023-03-10 11:03:55] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-10 11:03:55] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:03:55] [INFO ] Invariant cache hit.
[2023-03-10 11:03:55] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/47 places, 4/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 77 ms. Remains : 4/47 places, 4/47 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s2 1)) (AND (GEQ s0 1) (GEQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-11 finished in 186 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(G((F(p1) U !p0))))))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 3 transition count 3
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 3 transition count 3
Applied a total of 88 rules in 2 ms. Remains 3 /47 variables (removed 44) and now considering 3/47 (removed 44) transitions.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 11:03:55] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 11:03:55] [INFO ] Invariant cache hit.
[2023-03-10 11:03:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2023-03-10 11:03:56] [INFO ] Invariant cache hit.
[2023-03-10 11:03:56] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/47 places, 3/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 3/47 places, 3/47 transitions.
Stuttering acceptance computed with spot in 227 ms :[false, false, false, p0, (NOT p1), p0]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s2 1), p1:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 246 reset in 133 ms.
Product exploration explored 100000 steps with 246 reset in 75 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
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 (and all enablings converge to false).
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 : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[false, false, false, p0, (NOT p1), p0]
Finished random walk after 405 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 211 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 256 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 241 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2023-03-10 11:03:57] [INFO ] Invariant cache hit.
[2023-03-10 11:03:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:03:57] [INFO ] Invariant cache hit.
[2023-03-10 11:03:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 11:03:57] [INFO ] Invariant cache hit.
[2023-03-10 11:03:57] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 3/3 places, 3/3 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
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 (and all enablings converge to false).
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 : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[false, false, false, p0, (NOT p1), p0]
Finished random walk after 1622 steps, including 3 resets, run visited all 3 properties in 3 ms. (steps per millisecond=540 )
Knowledge obtained : [(AND p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 201 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 253 ms :[false, false, false, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 219 ms :[false, false, false, p0, (NOT p1), p0]
Product exploration explored 100000 steps with 246 reset in 82 ms.
Product exploration explored 100000 steps with 246 reset in 43 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 212 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 3/3 transitions.
Graph (complete) has 0 edges and 3 vertex of which 2 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /3 variables (removed 1) and now considering 2/3 (removed 1) transitions.
[2023-03-10 11:03:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 11:03:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:59] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/3 places, 2/3 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31 ms. Remains : 2/3 places, 2/3 transitions.
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
// Phase 1: matrix 3 rows 3 cols
[2023-03-10 11:03:59] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 11:03:59] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-10 11:03:59] [INFO ] Invariant cache hit.
[2023-03-10 11:03:59] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 11:03:59] [INFO ] Invariant cache hit.
[2023-03-10 11:03:59] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 3/3 places, 3/3 transitions.
Treatment of property Eratosthenes-PT-500-LTLFireability-12 finished in 3769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 2 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /47 variables (removed 45) and now considering 2/47 (removed 45) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 11:03:59] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-10 11:03:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-10 11:03:59] [INFO ] Invariant cache hit.
[2023-03-10 11:03:59] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2023-03-10 11:03:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:03:59] [INFO ] Invariant cache hit.
[2023-03-10 11:03:59] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/47 places, 2/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67 ms. Remains : 2/47 places, 2/47 transitions.
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-13 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}]], initial=0, aps=[p1:(LT s1 1), p0:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 40040 reset in 42 ms.
Product exploration explored 100000 steps with 40009 reset in 50 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
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 (and all enablings converge to false).
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 : [(AND (NOT 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))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 6 factoid took 165 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Eratosthenes-PT-500-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Eratosthenes-PT-500-LTLFireability-13 finished in 391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X((p1||F(G(p2))))))'
Support contains 6 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 7 transition count 7
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 7 transition count 7
Applied a total of 80 rules in 2 ms. Remains 7 /47 variables (removed 40) and now considering 7/47 (removed 40) transitions.
// Phase 1: matrix 7 rows 7 cols
[2023-03-10 11:04:00] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 11:04:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:04:00] [INFO ] Invariant cache hit.
[2023-03-10 11:04:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2023-03-10 11:04:00] [INFO ] Invariant cache hit.
[2023-03-10 11:04:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7/47 places, 7/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67 ms. Remains : 7/47 places, 7/47 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s6 1)), p1:(AND (GEQ s4 1) (GEQ s6 1)), p2:(AND (GEQ s1 1) (GEQ s2 1) (GEQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 408 steps with 2 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-14 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 2 transition count 2
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 2 transition count 2
Applied a total of 90 rules in 2 ms. Remains 2 /47 variables (removed 45) and now considering 2/47 (removed 45) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-10 11:04:00] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-10 11:04:00] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-10 11:04:00] [INFO ] Invariant cache hit.
[2023-03-10 11:04:00] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-10 11:04:00] [INFO ] Invariant cache hit.
[2023-03-10 11:04:00] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/47 places, 2/47 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 72 ms. Remains : 2/47 places, 2/47 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, 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: 2}]], initial=1, aps=[p0:(LT s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1621 steps with 4 reset in 1 ms.
FORMULA Eratosthenes-PT-500-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Eratosthenes-PT-500-LTLFireability-15 finished in 181 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((p0||X(G((F(p1) U !p0))))))))'
Found a Lengthening insensitive property : Eratosthenes-PT-500-LTLFireability-12
Stuttering acceptance computed with spot in 224 ms :[false, false, false, p0, (NOT p1), p0]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 47/47 places, 47/47 transitions.
Graph (complete) has 0 edges and 47 vertex of which 2 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.0 ms
Discarding 45 places :
Also discarding 45 output transitions
Drop transitions removed 45 transitions
Applied a total of 1 rules in 1 ms. Remains 2 /47 variables (removed 45) and now considering 2/47 (removed 45) transitions.
[2023-03-10 11:04:00] [INFO ] Invariant cache hit.
[2023-03-10 11:04:00] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-10 11:04:00] [INFO ] Invariant cache hit.
[2023-03-10 11:04:00] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 11:04:00] [INFO ] Invariant cache hit.
[2023-03-10 11:04:00] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 2/47 places, 2/47 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62 ms. Remains : 2/47 places, 2/47 transitions.
Running random walk in product with property : Eratosthenes-PT-500-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=p0, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s1 1), p1:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 74 ms.
Product exploration explored 100000 steps with 33333 reset in 76 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
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 (and all enablings converge to false).
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 : [(AND p0 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 174 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
Finished random walk after 4 steps, including 1 resets, run visited all 4 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 295 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 268 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
[2023-03-10 11:04:02] [INFO ] Invariant cache hit.
[2023-03-10 11:04:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:04:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2023-03-10 11:04:02] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 11:04:02] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND p0 p1)
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-10 11:04:02] [INFO ] Invariant cache hit.
[2023-03-10 11:04:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-10 11:04:02] [INFO ] Invariant cache hit.
[2023-03-10 11:04:02] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-10 11:04:02] [INFO ] Invariant cache hit.
[2023-03-10 11:04:02] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 2/2 places, 2/2 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
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 (and all enablings converge to false).
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 : [(AND p0 p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 316 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
Finished random walk after 7 steps, including 2 resets, run visited all 4 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (F (NOT p1)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 533 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
Stuttering acceptance computed with spot in 215 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
[2023-03-10 11:04:04] [INFO ] Invariant cache hit.
[2023-03-10 11:04:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 11:04:04] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2023-03-10 11:04:04] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-10 11:04:04] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (AND p0 p1)
Stuttering acceptance computed with spot in 234 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
Product exploration explored 100000 steps with 33333 reset in 47 ms.
Product exploration explored 100000 steps with 33333 reset in 35 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 247 ms :[(AND p0 p1), p0, p0, p0, (NOT p1), p0]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
[2023-03-10 11:04:04] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 11:04:04] [INFO ] Invariant cache hit.
[2023-03-10 11:04:04] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31 ms. Remains : 2/2 places, 2/2 transitions.
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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.
[2023-03-10 11:04:04] [INFO ] Invariant cache hit.
[2023-03-10 11:04:04] [INFO ] Implicit Places using invariants in 14 ms returned []
[2023-03-10 11:04:04] [INFO ] Invariant cache hit.
[2023-03-10 11:04:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2023-03-10 11:04:04] [INFO ] Invariant cache hit.
[2023-03-10 11:04:04] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 2/2 places, 2/2 transitions.
Treatment of property Eratosthenes-PT-500-LTLFireability-12 finished in 4336 ms.
[2023-03-10 11:04:04] [INFO ] Flatten gal took : 3 ms
[2023-03-10 11:04:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-10 11:04:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 47 transitions and 47 arcs took 0 ms.
Total runtime 13291 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Eratosthenes-PT-500
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability
FORMULA Eratosthenes-PT-500-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678446246445
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 3 (type SKEL/SRCH) for 0 Eratosthenes-PT-500-LTLFireability-12
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 1 (type EXCL) for 0 Eratosthenes-PT-500-LTLFireability-12
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 3 (type SKEL/SRCH) for Eratosthenes-PT-500-LTLFireability-12
lola: result : true
lola: markings : 96926
lola: fired transitions : 352167
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 1 (type EXCL) for Eratosthenes-PT-500-LTLFireability-12 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Eratosthenes-PT-500-LTLFireability-12: LTL true skeleton: LTL model checker
Time elapsed: 0 secs. Pages in use: 2
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-500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Eratosthenes-PT-500, 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 r167-tall-167838852600180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-500.tgz
mv Eratosthenes-PT-500 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 ;