About the Execution of ITS-Tools for Echo-PT-d05r03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3352.399 | 671178.00 | 715609.00 | 1735.30 | TTFTFTFFTFFFTTFF | 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-165260110300436.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-d05r03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-tall-165260110300436
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 6.3K Apr 29 11:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 29 11:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 29 11:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 11:39 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.5K May 9 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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 2.3M 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-d05r03-LTLFireability-00
FORMULA_NAME Echo-PT-d05r03-LTLFireability-01
FORMULA_NAME Echo-PT-d05r03-LTLFireability-02
FORMULA_NAME Echo-PT-d05r03-LTLFireability-03
FORMULA_NAME Echo-PT-d05r03-LTLFireability-04
FORMULA_NAME Echo-PT-d05r03-LTLFireability-05
FORMULA_NAME Echo-PT-d05r03-LTLFireability-06
FORMULA_NAME Echo-PT-d05r03-LTLFireability-07
FORMULA_NAME Echo-PT-d05r03-LTLFireability-08
FORMULA_NAME Echo-PT-d05r03-LTLFireability-09
FORMULA_NAME Echo-PT-d05r03-LTLFireability-10
FORMULA_NAME Echo-PT-d05r03-LTLFireability-11
FORMULA_NAME Echo-PT-d05r03-LTLFireability-12
FORMULA_NAME Echo-PT-d05r03-LTLFireability-13
FORMULA_NAME Echo-PT-d05r03-LTLFireability-14
FORMULA_NAME Echo-PT-d05r03-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652682205701
Running Version 202205111006
[2022-05-16 06:23:26] [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 06:23:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:23:27] [INFO ] Load time of PNML (sax parser for PT used): 292 ms
[2022-05-16 06:23:27] [INFO ] Transformed 3717 places.
[2022-05-16 06:23:27] [INFO ] Transformed 3222 transitions.
[2022-05-16 06:23:27] [INFO ] Found NUPN structural information;
[2022-05-16 06:23:27] [INFO ] Parsed PT model containing 3717 places and 3222 transitions in 427 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 1 formulas.
FORMULA Echo-PT-d05r03-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 153 out of 3717 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3717/3717 places, 3222/3222 transitions.
Reduce places removed 243 places and 0 transitions.
Iterating post reduction 0 with 243 rules applied. Total rules applied 243 place count 3474 transition count 3222
Applied a total of 243 rules in 337 ms. Remains 3474 /3717 variables (removed 243) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:23:37] [INFO ] Invariants computation overflowed in 9405 ms
[2022-05-16 06:23:37] [INFO ] Implicit Places using invariants in 9998 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:23:47] [INFO ] Invariants computation overflowed in 9653 ms
[2022-05-16 06:23:48] [INFO ] Implicit Places using invariants and state equation in 10598 ms returned []
Implicit Place search using SMT with State Equation took 20634 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:23:57] [INFO ] Invariants computation overflowed in 9523 ms
[2022-05-16 06:23:59] [INFO ] Dead Transitions using invariants and state equation in 11452 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3474/3717 places, 3222/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3474/3717 places, 3222/3222 transitions.
Support contains 153 out of 3474 places after structural reductions.
[2022-05-16 06:24:00] [INFO ] Flatten gal took : 446 ms
[2022-05-16 06:24:00] [INFO ] Flatten gal took : 287 ms
[2022-05-16 06:24:01] [INFO ] Input system was already deterministic with 3222 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 883 ms. (steps per millisecond=11 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:24:12] [INFO ] Invariants computation overflowed in 10165 ms
[2022-05-16 06:24:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-16 06:24:37] [INFO ] After 25035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 27 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3453 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.44 ms
Discarding 21 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 3453 transition count 3211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 3452 transition count 3210
Applied a total of 12 rules in 470 ms. Remains 3452 /3474 variables (removed 22) and now considering 3210/3222 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 3452/3474 places, 3210/3222 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3210 rows 3452 cols
[2022-05-16 06:24:48] [INFO ] Invariants computation overflowed in 9911 ms
[2022-05-16 06:25:13] [INFO ] After 25031ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 3452 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3452/3452 places, 3210/3210 transitions.
Applied a total of 0 rules in 164 ms. Remains 3452 /3452 variables (removed 0) and now considering 3210/3210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3452/3452 places, 3210/3210 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147403 steps, run timeout after 3005 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147403 steps, saw 110051 distinct states, run finished after 3006 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3210 rows 3452 cols
[2022-05-16 06:25:27] [INFO ] Invariants computation overflowed in 9870 ms
[2022-05-16 06:25:52] [INFO ] After 25033ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 3452 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 3452/3452 places, 3210/3210 transitions.
Applied a total of 0 rules in 159 ms. Remains 3452 /3452 variables (removed 0) and now considering 3210/3210 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3452/3452 places, 3210/3210 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 3452/3452 places, 3210/3210 transitions.
Applied a total of 0 rules in 140 ms. Remains 3452 /3452 variables (removed 0) and now considering 3210/3210 (removed 0) transitions.
// Phase 1: matrix 3210 rows 3452 cols
[2022-05-16 06:26:02] [INFO ] Invariants computation overflowed in 9621 ms
[2022-05-16 06:26:04] [INFO ] Implicit Places using invariants in 12083 ms returned []
// Phase 1: matrix 3210 rows 3452 cols
[2022-05-16 06:26:14] [INFO ] Invariants computation overflowed in 9547 ms
[2022-05-16 06:26:14] [INFO ] Implicit Places using invariants and state equation in 10281 ms returned []
Implicit Place search using SMT with State Equation took 22368 ms to find 0 implicit places.
[2022-05-16 06:26:15] [INFO ] Redundant transitions in 188 ms returned []
// Phase 1: matrix 3210 rows 3452 cols
[2022-05-16 06:26:24] [INFO ] Invariants computation overflowed in 9485 ms
[2022-05-16 06:26:26] [INFO ] Dead Transitions using invariants and state equation in 11255 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3452/3452 places, 3210/3210 transitions.
FORMULA Echo-PT-d05r03-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA Echo-PT-d05r03-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
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' '!(X((F(G((p1 U X(p2))))||p0)))'
Support contains 16 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 106 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:26:36] [INFO ] Invariants computation overflowed in 9365 ms
[2022-05-16 06:26:38] [INFO ] Implicit Places using invariants in 12030 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:26:48] [INFO ] Invariants computation overflowed in 9373 ms
[2022-05-16 06:26:48] [INFO ] Implicit Places using invariants and state equation in 10099 ms returned []
Implicit Place search using SMT with State Equation took 22138 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:26:58] [INFO ] Invariants computation overflowed in 9318 ms
[2022-05-16 06:27:00] [INFO ] Dead Transitions using invariants and state equation in 11268 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 344 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}, { cond=p1, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(OR (EQ s1009 0) (EQ s2858 0) (EQ s2859 0) (EQ s2860 0) (EQ s2861 0) (EQ s2863 0)), p1:(OR (AND (EQ s744 1) (EQ s2824 1)) (AND (EQ s1624 1) (EQ s3459 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2254 ms.
Product exploration explored 100000 steps with 50000 reset in 2220 ms.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
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 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p2))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 12 factoid took 202 ms. Reduced automaton from 5 states, 12 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d05r03-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-00 finished in 40296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||X(G(F((F(p1)&&p2))))))))'
Support contains 14 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.19 ms
Discarding 11 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 377 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:27:16] [INFO ] Invariants computation overflowed in 9126 ms
[2022-05-16 06:27:19] [INFO ] Implicit Places using invariants in 11705 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:27:28] [INFO ] Invariants computation overflowed in 9099 ms
[2022-05-16 06:27:28] [INFO ] Implicit Places using invariants and state equation in 9825 ms returned []
Implicit Place search using SMT with State Equation took 21532 ms to find 0 implicit places.
[2022-05-16 06:27:29] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:27:38] [INFO ] Invariants computation overflowed in 9181 ms
[2022-05-16 06:27:39] [INFO ] Dead Transitions using invariants and state equation in 10927 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 105 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2669 1) (EQ s3300 1)), p1:(OR (EQ s1253 0) (EQ s3103 0) (EQ s3104 0) (EQ s3106 0) (EQ s3107 0)), p2:(OR (EQ s426 0) (EQ s427 0) (EQ s428 0) (...], 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 226 reset in 3697 ms.
Product exploration explored 100000 steps with 225 reset in 4031 ms.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2))))), (F (G (NOT p0))), (F (G p1)), (F (G p2))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 12 factoid took 297 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d05r03-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-01 finished in 42844 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.12 ms
Discarding 11 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 182 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:28:00] [INFO ] Invariants computation overflowed in 10126 ms
[2022-05-16 06:28:02] [INFO ] Implicit Places using invariants in 12910 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:28:12] [INFO ] Invariants computation overflowed in 9190 ms
[2022-05-16 06:28:12] [INFO ] Implicit Places using invariants and state equation in 9915 ms returned []
Implicit Place search using SMT with State Equation took 22828 ms to find 0 implicit places.
[2022-05-16 06:28:12] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:28:22] [INFO ] Invariants computation overflowed in 9188 ms
[2022-05-16 06:28:23] [INFO ] Dead Transitions using invariants and state equation in 10976 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s1284 1) (EQ s3134 1) (EQ s3135 1) (EQ s3137 1) (EQ s3138 1) (EQ s3139 1) (EQ s3140 1) (EQ s3141 1)) (AND (EQ s2636 1) (EQ s3107 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 484 steps with 0 reset in 20 ms.
FORMULA Echo-PT-d05r03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-02 finished in 34196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 13 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.10 ms
Discarding 11 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 167 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:28:33] [INFO ] Invariants computation overflowed in 9190 ms
[2022-05-16 06:28:35] [INFO ] Implicit Places using invariants in 11772 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:28:45] [INFO ] Invariants computation overflowed in 9080 ms
[2022-05-16 06:28:45] [INFO ] Implicit Places using invariants and state equation in 9775 ms returned []
Implicit Place search using SMT with State Equation took 21554 ms to find 0 implicit places.
[2022-05-16 06:28:45] [INFO ] Redundant transitions in 83 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:28:54] [INFO ] Invariants computation overflowed in 9169 ms
[2022-05-16 06:28:56] [INFO ] Dead Transitions using invariants and state equation in 10969 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-03 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 s825 0) (EQ s827 0) (EQ s828 0) (EQ s829 0) (EQ s830 0) (EQ s831 0) (EQ s2537 0) (EQ s732 0) (EQ s733 0) (EQ s734 0) (EQ s735 0) (EQ s736 0) (E...], 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 206 reset in 3451 ms.
Product exploration explored 100000 steps with 206 reset in 3763 ms.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
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 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d05r03-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-03 finished in 41790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||F(p1)))'
Support contains 22 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 127 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:29:15] [INFO ] Invariants computation overflowed in 9325 ms
[2022-05-16 06:29:17] [INFO ] Implicit Places using invariants in 11960 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:29:27] [INFO ] Invariants computation overflowed in 9339 ms
[2022-05-16 06:29:27] [INFO ] Implicit Places using invariants and state equation in 10069 ms returned []
Implicit Place search using SMT with State Equation took 22032 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:29:37] [INFO ] Invariants computation overflowed in 9338 ms
[2022-05-16 06:29:39] [INFO ] Dead Transitions using invariants and state equation in 11129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (EQ s932 1) (EQ s2145 1) (EQ s2156 1) (EQ s2167 1) (EQ s2189 1) (EQ s2200 1)) (AND (EQ s326 1) (EQ s327 1) (EQ s328 1) (EQ s329 1) (EQ s331 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 2137 ms.
Product exploration explored 100000 steps with 50000 reset in 2201 ms.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
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), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d05r03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-05 finished in 39508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(X(p0))||p1)))'
Support contains 14 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 123 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:29:54] [INFO ] Invariants computation overflowed in 9436 ms
[2022-05-16 06:29:57] [INFO ] Implicit Places using invariants in 12064 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:30:06] [INFO ] Invariants computation overflowed in 9361 ms
[2022-05-16 06:30:07] [INFO ] Implicit Places using invariants and state equation in 10108 ms returned []
Implicit Place search using SMT with State Equation took 22179 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:30:16] [INFO ] Invariants computation overflowed in 9370 ms
[2022-05-16 06:30:18] [INFO ] Dead Transitions using invariants and state equation in 11144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s733 1) (EQ s734 1) (EQ s735 1) (EQ s736 1) (EQ s737 1) (EQ s2433 1)), p0:(AND (EQ s1609 1) (EQ s3442 1) (EQ s3443 1) (EQ s3444 1) (EQ s3445 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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-d05r03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-07 finished in 33576 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F(X(p0)))))'
Support contains 2 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 106 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:30:28] [INFO ] Invariants computation overflowed in 9379 ms
[2022-05-16 06:30:30] [INFO ] Implicit Places using invariants in 11988 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:30:40] [INFO ] Invariants computation overflowed in 9329 ms
[2022-05-16 06:30:41] [INFO ] Implicit Places using invariants and state equation in 10072 ms returned []
Implicit Place search using SMT with State Equation took 22064 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:30:50] [INFO ] Invariants computation overflowed in 9373 ms
[2022-05-16 06:30:52] [INFO ] Dead Transitions using invariants and state equation in 11144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s129 0) (EQ s2722 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]]
Product exploration explored 100000 steps with 33333 reset in 1729 ms.
Product exploration explored 100000 steps with 33333 reset in 1804 ms.
Computed a total of 3474 stabilizing places and 3222 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3474 transition count 3222
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 (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d05r03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-08 finished in 38714 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.11 ms
Discarding 11 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 153 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:31:06] [INFO ] Invariants computation overflowed in 9182 ms
[2022-05-16 06:31:09] [INFO ] Implicit Places using invariants in 11794 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:31:18] [INFO ] Invariants computation overflowed in 9180 ms
[2022-05-16 06:31:19] [INFO ] Implicit Places using invariants and state equation in 9926 ms returned []
Implicit Place search using SMT with State Equation took 21726 ms to find 0 implicit places.
[2022-05-16 06:31:19] [INFO ] Redundant transitions in 84 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:31:28] [INFO ] Invariants computation overflowed in 9187 ms
[2022-05-16 06:31:30] [INFO ] Dead Transitions using invariants and state equation in 10974 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2628 1) (EQ s3060 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 585 steps with 1 reset in 20 ms.
FORMULA Echo-PT-d05r03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-09 finished in 33014 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((X(p0)&&X((p1 U !p2))))&&p3))))'
Support contains 13 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 111 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:31:40] [INFO ] Invariants computation overflowed in 10170 ms
[2022-05-16 06:31:43] [INFO ] Implicit Places using invariants in 12920 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:31:52] [INFO ] Invariants computation overflowed in 9364 ms
[2022-05-16 06:31:53] [INFO ] Implicit Places using invariants and state equation in 10098 ms returned []
Implicit Place search using SMT with State Equation took 23021 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:32:03] [INFO ] Invariants computation overflowed in 9426 ms
[2022-05-16 06:32:05] [INFO ] Dead Transitions using invariants and state equation in 11331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p3) (NOT p0) p2), (OR (NOT p3) (NOT p0) p2), true, (OR (NOT p0) p2), p2]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p3, acceptance={} source=1 dest: 1}, { cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=p3, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p3:(OR (AND (EQ s895 1) (EQ s1760 1) (EQ s1782 1) (EQ s1793 1) (EQ s1804 1) (EQ s1815 1)) (AND (EQ s2603 1) (EQ s2847 1))), p0:(AND (EQ s2603 1) (EQ s2847...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Echo-PT-d05r03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-11 finished in 34722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(X(X(G((G(!(p0 U X(p0)))||X(p1)))))))))'
Support contains 12 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.14 ms
Discarding 11 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 154 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:32:14] [INFO ] Invariants computation overflowed in 9215 ms
[2022-05-16 06:32:17] [INFO ] Implicit Places using invariants in 11794 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:32:26] [INFO ] Invariants computation overflowed in 9221 ms
[2022-05-16 06:32:27] [INFO ] Implicit Places using invariants and state equation in 9951 ms returned []
Implicit Place search using SMT with State Equation took 21747 ms to find 0 implicit places.
[2022-05-16 06:32:27] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:32:36] [INFO ] Invariants computation overflowed in 9417 ms
[2022-05-16 06:32:38] [INFO ] Dead Transitions using invariants and state equation in 11212 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 36 ms :[(AND p0 (NOT p1))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s387 1) (EQ s388 1) (EQ s390 1) (EQ s391 1) (EQ s2056 1)), p1:(OR (EQ s1290 0) (EQ s3143 0) (EQ s3144 0) (EQ s3145 0) (EQ s3146 0) (EQ s3147 0...], nbAcceptance=2, 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 206 reset in 3508 ms.
Product exploration explored 100000 steps with 206 reset in 3844 ms.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 11 factoid took 253 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d05r03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-12 finished in 42464 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G(X(G(F(G(F(G(p0))))))))))'
Support contains 6 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Discarding 11 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 146 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:32:57] [INFO ] Invariants computation overflowed in 9169 ms
[2022-05-16 06:32:59] [INFO ] Implicit Places using invariants in 11639 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:33:08] [INFO ] Invariants computation overflowed in 9170 ms
[2022-05-16 06:33:09] [INFO ] Implicit Places using invariants and state equation in 9923 ms returned []
Implicit Place search using SMT with State Equation took 21564 ms to find 0 implicit places.
[2022-05-16 06:33:09] [INFO ] Redundant transitions in 85 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:33:18] [INFO ] Invariants computation overflowed in 9173 ms
[2022-05-16 06:33:20] [INFO ] Dead Transitions using invariants and state equation in 10968 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-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 s370 0) (EQ s371 0) (EQ s372 0) (EQ s374 0) (EQ s375 0) (EQ s2039 0))], 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 206 reset in 3453 ms.
Product exploration explored 100000 steps with 206 reset in 3819 ms.
Computed a total of 3462 stabilizing places and 3220 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3462 transition count 3220
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 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA Echo-PT-d05r03-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Echo-PT-d05r03-LTLFireability-13 finished in 41832 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((F(p0)||p1) U G(p2))&&X(G(X(p2)))))'
Support contains 15 out of 3474 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Applied a total of 0 rules in 111 ms. Remains 3474 /3474 variables (removed 0) and now considering 3222/3222 (removed 0) transitions.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:33:39] [INFO ] Invariants computation overflowed in 9407 ms
[2022-05-16 06:33:41] [INFO ] Implicit Places using invariants in 12017 ms returned []
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:33:51] [INFO ] Invariants computation overflowed in 9396 ms
[2022-05-16 06:33:51] [INFO ] Implicit Places using invariants and state equation in 10115 ms returned []
Implicit Place search using SMT with State Equation took 22135 ms to find 0 implicit places.
// Phase 1: matrix 3222 rows 3474 cols
[2022-05-16 06:34:01] [INFO ] Invariants computation overflowed in 9370 ms
[2022-05-16 06:34:03] [INFO ] Dead Transitions using invariants and state equation in 11162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 3474/3474 places, 3222/3222 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2), true, (NOT p2), (OR (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}, { cond=p0, acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(OR p2 p1 p0), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(OR p2 p0), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(OR p1 p0), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 3}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=4, aps=[p0:(AND (EQ s1198 1) (EQ s3050 1) (EQ s3052 1) (EQ s3053 1) (EQ s3054 1) (EQ s3055 1)), p2:(AND (EQ s1036 1) (EQ s2886 1) (EQ s2887 1) (EQ s2888 1) (EQ s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Echo-PT-d05r03-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-14 finished in 33762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 4 out of 3474 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3474/3474 places, 3222/3222 transitions.
Graph (complete) has 15811 edges and 3474 vertex of which 3463 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Discarding 11 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 156 ms. Remains 3462 /3474 variables (removed 12) and now considering 3220/3222 (removed 2) transitions.
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:34:12] [INFO ] Invariants computation overflowed in 9213 ms
[2022-05-16 06:34:15] [INFO ] Implicit Places using invariants in 11831 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:34:24] [INFO ] Invariants computation overflowed in 9195 ms
[2022-05-16 06:34:25] [INFO ] Implicit Places using invariants and state equation in 9932 ms returned []
Implicit Place search using SMT with State Equation took 21765 ms to find 0 implicit places.
[2022-05-16 06:34:25] [INFO ] Redundant transitions in 86 ms returned []
// Phase 1: matrix 3220 rows 3462 cols
[2022-05-16 06:34:34] [INFO ] Invariants computation overflowed in 9201 ms
[2022-05-16 06:34:36] [INFO ] Dead Transitions using invariants and state equation in 10991 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3462/3474 places, 3220/3222 transitions.
Finished structural reductions, in 1 iterations. Remains : 3462/3474 places, 3220/3222 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Echo-PT-d05r03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (EQ s311 1) (EQ s2740 1)), p0:(AND (EQ s2623 1) (EQ s3031 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 706 steps with 1 reset in 32 ms.
FORMULA Echo-PT-d05r03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Echo-PT-d05r03-LTLFireability-15 finished in 33115 ms.
All properties solved by simple procedures.
Total runtime 669681 ms.
BK_STOP 1652682876879
--------------------
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-d05r03"
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-d05r03, 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-165260110300436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Echo-PT-d05r03.tgz
mv Echo-PT-d05r03 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;