MCC'2022- Execution of r078-tall-165260110300396

About the Execution of ITS-Tools for Echo-PT-d02r19

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1905.823	273585.00	305258.00	1622.20	FFFFTFFTTFFFFTFF	normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r078-tall-165260110300396.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Echo-PT-d02r19, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110300396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 7.7K Apr 29 11:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 29 11:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 29 11:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 29 11:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 1.5M May 10 09:33 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-d02r19-LTLFireability-00
FORMULA_NAME Echo-PT-d02r19-LTLFireability-01
FORMULA_NAME Echo-PT-d02r19-LTLFireability-02
FORMULA_NAME Echo-PT-d02r19-LTLFireability-03
FORMULA_NAME Echo-PT-d02r19-LTLFireability-04
FORMULA_NAME Echo-PT-d02r19-LTLFireability-05
FORMULA_NAME Echo-PT-d02r19-LTLFireability-06
FORMULA_NAME Echo-PT-d02r19-LTLFireability-07
FORMULA_NAME Echo-PT-d02r19-LTLFireability-08
FORMULA_NAME Echo-PT-d02r19-LTLFireability-09
FORMULA_NAME Echo-PT-d02r19-LTLFireability-10
FORMULA_NAME Echo-PT-d02r19-LTLFireability-11
FORMULA_NAME Echo-PT-d02r19-LTLFireability-12
FORMULA_NAME Echo-PT-d02r19-LTLFireability-13
FORMULA_NAME Echo-PT-d02r19-LTLFireability-14
FORMULA_NAME Echo-PT-d02r19-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652671363665

