About the Execution of LTSMin+red for Echo-PT-d03r05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1752.812 | 2503086.00 | 2596895.00 | 5868.40 | FTFT?TFTFTFFT?TF | 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.r169-tall-167838855400091.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 ltsminxred
Input is Echo-PT-d03r05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r169-tall-167838855400091
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.6K Feb 25 14:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 14:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 14:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 14:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 14:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 14:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 14:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 716K 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 Echo-PT-d03r05-LTLCardinality-00
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-01
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-02
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-03
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-04
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-05
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-06
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-07
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-08
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-09
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-10
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-11
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-12
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-13
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-14
FORMULA_NAME Echo-PT-d03r05-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678478863023
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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Echo-PT-d03r05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-10 20:07:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-10 20:07:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 20:07:44] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2023-03-10 20:07:44] [INFO ] Transformed 1445 places.
[2023-03-10 20:07:44] [INFO ] Transformed 1190 transitions.
[2023-03-10 20:07:44] [INFO ] Found NUPN structural information;
[2023-03-10 20:07:44] [INFO ] Parsed PT model containing 1445 places and 1190 transitions and 8260 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA Echo-PT-d03r05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d03r05-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1445 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1445/1445 places, 1190/1190 transitions.
Reduce places removed 124 places and 0 transitions.
Iterating post reduction 0 with 124 rules applied. Total rules applied 124 place count 1321 transition count 1190
Applied a total of 124 rules in 121 ms. Remains 1321 /1445 variables (removed 124) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1321 cols
[2023-03-10 20:07:46] [INFO ] Computed 601 place invariants in 1645 ms
[2023-03-10 20:08:04] [INFO ] Implicit Places using invariants in 19018 ms returned []
[2023-03-10 20:08:04] [INFO ] Invariant cache hit.
[2023-03-10 20:08:18] [INFO ] Implicit Places using invariants and state equation in 13824 ms returned []
Implicit Place search using SMT with State Equation took 32891 ms to find 0 implicit places.
[2023-03-10 20:08:18] [INFO ] Invariant cache hit.
[2023-03-10 20:09:18] [INFO ] Performed 1/1190 'is it Dead' test of which 0 returned DEAD in 57 seconds.
[2023-03-10 20:09:18] [INFO ] Dead Transitions using invariants and state equation in 60027 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1321/1445 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93043 ms. Remains : 1321/1445 places, 1190/1190 transitions.
Support contains 27 out of 1321 places after structural reductions.
[2023-03-10 20:09:18] [INFO ] Flatten gal took : 512 ms
[2023-03-10 20:09:19] [INFO ] Flatten gal took : 178 ms
[2023-03-10 20:09:19] [INFO ] Input system was already deterministic with 1190 transitions.
Finished random walk after 2328 steps, including 9 resets, run visited all 14 properties in 205 ms. (steps per millisecond=11 )
Computed a total of 1321 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1321 transition count 1190
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' '!(F(p0))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.15 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 128 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-10 20:09:22] [INFO ] Computed 594 place invariants in 1709 ms
[2023-03-10 20:09:36] [INFO ] Implicit Places using invariants in 16387 ms returned [615, 716, 737, 742, 763, 864]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 16404 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1306/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 95 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 16643 ms. Remains : 1306/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s601 0) (NEQ s1082 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 26342 steps with 646 reset in 539 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-00 finished in 17401 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)||(p1 U G(!p1))))'
Support contains 3 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 30 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-10 20:09:39] [INFO ] Computed 600 place invariants in 1755 ms
[2023-03-10 20:09:54] [INFO ] Implicit Places using invariants in 16857 ms returned []
[2023-03-10 20:09:54] [INFO ] Invariant cache hit.
[2023-03-10 20:12:34] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 20:12:34] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 20:12:34] [INFO ] Implicit Places using invariants and state equation in 160031 ms returned []
Implicit Place search using SMT with State Equation took 176902 ms to find 0 implicit places.
[2023-03-10 20:12:34] [INFO ] Invariant cache hit.
[2023-03-10 20:12:43] [INFO ] Dead Transitions using invariants and state equation in 8684 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185630 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, (AND p1 (NOT p0)), p1]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 5}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 1}, { cond=(NOT p1), acceptance={} source=4 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=p1, acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(OR (EQ s1308 0) (EQ s1234 1)), p0:(EQ s267 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, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 250 steps with 0 reset in 4 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-02 finished in 185939 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((G((!p2||F(p3)))||p1)))))'
Support contains 8 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 25 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 20:12:43] [INFO ] Invariant cache hit.
[2023-03-10 20:12:59] [INFO ] Implicit Places using invariants in 15968 ms returned []
[2023-03-10 20:12:59] [INFO ] Invariant cache hit.
[2023-03-10 20:15:39] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 20:15:39] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 20:15:39] [INFO ] Implicit Places using invariants and state equation in 160025 ms returned []
Implicit Place search using SMT with State Equation took 175996 ms to find 0 implicit places.
[2023-03-10 20:15:39] [INFO ] Invariant cache hit.
[2023-03-10 20:15:48] [INFO ] Dead Transitions using invariants and state equation in 8604 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184628 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 371 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s558 0) (EQ s1290 1) (NOT (OR (EQ s732 0) (EQ s104 1)))), p1:(OR (EQ s1200 0) (EQ s522 1)), p2:(OR (EQ s1050 0) (EQ s29 1)), p3:(OR (EQ s1200 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33384 reset in 716 ms.
Product exploration explored 100000 steps with 33223 reset in 743 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1070 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Finished random walk after 4892 steps, including 19 resets, run visited all 10 properties in 200 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p3) p2 (NOT p1))), (F (AND (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p3) p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p3) p2 (NOT p1))), (F (AND p0 (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1318 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 22 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 20:15:54] [INFO ] Invariant cache hit.
[2023-03-10 20:16:09] [INFO ] Implicit Places using invariants in 15813 ms returned []
[2023-03-10 20:16:09] [INFO ] Invariant cache hit.
[2023-03-10 20:18:49] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 20:18:49] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 20:18:49] [INFO ] Implicit Places using invariants and state equation in 160034 ms returned []
Implicit Place search using SMT with State Equation took 175849 ms to find 0 implicit places.
[2023-03-10 20:18:49] [INFO ] Invariant cache hit.
[2023-03-10 20:18:58] [INFO ] Dead Transitions using invariants and state equation in 8587 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184459 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 914 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Finished random walk after 4631 steps, including 18 resets, run visited all 10 properties in 176 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND p0 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 14 factoid took 1254 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 351 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 295 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Product exploration explored 100000 steps with 33213 reset in 655 ms.
Product exploration explored 100000 steps with 33281 reset in 755 ms.
Applying partial POR strategy [false, true, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Graph (complete) has 4723 edges and 1320 vertex of which 1313 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.11 ms
Discarding 7 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Applied a total of 1 rules in 95 ms. Remains 1313 /1320 variables (removed 7) and now considering 1189/1190 (removed 1) transitions.
[2023-03-10 20:19:04] [INFO ] Redundant transitions in 76 ms returned []
// Phase 1: matrix 1189 rows 1313 cols
[2023-03-10 20:19:06] [INFO ] Computed 594 place invariants in 1699 ms
[2023-03-10 20:20:06] [INFO ] Performed 0/1189 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 20:20:06] [INFO ] Dead Transitions using invariants and state equation in 61731 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1313/1320 places, 1189/1190 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61912 ms. Remains : 1313/1320 places, 1189/1190 transitions.
Support contains 8 out of 1320 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1320/1320 places, 1190/1190 transitions.
Applied a total of 0 rules in 60 ms. Remains 1320 /1320 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1320 cols
[2023-03-10 20:20:08] [INFO ] Computed 600 place invariants in 1789 ms
[2023-03-10 20:20:23] [INFO ] Implicit Places using invariants in 16504 ms returned []
[2023-03-10 20:20:23] [INFO ] Invariant cache hit.
[2023-03-10 20:23:03] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 20:23:03] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 20:23:03] [INFO ] Implicit Places using invariants and state equation in 160033 ms returned []
Implicit Place search using SMT with State Equation took 176543 ms to find 0 implicit places.
[2023-03-10 20:23:03] [INFO ] Invariant cache hit.
[2023-03-10 20:23:11] [INFO ] Dead Transitions using invariants and state equation in 8595 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185227 ms. Remains : 1320/1320 places, 1190/1190 transitions.
Treatment of property Echo-PT-d03r05-LTLCardinality-04 finished in 628549 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)||F(p1))))'
Support contains 4 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 58 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 20:23:12] [INFO ] Invariant cache hit.
[2023-03-10 20:23:28] [INFO ] Implicit Places using invariants in 16683 ms returned []
[2023-03-10 20:23:28] [INFO ] Invariant cache hit.
[2023-03-10 20:26:08] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 20:26:08] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 20:26:08] [INFO ] Implicit Places using invariants and state equation in 160040 ms returned []
Implicit Place search using SMT with State Equation took 176723 ms to find 0 implicit places.
[2023-03-10 20:26:08] [INFO ] Invariant cache hit.
[2023-03-10 20:26:16] [INFO ] Dead Transitions using invariants and state equation in 8065 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184862 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s164 0) (EQ s240 1)), p0:(OR (EQ s1237 0) (EQ s655 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]]
Product exploration explored 100000 steps with 50000 reset in 637 ms.
Product exploration explored 100000 steps with 50000 reset in 651 ms.
Computed a total of 1320 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1320 transition count 1190
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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 8 factoid took 128 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLCardinality-05 finished in 186844 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))))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1320 transition count 1190
Applied a total of 1 rules in 25 ms. Remains 1320 /1321 variables (removed 1) and now considering 1190/1190 (removed 0) transitions.
[2023-03-10 20:26:18] [INFO ] Invariant cache hit.
[2023-03-10 20:26:34] [INFO ] Implicit Places using invariants in 15831 ms returned []
[2023-03-10 20:26:34] [INFO ] Invariant cache hit.
[2023-03-10 20:29:14] [INFO ] Performed 0/1320 implicitness test of which 0 returned IMPLICIT in 157 seconds.
[2023-03-10 20:29:14] [INFO ] Timeout of Implicit test with SMT after 157 seconds.
[2023-03-10 20:29:14] [INFO ] Implicit Places using invariants and state equation in 160023 ms returned []
Implicit Place search using SMT with State Equation took 175870 ms to find 0 implicit places.
[2023-03-10 20:29:14] [INFO ] Invariant cache hit.
[2023-03-10 20:29:23] [INFO ] Dead Transitions using invariants and state equation in 8288 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1320/1321 places, 1190/1190 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 184205 ms. Remains : 1320/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (NEQ s471 0) (NEQ s271 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-06 finished in 184352 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(F(p0)))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Applied a total of 0 rules in 19 ms. Remains 1321 /1321 variables (removed 0) and now considering 1190/1190 (removed 0) transitions.
// Phase 1: matrix 1190 rows 1321 cols
[2023-03-10 20:29:24] [INFO ] Computed 601 place invariants in 1398 ms
[2023-03-10 20:29:41] [INFO ] Implicit Places using invariants in 18209 ms returned []
[2023-03-10 20:29:41] [INFO ] Invariant cache hit.
[2023-03-10 20:29:55] [INFO ] Implicit Places using invariants and state equation in 13588 ms returned []
Implicit Place search using SMT with State Equation took 31797 ms to find 0 implicit places.
[2023-03-10 20:29:55] [INFO ] Invariant cache hit.
[2023-03-10 20:30:55] [INFO ] Performed 1/1190 'is it Dead' test of which 0 returned DEAD in 57 seconds.
[2023-03-10 20:30:55] [INFO ] Dead Transitions using invariants and state equation in 60032 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91849 ms. Remains : 1321/1321 places, 1190/1190 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s830 0) (EQ s470 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 626 ms.
Product exploration explored 100000 steps with 50000 reset in 663 ms.
Computed a total of 1321 stabilizing places and 1190 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1321 transition count 1190
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Echo-PT-d03r05-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d03r05-LTLCardinality-09 finished in 93739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.5 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 69 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-10 20:30:58] [INFO ] Computed 594 place invariants in 1473 ms
[2023-03-10 20:31:12] [INFO ] Implicit Places using invariants in 15446 ms returned [716, 737, 763, 864]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 15448 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1308/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 38 ms. Remains 1308 /1308 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15574 ms. Remains : 1308/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-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:(AND (NEQ s869 0) (NEQ s920 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 751 steps with 4 reset in 14 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-11 finished in 15727 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)))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.3 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 77 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
[2023-03-10 20:31:12] [INFO ] Invariant cache hit.
[2023-03-10 20:33:52] [INFO ] Performed 716/1312 implicitness test of which 2 returned IMPLICIT in 158 seconds.
[2023-03-10 20:33:52] [INFO ] Implicit Places using invariants in 160065 ms returned [615, 716]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 160068 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1310/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 44 ms. Remains 1310 /1310 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 160190 ms. Remains : 1310/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s557 0) (EQ s880 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 401 reset in 1315 ms.
Product exploration explored 100000 steps with 401 reset in 1373 ms.
Computed a total of 1310 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1310 transition count 1188
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 215 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=43 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 2 out of 1310 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1310/1310 places, 1188/1188 transitions.
Applied a total of 0 rules in 36 ms. Remains 1310 /1310 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
// Phase 1: matrix 1188 rows 1310 cols
[2023-03-10 20:33:58] [INFO ] Computed 592 place invariants in 1493 ms
[2023-03-10 20:34:10] [INFO ] Implicit Places using invariants in 13900 ms returned [735, 740, 761, 862]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 13902 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1306/1310 places, 1188/1188 transitions.
Applied a total of 0 rules in 48 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13989 ms. Remains : 1306/1310 places, 1188/1188 transitions.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 821 steps, including 3 resets, run visited all 1 properties in 13 ms. (steps per millisecond=63 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Product exploration explored 100000 steps with 401 reset in 1269 ms.
Product exploration explored 100000 steps with 401 reset in 1389 ms.
Support contains 2 out of 1306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 33 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
// Phase 1: matrix 1188 rows 1306 cols
[2023-03-10 20:34:15] [INFO ] Computed 588 place invariants in 1483 ms
[2023-03-10 20:36:55] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 20:36:55] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 20:36:55] [INFO ] Implicit Places using invariants in 161500 ms returned []
[2023-03-10 20:36:55] [INFO ] Invariant cache hit.
[2023-03-10 20:39:35] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 20:39:35] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 20:39:35] [INFO ] Implicit Places using invariants and state equation in 160026 ms returned []
Implicit Place search using SMT with State Equation took 321527 ms to find 0 implicit places.
[2023-03-10 20:39:35] [INFO ] Redundant transitions in 120 ms returned []
[2023-03-10 20:39:35] [INFO ] Invariant cache hit.
[2023-03-10 20:40:35] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 20:40:35] [INFO ] Dead Transitions using invariants and state equation in 60015 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 381714 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Treatment of property Echo-PT-d03r05-LTLCardinality-13 finished in 563291 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))'
Support contains 2 out of 1321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 58 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
// Phase 1: matrix 1188 rows 1312 cols
[2023-03-10 20:40:37] [INFO ] Computed 594 place invariants in 1551 ms
[2023-03-10 20:40:51] [INFO ] Implicit Places using invariants in 15132 ms returned [615, 737, 742, 763, 864]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 15134 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 1307/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 32 ms. Remains 1307 /1307 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 15231 ms. Remains : 1307/1321 places, 1188/1190 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1110 0) (EQ s780 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 376 steps with 3 reset in 6 ms.
FORMULA Echo-PT-d03r05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d03r05-LTLCardinality-15 finished in 15355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((G((!p2||F(p3)))||p1)))))'
Found a Lengthening insensitive property : Echo-PT-d03r05-LTLCardinality-04
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1321 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1321/1321 places, 1190/1190 transitions.
Graph (complete) has 4731 edges and 1321 vertex of which 1313 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.6 ms
Discarding 8 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Applied a total of 1 rules in 36 ms. Remains 1312 /1321 variables (removed 9) and now considering 1188/1190 (removed 2) transitions.
[2023-03-10 20:40:51] [INFO ] Invariant cache hit.
[2023-03-10 20:43:31] [INFO ] Performed 1205/1312 implicitness test of which 5 returned IMPLICIT in 158 seconds.
[2023-03-10 20:43:31] [INFO ] Implicit Places using invariants in 160027 ms returned [615, 737, 742, 763, 864]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 160031 ms to find 5 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 1307/1321 places, 1188/1190 transitions.
Applied a total of 0 rules in 30 ms. Remains 1307 /1307 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 160098 ms. Remains : 1307/1321 places, 1188/1190 transitions.
Running random walk in product with property : Echo-PT-d03r05-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (EQ s556 0) (EQ s1277 1) (NOT (OR (EQ s729 0) (EQ s104 1)))), p1:(OR (EQ s1187 0) (EQ s520 1)), p2:(OR (EQ s1037 0) (EQ s29 1)), p3:(OR (EQ s1187 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33264 reset in 652 ms.
Product exploration explored 100000 steps with 33300 reset in 702 ms.
Computed a total of 1307 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1307 transition count 1188
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 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 885 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 364 ms. (steps per millisecond=27 ) properties (out of 10) seen :7
Finished Best-First random walk after 6130 steps, including 1 resets, run visited all 3 properties in 35 ms. (steps per millisecond=175 )
Knowledge obtained : [(AND p0 p1 p2 p3), (X p1), (X (NOT (AND (NOT p1) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X p3)), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p3) p2 (NOT p1))), (F (AND (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p3) p2)), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p3) p2 (NOT p1))), (F (AND p0 (NOT p3) (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 14 factoid took 1128 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2 (NOT p1)), (AND p0 (NOT p3) p2 (NOT p1)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1307/1307 places, 1188/1188 transitions.
Applied a total of 0 rules in 18 ms. Remains 1307 /1307 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
// Phase 1: matrix 1188 rows 1307 cols
[2023-03-10 20:43:38] [INFO ] Computed 589 place invariants in 1401 ms
[2023-03-10 20:43:53] [INFO ] Implicit Places using invariants in 16571 ms returned [715]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16572 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1306/1307 places, 1188/1188 transitions.
Applied a total of 0 rules in 18 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 16609 ms. Remains : 1306/1307 places, 1188/1188 transitions.
Computed a total of 1306 stabilizing places and 1188 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1306 transition count 1188
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 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 958 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Incomplete random walk after 10000 steps, including 40 resets, run finished after 440 ms. (steps per millisecond=22 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1188 rows 1306 cols
[2023-03-10 20:43:57] [INFO ] Computed 588 place invariants in 1412 ms
[2023-03-10 20:43:59] [INFO ] [Real]Absence check using 0 positive and 588 generalized place invariants in 1462 ms returned sat
[2023-03-10 20:43:59] [INFO ] After 2064ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-10 20:44:01] [INFO ] [Nat]Absence check using 0 positive and 588 generalized place invariants in 1550 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 20:44:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-10 20:44:24] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 8 out of 1306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Graph (complete) has 4638 edges and 1306 vertex of which 1300 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 1300 transition count 1182
Applied a total of 7 rules in 45 ms. Remains 1300 /1306 variables (removed 6) and now considering 1182/1188 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 1300/1306 places, 1182/1188 transitions.
Finished random walk after 1829 steps, including 7 resets, run visited all 3 properties in 54 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 p3 p2 p1), (X p1), (X (NOT (AND p0 (NOT p3) p2 (NOT p1)))), (X (NOT (AND (NOT p3) p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p3) p2 (NOT p1))))), (X (X (NOT (AND (NOT p3) p2)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT p0)), (F (NOT p1)), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 14 factoid took 1337 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 8 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Product exploration explored 100000 steps with 33152 reset in 643 ms.
Product exploration explored 100000 steps with 33191 reset in 706 ms.
Applying partial POR strategy [false, true, false, true, true, true, false, true]
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) p2 (NOT p3)), (AND (NOT p1) p2 (NOT p3)), (AND p0 (NOT p1) p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p1) p2 (NOT p3)), (AND (NOT p3) p2)]
Support contains 8 out of 1306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 34 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-10 20:44:28] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-10 20:44:28] [INFO ] Invariant cache hit.
[2023-03-10 20:45:28] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 20:45:28] [INFO ] Dead Transitions using invariants and state equation in 60022 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60087 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Support contains 8 out of 1306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1306/1306 places, 1188/1188 transitions.
Applied a total of 0 rules in 17 ms. Remains 1306 /1306 variables (removed 0) and now considering 1188/1188 (removed 0) transitions.
[2023-03-10 20:45:28] [INFO ] Invariant cache hit.
[2023-03-10 20:45:42] [INFO ] Implicit Places using invariants in 14212 ms returned []
[2023-03-10 20:45:42] [INFO ] Invariant cache hit.
[2023-03-10 20:48:22] [INFO ] Performed 0/1306 implicitness test of which 0 returned IMPLICIT in 158 seconds.
[2023-03-10 20:48:22] [INFO ] Timeout of Implicit test with SMT after 158 seconds.
[2023-03-10 20:48:22] [INFO ] Implicit Places using invariants and state equation in 160022 ms returned []
Implicit Place search using SMT with State Equation took 174236 ms to find 0 implicit places.
[2023-03-10 20:48:22] [INFO ] Invariant cache hit.
[2023-03-10 20:49:22] [INFO ] Performed 890/1188 'is it Dead' test of which 0 returned DEAD in 58 seconds.
[2023-03-10 20:49:22] [INFO ] Dead Transitions using invariants and state equation in 60016 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234271 ms. Remains : 1306/1306 places, 1188/1188 transitions.
Treatment of property Echo-PT-d03r05-LTLCardinality-04 finished in 511681 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)))'
[2023-03-10 20:49:23] [INFO ] Flatten gal took : 97 ms
[2023-03-10 20:49:23] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-10 20:49:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1321 places, 1190 transitions and 7669 arcs took 21 ms.
Total runtime 2498695 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1901/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1901/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Echo-PT-d03r05-LTLCardinality-04
Could not compute solution for formula : Echo-PT-d03r05-LTLCardinality-13
BK_STOP 1678481366109
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name Echo-PT-d03r05-LTLCardinality-04
ltl formula formula --ltl=/tmp/1901/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1321 places, 1190 transitions and 7669 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1901/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1901/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.050 user 0.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1901/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1901/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name Echo-PT-d03r05-LTLCardinality-13
ltl formula formula --ltl=/tmp/1901/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1321 places, 1190 transitions and 7669 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.060 user 0.050 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1901/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1901/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1901/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1901/ltl_1_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
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="Echo-PT-d03r05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Echo-PT-d03r05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r169-tall-167838855400091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d03r05.tgz
mv Echo-PT-d03r05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;