About the Execution of GreatSPN+red for ViralEpidemic-PT-S04D1C1A06
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8597.604 | 3600000.00 | 3884314.00 | 11453.90 | FTFFTFTFT?FFF??? | normal |
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.r443-smll-171701110400371.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 greatspnxred
Input is ViralEpidemic-PT-S04D1C1A06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701110400371
=====================================================================
--------------------
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-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717128487058
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S04D1C1A06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-31 04:08:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 04:08:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 04:08:12] [INFO ] Load time of PNML (sax parser for PT used): 2562 ms
[2024-05-31 04:08:12] [INFO ] Transformed 32767 places.
[2024-05-31 04:08:12] [INFO ] Transformed 49149 transitions.
[2024-05-31 04:08:12] [INFO ] Found NUPN structural information;
[2024-05-31 04:08:12] [INFO ] Parsed PT model containing 32767 places and 49149 transitions and 114681 arcs in 3078 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 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 2914 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:08:42] [INFO ] Invariants computation overflowed in 26684 ms
[2024-05-31 04:09:21] [INFO ] Performed 7518/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 04:09:51] [INFO ] Performed 16990/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 04:10:21] [INFO ] Performed 26638/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 04:10:39] [INFO ] Implicit Places using invariants in 143807 ms returned []
Implicit Place search using SMT only with invariants took 143861 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:11:06] [INFO ] Invariants computation overflowed in 25775 ms
SMT process timed out in 276721ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 277434ms
Finished structural reductions in LTL mode , in 1 iterations and 424432 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Support contains 30 out of 32767 places after structural reductions.
[2024-05-31 04:15:20] [INFO ] Flatten gal took : 2105 ms
[2024-05-31 04:15:22] [INFO ] Flatten gal took : 1633 ms
[2024-05-31 04:15:24] [INFO ] Input system was already deterministic with 49149 transitions.
RANDOM walk for 40000 steps (61 resets) in 15718 ms. (2 steps per ms) remains 5/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12079 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9962 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 12273 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 9994 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 10406 ms. (3 steps per ms) remains 5/5 properties
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:16:07] [INFO ] Invariants computation overflowed in 23808 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 36/46 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 135/181 variables, 54/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 54/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 153/334 variables, 54/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/334 variables, 54/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 373/707 variables, 125/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/707 variables, 125/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/707 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 738/1445 variables, 248/734 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1445 variables, 248/982 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1445 variables, 0/982 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1332/2777 variables, 455/1437 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2777 variables, 455/1892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2777 variables, 0/1892 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 2397/5174 variables, 825/2717 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/5174 variables, 825/3542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5174 variables, 0/3542 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9324/81916 variables, and 4962 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5010 ms.
Refiners :[Domain max(s): 1771/32767 constraints, State Equation: 3191/32767 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 36/46 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 135/181 variables, 54/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 54/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 153/334 variables, 54/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/334 variables, 54/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/334 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 373/707 variables, 125/366 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/707 variables, 125/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/707 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 738/1445 variables, 248/739 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1445 variables, 248/987 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1445 variables, 0/987 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 1332/2777 variables, 455/1442 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2777 variables, 455/1897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2777 variables, 0/1897 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 2397/5174 variables, 825/2722 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/5174 variables, 825/3547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/5174 variables, 0/3547 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 34126ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 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 90 are kept as prefixes of interest. Removing 32677 places using SCC suffix rule.49 ms
Discarding 32677 places :
Also discarding 48920 output transitions
Drop transitions (Output transitions of discarded places.) removed 48920 transitions
Drop transitions (Empty/Sink Transition effects.) removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 177 rules applied. Total rules applied 178 place count 90 transition count 52
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 207 place count 61 transition count 52
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 207 place count 61 transition count 47
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 217 place count 56 transition count 47
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 237 place count 36 transition count 27
Iterating global reduction 2 with 20 rules applied. Total rules applied 257 place count 36 transition count 27
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 277 place count 26 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 278 place count 25 transition count 16
Ensure Unique test removed 5 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 283 place count 20 transition count 16
Applied a total of 283 rules in 214 ms. Remains 20 /32767 variables (removed 32747) and now considering 16/49149 (removed 49133) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 214 ms. Remains : 20/32767 places, 16/49149 transitions.
RANDOM walk for 180 steps (9 resets) in 12 ms. (13 steps per ms) remains 0/5 properties
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' '!(X(F(p0)))'
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 5697 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:16:55] [INFO ] Invariants computation overflowed in 30999 ms
[2024-05-31 04:17:33] [INFO ] Performed 5777/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 04:18:03] [INFO ] Performed 12293/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 04:18:33] [INFO ] Performed 18974/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 04:19:03] [INFO ] Performed 25992/32767 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2024-05-31 04:19:03] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2024-05-31 04:19:03] [INFO ] Implicit Places using invariants in 158759 ms returned []
Implicit Place search using SMT only with invariants took 158762 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:19:30] [INFO ] Invariants computation overflowed in 26643 ms
SMT process timed out in 284472ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 285084ms
Finished structural reductions in LTL mode , in 1 iterations and 449650 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01
Product exploration timeout after 27070 steps with 13535 reset in 10001 ms.
Product exploration timeout after 24100 steps with 12050 reset in 10004 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 : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 28 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-01 finished in 757682 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(F(p0)))'
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 5639 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:29:21] [INFO ] Invariants computation overflowed in 19691 ms
[2024-05-31 04:29:59] [INFO ] Performed 6397/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 04:30:29] [INFO ] Performed 16933/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 04:30:59] [INFO ] Performed 26431/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 04:31:20] [INFO ] Implicit Places using invariants in 138315 ms returned []
Implicit Place search using SMT only with invariants took 138320 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:31:41] [INFO ] Invariants computation overflowed in 19861 ms
SMT process timed out in 285875ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 286436ms
Finished structural reductions in LTL mode , in 1 iterations and 430477 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02
Stuttering criterion allowed to conclude after 535 steps with 0 reset in 126 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-02 finished in 430850 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(F((X(X(G(p1)))&&p0))))))'
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 5483 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:36:26] [INFO ] Invariants computation overflowed in 13670 ms
[2024-05-31 04:37:03] [INFO ] Performed 6690/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 04:37:33] [INFO ] Performed 15726/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 04:38:03] [INFO ] Performed 25696/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 04:38:26] [INFO ] Implicit Places using invariants in 133266 ms returned []
Implicit Place search using SMT only with invariants took 133270 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:38:47] [INFO ] Invariants computation overflowed in 20267 ms
SMT process timed out in 290713ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 291697ms
Finished structural reductions in LTL mode , in 1 iterations and 430573 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03
Stuttering criterion allowed to conclude after 475 steps with 0 reset in 110 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-03 finished in 431167 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(p0)||G(p1))))'
Support contains 2 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 60 are kept as prefixes of interest. Removing 32707 places using SCC suffix rule.65 ms
Discarding 32707 places :
Also discarding 49025 output transitions
Drop transitions (Output transitions of discarded places.) removed 49025 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 59 transition count 113
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 32 place count 38 transition count 56
Iterating global reduction 1 with 21 rules applied. Total rules applied 53 place count 38 transition count 56
Graph (complete) has 23 edges and 38 vertex of which 37 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 54 place count 37 transition count 55
Applied a total of 54 rules in 139 ms. Remains 37 /32767 variables (removed 32730) and now considering 55/49149 (removed 49094) transitions.
// Phase 1: matrix 55 rows 37 cols
[2024-05-31 04:43:18] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 04:43:18] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-31 04:43:18] [INFO ] Invariant cache hit.
[2024-05-31 04:43:18] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-31 04:43:18] [INFO ] Redundant transitions in 35 ms returned [12, 19, 22, 24, 27, 30, 34, 38, 42]
Found 9 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 9 transitions
Redundant transitions reduction (with SMT) removed 9 transitions.
Running 34 sub problems to find dead transitions.
// Phase 1: matrix 46 rows 37 cols
[2024-05-31 04:43:18] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 43/77 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (OVERLAPS) 2/79 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 2/81 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/83 variables, and 36 constraints, problems are : Problem set: 0 solved, 34 unsolved in 535 ms.
Refiners :[State Equation: 36/37 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (OVERLAPS) 43/77 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (OVERLAPS) 2/79 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 2/81 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/83 variables, and 70 constraints, problems are : Problem set: 0 solved, 34 unsolved in 534 ms.
Refiners :[State Equation: 36/37 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints]
After SMT, in 1076ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 1077ms
Starting structural reductions in SI_LTL mode, iteration 1 : 37/32767 places, 46/49149 transitions.
Graph (complete) has 22 edges and 37 vertex of which 28 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Applied a total of 1 rules in 3 ms. Remains 28 /37 variables (removed 9) and now considering 37/46 (removed 9) transitions.
// Phase 1: matrix 37 rows 28 cols
[2024-05-31 04:43:19] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 04:43:19] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 04:43:19] [INFO ] Invariant cache hit.
[2024-05-31 04:43:19] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 28/32767 places, 37/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1434 ms. Remains : 28/32767 places, 37/49149 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04
Product exploration explored 100000 steps with 4201 reset in 254 ms.
Product exploration explored 100000 steps with 4219 reset in 330 ms.
Computed a total of 28 stabilizing places and 37 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 37
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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 404 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40001 steps (1096 resets) in 401 ms. (99 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40004 steps (224 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (226 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
[2024-05-31 04:43:21] [INFO ] Invariant cache hit.
Problem apf0 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/14 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/23 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 12/35 variables, 5/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 10/45 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/55 variables, 4/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/55 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/63 variables, 4/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/63 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/65 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/65 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/65 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 28 constraints, problems are : Problem set: 1 solved, 1 unsolved in 63 ms.
Refiners :[State Equation: 28/28 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/14 variables, 4/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/23 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 12/35 variables, 5/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/45 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/55 variables, 4/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Int declared 63/65 variables, and 28 constraints, problems are : Problem set: 2 solved, 0 unsolved in 51 ms.
Refiners :[State Equation: 27/28 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 119ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p0 p1)), (G (OR (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 252 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-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-04 finished in 3229 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))))'
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 2462 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:43:43] [INFO ] Invariants computation overflowed in 19375 ms
[2024-05-31 04:44:20] [INFO ] Performed 7024/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 04:44:50] [INFO ] Performed 16478/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 04:45:20] [INFO ] Performed 25429/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 04:45:45] [INFO ] Implicit Places using invariants in 141473 ms returned []
Implicit Place search using SMT only with invariants took 141475 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:46:01] [INFO ] Invariants computation overflowed in 14951 ms
SMT process timed out in 279723ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 280484ms
Finished structural reductions in LTL mode , in 1 iterations and 424514 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06
Product exploration timeout after 27030 steps with 13515 reset in 10004 ms.
Product exploration timeout after 24600 steps with 12300 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 p1 p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 18 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-06 finished in 706683 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(G((p0||F(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 2005 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:55:26] [INFO ] Invariants computation overflowed in 15986 ms
[2024-05-31 04:56:03] [INFO ] Performed 10552/32767 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-31 04:56:33] [INFO ] Performed 21352/32767 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-31 04:57:03] [INFO ] Performed 31354/32767 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2024-05-31 04:57:08] [INFO ] Implicit Places using invariants in 117632 ms returned []
Implicit Place search using SMT only with invariants took 117633 ms to find 0 implicit places.
Running 49148 sub problems to find dead transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 04:57:26] [INFO ] Invariants computation overflowed in 17811 ms
SMT process timed out in 287342ms, After SMT, problems are : Problem set: 0 solved, 49148 unsolved
Search for dead transitions found 0 dead transitions in 288248ms
Finished structural reductions in LTL mode , in 1 iterations and 407964 ms. Remains : 32767/32767 places, 49149/49149 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07
Product exploration timeout after 42740 steps with 65 reset in 10003 ms.
Product exploration timeout after 33490 steps with 57 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 (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 206 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 40000 steps (61 resets) in 12201 ms. (3 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8301 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 8458 ms. (4 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 7987 ms. (5 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 54456 steps, run timeout after 27002 ms. (steps per millisecond=2 ) properties seen :0 out of 3
Probabilistic random walk after 54456 steps, saw 53098 distinct states, run finished after 27009 ms. (steps per millisecond=2 ) properties seen :0
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 05:07:25] [INFO ] Invariants computation overflowed in 19356 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 14/18 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 48/66 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 46/112 variables, 16/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/112 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 139/251 variables, 47/127 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/251 variables, 47/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/251 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 218/469 variables, 74/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/469 variables, 74/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/469 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 460/929 variables, 156/478 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/929 variables, 156/634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/929 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 783/1712 variables, 256/890 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1712 variables, 256/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1712 variables, 0/1146 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 1986/3698 variables, 664/1810 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3698 variables, 664/2474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/3698 variables, 0/2474 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 3034/6732 variables, 1018/3492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/6732 variables, 1018/4510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/6732 variables, 0/4510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 24473ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 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 37 are kept as prefixes of interest. Removing 32730 places using SCC suffix rule.13 ms
Discarding 32730 places :
Also discarding 49056 output transitions
Drop transitions (Output transitions of discarded places.) removed 49056 transitions
Drop transitions (Empty/Sink Transition effects.) removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 37 transition count 20
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 87 place count 24 transition count 20
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 87 place count 24 transition count 18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 91 place count 22 transition count 18
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 99 place count 14 transition count 10
Iterating global reduction 2 with 8 rules applied. Total rules applied 107 place count 14 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 113 place count 11 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 10 transition count 6
Ensure Unique test removed 2 places
Iterating post reduction 2 with 2 rules applied. Total rules applied 116 place count 8 transition count 6
Applied a total of 116 rules in 83 ms. Remains 8 /32767 variables (removed 32759) and now considering 6/49149 (removed 49143) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 8/32767 places, 6/49149 transitions.
RANDOM walk for 34 steps (2 resets) in 5 ms. (5 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 9 factoid took 537 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 4 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 98 are kept as prefixes of interest. Removing 32669 places using SCC suffix rule.28 ms
Discarding 32669 places :
Also discarding 48941 output transitions
Drop transitions (Output transitions of discarded places.) removed 48941 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 97 transition count 175
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 70 place count 60 transition count 83
Iterating global reduction 1 with 37 rules applied. Total rules applied 107 place count 60 transition count 83
Graph (complete) has 33 edges and 60 vertex of which 58 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 58 transition count 81
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 109 place count 58 transition count 80
Applied a total of 109 rules in 88 ms. Remains 58 /32767 variables (removed 32709) and now considering 80/49149 (removed 49069) transitions.
// Phase 1: matrix 80 rows 58 cols
[2024-05-31 05:07:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 05:07:31] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-31 05:07:31] [INFO ] Invariant cache hit.
[2024-05-31 05:07:31] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-31 05:07:31] [INFO ] Redundant transitions in 30 ms returned [11, 21, 25, 44, 53, 64]
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 52 sub problems to find dead transitions.
// Phase 1: matrix 74 rows 58 cols
[2024-05-31 05:07:31] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 69/122 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 6/128 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 2/130 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (OVERLAPS) 2/132 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 58 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1468 ms.
Refiners :[State Equation: 58/58 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 69/122 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 52/105 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/122 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (OVERLAPS) 6/128 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 2/130 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 2/132 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 110 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1432 ms.
Refiners :[State Equation: 58/58 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
After SMT, in 2916ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 2917ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/32767 places, 74/49149 transitions.
Graph (complete) has 31 edges and 58 vertex of which 52 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 2 ms. Remains 52 /58 variables (removed 6) and now considering 68/74 (removed 6) transitions.
// Phase 1: matrix 68 rows 52 cols
[2024-05-31 05:07:34] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 05:07:34] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-31 05:07:34] [INFO ] Invariant cache hit.
[2024-05-31 05:07:34] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 52/32767 places, 68/49149 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3310 ms. Remains : 52/32767 places, 68/49149 transitions.
Computed a total of 52 stabilizing places and 68 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 52 transition count 68
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 p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 3408 steps (53 resets) in 34 ms. (97 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 5 factoid took 323 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering criterion allowed to conclude after 7126 steps with 166 reset in 12 ms.
FORMULA ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A06-LTLCardinality-07 finished in 747344 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||X(p2)))))))'
Support contains 5 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 2148 ms. Remains 32767 /32767 variables (removed 0) and now considering 49149/49149 (removed 0) transitions.
// Phase 1: matrix 49149 rows 32767 cols
[2024-05-31 05:07:55] [INFO ] Invariants computation overflowed in 17534 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 LTLCardinality -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="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ViralEpidemic-PT-S04D1C1A06, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r443-smll-171701110400371"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;