Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r544-smll-171701111400372.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ViralEpidemic-PT-S04D1C1A06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111400372
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 07:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 12 07:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 06:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 12 06:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 20M May 18 16:43 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 ViralEpidemic-PT-S04D1C1A06-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717303757060

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S04D1C1A06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 04:49:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 04:49:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 04:49:21] [INFO ] Load time of PNML (sax parser for PT used): 2173 ms
[2024-06-02 04:49:21] [INFO ] Transformed 32767 places.
[2024-06-02 04:49:21] [INFO ] Transformed 49149 transitions.
[2024-06-02 04:49:21] [INFO ] Found NUPN structural information;
[2024-06-02 04:49:21] [INFO ] Parsed PT model containing 32767 places and 49149 transitions and 114681 arcs in 2689 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 3029 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 04:49:46] [INFO ] Invariants computation overflowed in 20870 ms
[2024-06-02 04:50:24] [INFO ] Performed 8938/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 04:50:54] [INFO ] Performed 19050/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-02 04:51:24] [INFO ] Performed 29043/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-02 04:51:34] [INFO ] Implicit Places using invariants in 128922 ms returned []
Implicit Place search using SMT only with invariants took 129107 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 04:51:51] [INFO ] Invariants computation overflowed in 15595 ms
SMT process timed out in 276492ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 277294ms
Finished structural reductions in LTL mode , in 1 iterations and 409656 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Support contains 72 out of 32767 places after structural reductions.
[2024-06-02 04:56:15] [INFO ] Flatten gal took : 2367 ms
[2024-06-02 04:56:16] [INFO ] Flatten gal took : 1634 ms
[2024-06-02 04:56:20] [INFO ] Input system was already deterministic with 49149 transitions.
Reduction of identical properties reduced properties to check from 41 to 39
RANDOM walk for 40000 steps (61 resets) in 17716 ms. (2 steps per ms) remains 10/39 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10802 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13007 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9874 ms. (4 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10848 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10230 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10251 ms. (3 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13795 ms. (2 steps per ms) remains 7/9 properties
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 04:57:04] [INFO ] Invariants computation overflowed in 17211 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 62/81 variables, 19/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 197/278 variables, 71/109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 71/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 500/778 variables, 161/341 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/778 variables, 161/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/778 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1178/1956 variables, 371/873 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1956 variables, 371/1244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1956 variables, 0/1244 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 2858/4814 variables, 924/2168 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/4814 variables, 924/3092 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/4814 variables, 0/3092 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SMT process timed out in 22516ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 19 out of 32767 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 96 are kept as prefixes of interest. Removing 32671 places using SCC suffix rule.55 ms
Discarding 32671 places :
Also discarding 48937 output transitions
Drop transitions (Output transitions of discarded places.) removed 48937 transitions
Drop transitions (Empty/Sink Transition effects.) removed 121 transitions
Reduce isomorphic transitions removed 121 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 96 transition count 76
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 153 place count 81 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 80 transition count 75
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 154 place count 80 transition count 67
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 170 place count 72 transition count 67
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 189 place count 53 transition count 48
Iterating global reduction 3 with 19 rules applied. Total rules applied 208 place count 53 transition count 48
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 216 place count 49 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 217 place count 48 transition count 43
Applied a total of 217 rules in 218 ms. Remains 48 /32767 variables (removed 32719) and now considering 43/49149 (removed 49106) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 48/32767 places, 43/49149 transitions.
RANDOM walk for 2525 steps (96 resets) in 50 ms. (49 steps per ms) remains 0/7 properties
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 6 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 72 are kept as prefixes of interest. Removing 32695 places using SCC suffix rule.46 ms
Discarding 32695 places :
Also discarding 48997 output transitions
Drop transitions (Output transitions of discarded places.) removed 48997 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 71 transition count 139
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 37 place count 47 transition count 71
Iterating global reduction 1 with 24 rules applied. Total rules applied 61 place count 47 transition count 71
Graph (complete) has 26 edges and 47 vertex of which 46 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 46 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 46 transition count 69
Applied a total of 63 rules in 155 ms. Remains 46 /32767 variables (removed 32721) and now considering 69/49149 (removed 49080) transitions.
// Phase 1: matrix 69 rows 46 cols
[2024-06-02 04:57:11] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 04:57:11] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-02 04:57:11] [INFO ] Invariant cache hit.
[2024-06-02 04:57:11] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-06-02 04:57:11] [INFO ] Redundant transitions in 31 ms returned [17, 21, 46, 49, 57, 67]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 48 sub problems to find dead transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-06-02 04:57:11] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 58/99 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 6/105 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (OVERLAPS) 2/107 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/107 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 2/109 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 46 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1280 ms.
Refiners :[State Equation: 46/46 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 58/99 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 48/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 6/105 variables, 3/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 2/107 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/107 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (OVERLAPS) 2/109 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/109 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 10 (OVERLAPS) 0/109 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 94 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1282 ms.
Refiners :[State Equation: 46/46 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 2586ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2587ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/32767 places, 63/49149 transitions.
Graph (complete) has 25 edges and 46 vertex of which 40 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Applied a total of 1 rules in 3 ms. Remains 40 /46 variables (removed 6) and now considering 57/63 (removed 6) transitions.
// Phase 1: matrix 57 rows 40 cols
[2024-06-02 04:57:13] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 04:57:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 04:57:13] [INFO ] Invariant cache hit.
[2024-06-02 04:57:13] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/32767 places, 57/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3001 ms. Remains : 40/32767 places, 57/49149 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-00
Product exploration explored 100000 steps with 3754 reset in 591 ms.
Product exploration explored 100000 steps with 3780 reset in 379 ms.
Computed a total of 40 stabilizing places and 57 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 57
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)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 26 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-00 finished in 4412 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 6 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 83 are kept as prefixes of interest. Removing 32684 places using SCC suffix rule.36 ms
Discarding 32684 places :
Also discarding 48974 output transitions
Drop transitions (Output transitions of discarded places.) removed 48974 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 82 transition count 162
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 43 place count 52 transition count 78
Iterating global reduction 1 with 30 rules applied. Total rules applied 73 place count 52 transition count 78
Graph (complete) has 29 edges and 52 vertex of which 51 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 74 place count 51 transition count 77
Applied a total of 74 rules in 100 ms. Remains 51 /32767 variables (removed 32716) and now considering 77/49149 (removed 49072) transitions.
// Phase 1: matrix 77 rows 51 cols
[2024-06-02 04:57:15] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 04:57:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 04:57:15] [INFO ] Invariant cache hit.
[2024-06-02 04:57:15] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-06-02 04:57:15] [INFO ] Redundant transitions in 24 ms returned [12, 16, 29, 36, 58, 65, 73]
Found 7 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 7 transitions
Redundant transitions reduction (with SMT) removed 7 transitions.
Running 53 sub problems to find dead transitions.
// Phase 1: matrix 70 rows 51 cols
[2024-06-02 04:57:15] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 65/111 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 6/117 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 2/119 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 2/121 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (OVERLAPS) 0/121 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 51 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1381 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 65/111 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 53/99 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (OVERLAPS) 6/117 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 2/119 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 2/121 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 104 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1502 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 0/0 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2897ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/32767 places, 70/49149 transitions.
Graph (complete) has 28 edges and 51 vertex of which 44 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Applied a total of 1 rules in 3 ms. Remains 44 /51 variables (removed 7) and now considering 63/70 (removed 7) transitions.
// Phase 1: matrix 63 rows 44 cols
[2024-06-02 04:57:18] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 04:57:18] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 04:57:18] [INFO ] Invariant cache hit.
[2024-06-02 04:57:18] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/32767 places, 63/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3232 ms. Remains : 44/32767 places, 63/49149 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-01
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-01 finished in 3381 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||(p2 U p3)))))))'
Support contains 5 out of 32767 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Graph (complete) has 21844 edges and 32767 vertex of which 86 are kept as prefixes of interest. Removing 32681 places using SCC suffix rule.26 ms
Discarding 32681 places :
Also discarding 48965 output transitions
Drop transitions (Output transitions of discarded places.) removed 48965 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 85 transition count 169
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 45 place count 55 transition count 84
Iterating global reduction 1 with 30 rules applied. Total rules applied 75 place count 55 transition count 84
Graph (complete) has 32 edges and 55 vertex of which 54 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 76 place count 54 transition count 83
Applied a total of 76 rules in 81 ms. Remains 54 /32767 variables (removed 32713) and now considering 83/49149 (removed 49066) transitions.
// Phase 1: matrix 83 rows 54 cols
[2024-06-02 04:57:18] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 04:57:18] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-02 04:57:18] [INFO ] Invariant cache hit.
[2024-06-02 04:57:18] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-06-02 04:57:18] [INFO ] Redundant transitions in 29 ms returned [8, 13, 17, 35, 48, 56, 59, 62, 65, 79]
Found 10 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 10 transitions
Redundant transitions reduction (with SMT) removed 10 transitions.
Running 54 sub problems to find dead transitions.
// Phase 1: matrix 73 rows 54 cols
[2024-06-02 04:57:18] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 68/117 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 6/123 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 2/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 2/127 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 54 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1566 ms.
Refiners :[State Equation: 54/54 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 68/117 variables, 49/49 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 6/123 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 2/125 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 2/127 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 108 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1543 ms.
Refiners :[State Equation: 54/54 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 3118ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 3119ms
Starting structural reductions in SI_LTL mode, iteration 1 : 54/32767 places, 73/49149 transitions.
Graph (complete) has 31 edges and 54 vertex of which 44 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Applied a total of 1 rules in 4 ms. Remains 44 /54 variables (removed 10) and now considering 63/73 (removed 10) transitions.
// Phase 1: matrix 63 rows 44 cols
[2024-06-02 04:57:21] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 04:57:21] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 04:57:21] [INFO ] Invariant cache hit.
[2024-06-02 04:57:22] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/32767 places, 63/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3424 ms. Remains : 44/32767 places, 63/49149 transitions.
Stuttering acceptance computed with spot in 338 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-02
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-02 finished in 3810 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0&&F(G(p1))))))))'
Support contains 3 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2869 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 04:57:43] [INFO ] Invariants computation overflowed in 18266 ms
[2024-06-02 04:58:20] [INFO ] Performed 7803/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 04:58:50] [INFO ] Performed 17255/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-02 04:59:20] [INFO ] Performed 28251/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-02 04:59:35] [INFO ] Implicit Places using invariants in 130382 ms returned []
Implicit Place search using SMT only with invariants took 130384 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 04:59:53] [INFO ] Invariants computation overflowed in 16829 ms
SMT process timed out in 291438ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 292227ms
Finished structural reductions in LTL mode , in 1 iterations and 425643 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 15 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-04 finished in 426059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(G(p1))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2884 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:04:49] [INFO ] Invariants computation overflowed in 17674 ms
[2024-06-02 05:05:26] [INFO ] Performed 10068/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 05:05:56] [INFO ] Performed 21520/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-02 05:06:26] [INFO ] Performed 32082/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-02 05:06:28] [INFO ] Implicit Places using invariants in 116870 ms returned []
Implicit Place search using SMT only with invariants took 116871 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:06:48] [INFO ] Invariants computation overflowed in 19204 ms
SMT process timed out in 293916ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 294598ms
Finished structural reductions in LTL mode , in 1 iterations and 414427 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 8 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-05 finished in 414666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p0||(F(p1)&&F(p0))))&&(!p2 U (p3||G(!p2))))))'
Support contains 7 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 3927 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:11:43] [INFO ] Invariants computation overflowed in 16462 ms
[2024-06-02 05:12:20] [INFO ] Performed 8493/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 05:12:50] [INFO ] Performed 18186/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-02 05:13:20] [INFO ] Performed 27492/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-02 05:13:35] [INFO ] Implicit Places using invariants in 128580 ms returned []
Implicit Place search using SMT only with invariants took 128582 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:13:53] [INFO ] Invariants computation overflowed in 17381 ms
SMT process timed out in 304356ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 305058ms
Finished structural reductions in LTL mode , in 1 iterations and 437630 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p0) (AND p2 (NOT p3))), (OR (NOT p0) (AND p2 (NOT p3))), true, (NOT p0), (AND (NOT p3) p2), (NOT p1), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-08
Product exploration timeout after 27870 steps with 9290 reset in 10002 ms.
Product exploration timeout after 24820 steps with 8273 reset in 10001 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
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 p3 (NOT p2) p0 p1), (X (NOT p2)), (X p3), (X (NOT (AND (NOT p3) p2))), (X (OR p3 (NOT p2))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X p0)), (X (X p1)), (F (G p3)), (F (G (NOT p2))), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 25 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-08 finished in 735019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(X(!p1)))||G(!p1)))))'
Support contains 4 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2588 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:23:57] [INFO ] Invariants computation overflowed in 16398 ms
[2024-06-02 05:24:34] [INFO ] Performed 8593/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 05:25:04] [INFO ] Performed 19545/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-02 05:25:34] [INFO ] Performed 29926/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-02 05:25:41] [INFO ] Implicit Places using invariants in 120455 ms returned []
Implicit Place search using SMT only with invariants took 120456 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:26:03] [INFO ] Invariants computation overflowed in 21616 ms
SMT process timed out in 283003ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 283801ms
Finished structural reductions in LTL mode , in 1 iterations and 406903 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 219 ms :[p1, p1, p1, p1, p1]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-09
Product exploration timeout after 36810 steps with 57 reset in 10001 ms.
Product exploration timeout after 29170 steps with 46 reset in 10003 ms.
Computed a total of 32767 stabilizing places and 49149 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 32767 transition count 49149
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 29 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-09 finished in 680598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 6 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2496 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:35:16] [INFO ] Invariants computation overflowed in 15553 ms
[2024-06-02 05:35:53] [INFO ] Performed 9853/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 05:36:23] [INFO ] Performed 21312/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-02 05:36:53] [INFO ] Performed 31377/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-02 05:36:56] [INFO ] Implicit Places using invariants in 114925 ms returned []
Implicit Place search using SMT only with invariants took 114930 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:37:13] [INFO ] Invariants computation overflowed in 16596 ms
SMT process timed out in 279015ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 279685ms
Finished structural reductions in LTL mode , in 1 iterations and 397170 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 133 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-10
Entered a terminal (fully accepting) state of product in 31831 steps with 50 reset in 8597 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-10 finished in 405993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||(p1 U (p2||G(p1))))))'
Support contains 6 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2575 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:42:04] [INFO ] Invariants computation overflowed in 16944 ms
[2024-06-02 05:42:41] [INFO ] Performed 8771/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-06-02 05:43:11] [INFO ] Performed 19334/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-06-02 05:43:41] [INFO ] Performed 30359/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-06-02 05:43:48] [INFO ] Implicit Places using invariants in 120731 ms returned []
Implicit Place search using SMT only with invariants took 120736 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:44:05] [INFO ] Invariants computation overflowed in 16704 ms
SMT process timed out in 292370ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 293055ms
Finished structural reductions in LTL mode , in 1 iterations and 416426 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLFireability-11
Entered a terminal (fully accepting) state of product in 4188 steps with 6 reset in 1181 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLFireability-11 finished in 417905 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 2 out of 32767 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32767/32767 places, 49149/49149 transitions.
Applied a total of 0 rules in 2554 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-06-02 05:49:02] [INFO ] Invariants computation overflowed in 17495 ms

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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="ViralEpidemic-PT-S04D1C1A06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ViralEpidemic-PT-S04D1C1A06, 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 r544-smll-171701111400372"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S04D1C1A06.tgz
mv ViralEpidemic-PT-S04D1C1A06 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 ;