Running Version 202205111006
[2022-05-16 03:22:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 03:22:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 03:22:45] [INFO ] Load time of PNML (sax parser for PT used): 287 ms
[2022-05-16 03:22:45] [INFO ] Transformed 3455 places.
[2022-05-16 03:22:45] [INFO ] Transformed 2730 transitions.
[2022-05-16 03:22:45] [INFO ] Found NUPN structural information;
[2022-05-16 03:22:45] [INFO ] Parsed PT model containing 3455 places and 2730 transitions in 421 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Echo-PT-d02r19-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Echo-PT-d02r19-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 3455 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3455/3455 places, 2730/2730 transitions.
Reduce places removed 361 places and 0 transitions.
Iterating post reduction 0 with 361 rules applied. Total rules applied 361 place count 3094 transition count 2730
Applied a total of 361 rules in 395 ms. Remains 3094 /3455 variables (removed 361) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:22:50] [INFO ] Computed 1368 place invariants in 4405 ms
[2022-05-16 03:22:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:22:52] [INFO ] Implicit Places using invariants in 6911 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:22:56] [INFO ] Computed 1368 place invariants in 4057 ms
[2022-05-16 03:22:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:22:59] [INFO ] Implicit Places using invariants and state equation in 6347 ms returned []
Implicit Place search using SMT with State Equation took 13287 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:03] [INFO ] Computed 1368 place invariants in 3963 ms
[2022-05-16 03:23:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:04] [INFO ] Dead Transitions using invariants and state equation in 5774 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3094/3455 places, 2730/2730 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3455 places, 2730/2730 transitions.
Support contains 81 out of 3094 places after structural reductions.
[2022-05-16 03:23:05] [INFO ] Flatten gal took : 350 ms
[2022-05-16 03:23:05] [INFO ] Flatten gal took : 200 ms
[2022-05-16 03:23:05] [INFO ] Input system was already deterministic with 2730 transitions.
Finished random walk after 6219 steps, including 8 resets, run visited all 29 properties in 438 ms. (steps per millisecond=14 )
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(X(p0))&&p1))||G(p2)))'
Support contains 10 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 187 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:11] [INFO ] Computed 1368 place invariants in 4119 ms
[2022-05-16 03:23:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:13] [INFO ] Implicit Places using invariants in 6442 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:18] [INFO ] Computed 1368 place invariants in 4670 ms
[2022-05-16 03:23:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:20] [INFO ] Implicit Places using invariants and state equation in 6867 ms returned []
Implicit Place search using SMT with State Equation took 13320 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:25] [INFO ] Computed 1368 place invariants in 4634 ms
[2022-05-16 03:23:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:26] [INFO ] Dead Transitions using invariants and state equation in 6389 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2)]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p2) (NOT p0))), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1 p0), acceptance={} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p1)) (AND p2 (NOT p0))), acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(OR (EQ s613 0) (EQ s614 0) (EQ s616 0) (EQ s1980 0)), p1:(OR (AND (EQ s613 1) (EQ s614 1) (EQ s616 1) (EQ s1980 1)) (AND (EQ s2100 1) (EQ s2481 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1200 steps with 1 reset in 48 ms.
FORMULA Echo-PT-d02r19-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-00 finished in 20316 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(F(p1)))))'
Support contains 6 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 141 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:31] [INFO ] Computed 1368 place invariants in 3996 ms
[2022-05-16 03:23:31] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:33] [INFO ] Implicit Places using invariants in 6176 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:37] [INFO ] Computed 1368 place invariants in 3981 ms
[2022-05-16 03:23:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:39] [INFO ] Implicit Places using invariants and state equation in 6314 ms returned []
Implicit Place search using SMT with State Equation took 12493 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:43] [INFO ] Computed 1368 place invariants in 3959 ms
[2022-05-16 03:23:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:45] [INFO ] Dead Transitions using invariants and state equation in 5709 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s877 1) (NEQ s2608 1) (NEQ s2609 1) (NEQ s2610 1)), p1:(OR (NEQ s2114 1) (NEQ s2535 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1375 ms.
Product exploration explored 100000 steps with 33333 reset in 1400 ms.
Computed a total of 3094 stabilizing places and 2730 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3094 transition count 2730
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 p0), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r19-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r19-LTLFireability-04 finished in 22833 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(F(p0)))||G(p1))))'
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 147 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:23:54] [INFO ] Computed 1368 place invariants in 4018 ms
[2022-05-16 03:23:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:23:56] [INFO ] Implicit Places using invariants in 6256 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:24:00] [INFO ] Computed 1368 place invariants in 4016 ms
[2022-05-16 03:24:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:02] [INFO ] Implicit Places using invariants and state equation in 6104 ms returned []
Implicit Place search using SMT with State Equation took 12362 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:24:06] [INFO ] Computed 1368 place invariants in 4082 ms
[2022-05-16 03:24:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:08] [INFO ] Dead Transitions using invariants and state equation in 5771 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2173 1) (EQ s2765 1)), p0:(AND (EQ s456 1) (EQ s2384 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 972 steps with 1 reset in 20 ms.
FORMULA Echo-PT-d02r19-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-05 finished in 18467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(G(F(p0))))||F(G((G(p2)||p1)))))'
Support contains 12 out of 3094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3089 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.29 ms
Discarding 5 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 334 ms. Remains 3088 /3094 variables (removed 6) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:24:13] [INFO ] Computed 1364 place invariants in 4410 ms
[2022-05-16 03:24:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:15] [INFO ] Implicit Places using invariants in 6544 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:24:19] [INFO ] Computed 1364 place invariants in 4380 ms
[2022-05-16 03:24:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:21] [INFO ] Implicit Places using invariants and state equation in 6529 ms returned []
Implicit Place search using SMT with State Equation took 13075 ms to find 0 implicit places.
[2022-05-16 03:24:22] [INFO ] Redundant transitions in 153 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:24:26] [INFO ] Computed 1364 place invariants in 4317 ms
[2022-05-16 03:24:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:28] [INFO ] Dead Transitions using invariants and state equation in 6018 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3094 places, 2728/2730 transitions.
Finished structural reductions, in 1 iterations. Remains : 3088/3094 places, 2728/2730 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (EQ s531 0) (EQ s532 0) (EQ s534 0) (EQ s1897 0)), p0:(AND (EQ s1108 1) (EQ s2831 1) (EQ s2833 1) (EQ s2834 1)), p1:(OR (EQ s437 0) (EQ s438 0) (EQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 139 reset in 1963 ms.
Product exploration explored 100000 steps with 140 reset in 2211 ms.
Computed a total of 3088 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3088 transition count 2728
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 p2 (NOT p0) p1), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (AND p2 (NOT p0) p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (F (G p2)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 12 factoid took 395 ms. Reduced automaton from 2 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r19-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r19-LTLFireability-07 finished in 25567 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 3094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3089 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Discarding 5 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 195 ms. Remains 3088 /3094 variables (removed 6) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:24:38] [INFO ] Computed 1364 place invariants in 4302 ms
[2022-05-16 03:24:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:40] [INFO ] Implicit Places using invariants in 6478 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:24:45] [INFO ] Computed 1364 place invariants in 4466 ms
[2022-05-16 03:24:45] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:47] [INFO ] Implicit Places using invariants and state equation in 6743 ms returned []
Implicit Place search using SMT with State Equation took 13225 ms to find 0 implicit places.
[2022-05-16 03:24:47] [INFO ] Redundant transitions in 59 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:24:52] [INFO ] Computed 1364 place invariants in 4966 ms
[2022-05-16 03:24:52] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:24:54] [INFO ] Dead Transitions using invariants and state equation in 6766 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3094 places, 2728/2730 transitions.
Finished structural reductions, in 1 iterations. Remains : 3088/3094 places, 2728/2730 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-08 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 (NEQ s36 1) (NEQ s37 1) (NEQ s1402 1) (AND (EQ s4 1) (EQ s5 1) (EQ s6 1) (EQ s1367 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 138 reset in 2151 ms.
Product exploration explored 100000 steps with 138 reset in 2393 ms.
Computed a total of 3088 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3088 transition count 2728
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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r19-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r19-LTLFireability-08 finished in 26406 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(p0))||X(F(p1))||F(p2)))'
Support contains 8 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 140 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:04] [INFO ] Computed 1368 place invariants in 3919 ms
[2022-05-16 03:25:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:06] [INFO ] Implicit Places using invariants in 6148 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:10] [INFO ] Computed 1368 place invariants in 3932 ms
[2022-05-16 03:25:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:12] [INFO ] Implicit Places using invariants and state equation in 6183 ms returned []
Implicit Place search using SMT with State Equation took 12333 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:16] [INFO ] Computed 1368 place invariants in 3907 ms
[2022-05-16 03:25:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:18] [INFO ] Dead Transitions using invariants and state equation in 5569 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p2:(AND (EQ s991 1) (EQ s2719 1) (EQ s2720 1) (EQ s2722 1)), p1:(AND (EQ s724 1) (EQ s2453 1)), p0:(OR (EQ s39 0) (EQ s2269 0))], 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 962 steps with 19 reset in 18 ms.
FORMULA Echo-PT-d02r19-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-09 finished in 18186 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(p1)&&p0)||((!p3 U G(p4))&&p2)))))'
Support contains 10 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 150 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:22] [INFO ] Computed 1368 place invariants in 3924 ms
[2022-05-16 03:25:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:24] [INFO ] Implicit Places using invariants in 6102 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:28] [INFO ] Computed 1368 place invariants in 3924 ms
[2022-05-16 03:25:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:30] [INFO ] Implicit Places using invariants and state equation in 6058 ms returned []
Implicit Place search using SMT with State Equation took 12161 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:34] [INFO ] Computed 1368 place invariants in 3916 ms
[2022-05-16 03:25:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:36] [INFO ] Dead Transitions using invariants and state equation in 5664 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 805 ms :[(OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p4)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (NOT p4), (NOT p4), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4))]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p4) p3)), acceptance={} source=2 dest: 3}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p1) (NOT p4) p3)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2 p4 p3), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=2 dest: 7}, { cond=(AND p0 (NOT p1) p2 p4 p3), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p4), acceptance={} source=5 dest: 3}, { cond=p4, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p4) p3), acceptance={} source=6 dest: 3}, { cond=(AND p4 p3), acceptance={} source=6 dest: 5}, { cond=(AND p4 (NOT p3)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p4) p3), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p1) p4 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) (NOT p4) (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND (NOT p1) p4 p3), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p1) p4), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s1148 1) (EQ s2875 1) (EQ s2876 1) (EQ s2877 1)), p2:(AND (EQ s1148 1) (EQ s2875 1) (EQ s2876 1) (EQ s2877 1)), p4:(AND (EQ s2137 1) (EQ s2624...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d02r19-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-10 finished in 18817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(G(p0))||X(G(p1))))))'
Support contains 4 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 135 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:41] [INFO ] Computed 1368 place invariants in 3934 ms
[2022-05-16 03:25:42] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:43] [INFO ] Implicit Places using invariants in 6113 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:47] [INFO ] Computed 1368 place invariants in 3949 ms
[2022-05-16 03:25:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:49] [INFO ] Implicit Places using invariants and state equation in 6303 ms returned []
Implicit Place search using SMT with State Equation took 12418 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:53] [INFO ] Computed 1368 place invariants in 3951 ms
[2022-05-16 03:25:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:25:55] [INFO ] Dead Transitions using invariants and state equation in 5649 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(OR (EQ s367 0) (EQ s2362 0)), p0:(AND (EQ s101 1) (EQ s2290 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, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2272 steps with 3 reset in 48 ms.
FORMULA Echo-PT-d02r19-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-11 finished in 18441 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 134 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:25:59] [INFO ] Computed 1368 place invariants in 3977 ms
[2022-05-16 03:26:00] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:02] [INFO ] Implicit Places using invariants in 6136 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:26:06] [INFO ] Computed 1368 place invariants in 3947 ms
[2022-05-16 03:26:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:08] [INFO ] Implicit Places using invariants and state equation in 6135 ms returned []
Implicit Place search using SMT with State Equation took 12272 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:26:12] [INFO ] Computed 1368 place invariants in 3916 ms
[2022-05-16 03:26:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:13] [INFO ] Dead Transitions using invariants and state equation in 5632 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s687 1) (EQ s2444 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]]
Stuttering criterion allowed to conclude after 1402 steps with 2 reset in 46 ms.
FORMULA Echo-PT-d02r19-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-12 finished in 18168 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(F(((G(p2)&&p1)||p0))))))'
Support contains 6 out of 3094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3089 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.17 ms
Discarding 5 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 197 ms. Remains 3088 /3094 variables (removed 6) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:26:18] [INFO ] Computed 1364 place invariants in 4325 ms
[2022-05-16 03:26:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:20] [INFO ] Implicit Places using invariants in 6589 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:26:25] [INFO ] Computed 1364 place invariants in 4331 ms
[2022-05-16 03:26:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:27] [INFO ] Implicit Places using invariants and state equation in 6501 ms returned []
Implicit Place search using SMT with State Equation took 13099 ms to find 0 implicit places.
[2022-05-16 03:26:27] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:26:31] [INFO ] Computed 1364 place invariants in 4329 ms
[2022-05-16 03:26:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:33] [INFO ] Dead Transitions using invariants and state equation in 5997 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3094 places, 2728/2730 transitions.
Finished structural reductions, in 1 iterations. Remains : 3088/3094 places, 2728/2730 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s2185 1) (EQ s2814 1)), p0:(OR (EQ s2185 0) (EQ s2814 0)), p2:(AND (EQ s741 1) (EQ s2466 1) (EQ s2467 1) (EQ s2468 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 154 reset in 1940 ms.
Product exploration explored 100000 steps with 163 reset in 2157 ms.
Computed a total of 3088 stabilizing places and 2728 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3088 transition count 2728
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) p0 (NOT p2)), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X (NOT (AND p1 (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (F (G (NOT p1))), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 10 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d02r19-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d02r19-LTLFireability-13 finished in 25137 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 3094 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Graph (complete) has 9333 edges and 3094 vertex of which 3089 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.10 ms
Discarding 5 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 172 ms. Remains 3088 /3094 variables (removed 6) and now considering 2728/2730 (removed 2) transitions.
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:26:43] [INFO ] Computed 1364 place invariants in 4287 ms
[2022-05-16 03:26:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:45] [INFO ] Implicit Places using invariants in 6422 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:26:50] [INFO ] Computed 1364 place invariants in 4302 ms
[2022-05-16 03:26:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:52] [INFO ] Implicit Places using invariants and state equation in 6493 ms returned []
Implicit Place search using SMT with State Equation took 12917 ms to find 0 implicit places.
[2022-05-16 03:26:52] [INFO ] Redundant transitions in 90 ms returned []
// Phase 1: matrix 2728 rows 3088 cols
[2022-05-16 03:26:56] [INFO ] Computed 1364 place invariants in 4304 ms
[2022-05-16 03:26:57] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:26:58] [INFO ] Dead Transitions using invariants and state equation in 5985 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3088/3094 places, 2728/2730 transitions.
Finished structural reductions, in 1 iterations. Remains : 3088/3094 places, 2728/2730 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-14 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 (EQ s2141 1) (EQ s2641 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 1738 steps with 8 reset in 34 ms.
FORMULA Echo-PT-d02r19-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-14 finished in 19287 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U !p0)&&X(X(G(p1)))&&F(p2)))'
Support contains 10 out of 3094 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3094/3094 places, 2730/2730 transitions.
Applied a total of 0 rules in 134 ms. Remains 3094 /3094 variables (removed 0) and now considering 2730/2730 (removed 0) transitions.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:27:02] [INFO ] Computed 1368 place invariants in 3966 ms
[2022-05-16 03:27:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:27:04] [INFO ] Implicit Places using invariants in 6182 ms returned []
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:27:08] [INFO ] Computed 1368 place invariants in 3941 ms
[2022-05-16 03:27:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:27:10] [INFO ] Implicit Places using invariants and state equation in 6075 ms returned []
Implicit Place search using SMT with State Equation took 12273 ms to find 0 implicit places.
// Phase 1: matrix 2730 rows 3094 cols
[2022-05-16 03:27:14] [INFO ] Computed 1368 place invariants in 3958 ms
[2022-05-16 03:27:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-16 03:27:16] [INFO ] Dead Transitions using invariants and state equation in 5762 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3094/3094 places, 2730/2730 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p2) (NOT p1) p0), true, (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : Echo-PT-d02r19-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s179 1) (EQ s180 1) (EQ s182 1) (EQ s1546 1)), p2:(AND (EQ s2190 1) (EQ s2832 1)), p1:(OR (EQ s1267 0) (EQ s2998 0) (EQ s2999 0) (EQ s3000 0))...], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1445 steps with 1 reset in 34 ms.
FORMULA Echo-PT-d02r19-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d02r19-LTLFireability-15 finished in 18372 ms.
All properties solved by simple procedures.
Total runtime 272033 ms.

BK_STOP 1652671637250

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Echo-PT-d02r19"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Echo-PT-d02r19, 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 r078-tall-165260110300396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d02r19.tgz
mv Echo-PT-d02r19 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;