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-171701110500396.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-S16D2C4A01, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r443-smll-171701110500396
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 672K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.7K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 08:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 08:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 04:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 12 04:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Apr 12 04:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:05 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 187K 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-S16D2C4A01-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S16D2C4A01-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717140748481

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S16D2C4A01
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-31 07:32:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 07:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 07:32:31] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2024-05-31 07:32:31] [INFO ] Transformed 307 places.
[2024-05-31 07:32:31] [INFO ] Transformed 561 transitions.
[2024-05-31 07:32:31] [INFO ] Parsed PT model containing 307 places and 561 transitions and 1377 arcs in 668 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 55 out of 307 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 307/307 places, 561/561 transitions.
Discarding 213 places :
Symmetric choice reduction at 0 with 213 rule applications. Total rules 213 place count 94 transition count 138
Iterating global reduction 0 with 213 rules applied. Total rules applied 426 place count 94 transition count 138
Applied a total of 426 rules in 64 ms. Remains 94 /307 variables (removed 213) and now considering 138/561 (removed 423) transitions.
// Phase 1: matrix 138 rows 94 cols
[2024-05-31 07:32:32] [INFO ] Computed 1 invariants in 27 ms
[2024-05-31 07:32:32] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-05-31 07:32:32] [INFO ] Invariant cache hit.
[2024-05-31 07:32:32] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Running 137 sub problems to find dead transitions.
[2024-05-31 07:32:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 138/232 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (OVERLAPS) 0/232 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Real declared 232/232 variables, and 95 constraints, problems are : Problem set: 0 solved, 137 unsolved in 3690 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 137 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 3 (OVERLAPS) 138/232 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/232 variables, 137/232 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/232 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 137 unsolved
At refinement iteration 6 (OVERLAPS) 0/232 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 137 unsolved
No progress, stopping.
After SMT solving in domain Int declared 232/232 variables, and 232 constraints, problems are : Problem set: 0 solved, 137 unsolved in 4786 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 137/137 constraints, Known Traps: 0/0 constraints]
After SMT, in 8659ms problems are : Problem set: 0 solved, 137 unsolved
Search for dead transitions found 0 dead transitions in 8704ms
Starting structural reductions in LTL mode, iteration 1 : 94/307 places, 138/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9382 ms. Remains : 94/307 places, 138/561 transitions.
Support contains 55 out of 94 places after structural reductions.
[2024-05-31 07:32:41] [INFO ] Flatten gal took : 72 ms
[2024-05-31 07:32:41] [INFO ] Flatten gal took : 32 ms
[2024-05-31 07:32:41] [INFO ] Input system was already deterministic with 138 transitions.
Reduction of identical properties reduced properties to check from 31 to 30
RANDOM walk for 874 steps (8 resets) in 181 ms. (4 steps per ms) remains 0/30 properties
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 94 stabilizing places and 138 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 138
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' '!(G(F((G(F(p1))||p0))))'
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Graph (complete) has 62 edges and 94 vertex of which 13 are kept as prefixes of interest. Removing 81 places using SCC suffix rule.2 ms
Discarding 81 places :
Also discarding 93 output transitions
Drop transitions (Output transitions of discarded places.) removed 93 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 12 transition count 22
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 8 transition count 11
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 8 transition count 11
Applied a total of 31 rules in 53 ms. Remains 8 /94 variables (removed 86) and now considering 11/138 (removed 127) transitions.
// Phase 1: matrix 11 rows 8 cols
[2024-05-31 07:32:42] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 07:32:42] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-31 07:32:42] [INFO ] Invariant cache hit.
[2024-05-31 07:32:42] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-31 07:32:42] [INFO ] Redundant transitions in 20 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-05-31 07:32:42] [INFO ] Computed 0 invariants in 2 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/14 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/18 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 122 ms.
Refiners :[State Equation: 7/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/12 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/14 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/16 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/16 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 149 ms.
Refiners :[State Equation: 7/8 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 283ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/94 places, 10/138 transitions.
Graph (complete) has 3 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 2 ms. Remains 7 /8 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-31 07:32:43] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 07:32:43] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 07:32:43] [INFO ] Invariant cache hit.
[2024-05-31 07:32:43] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/94 places, 9/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 518 ms. Remains : 7/94 places, 9/138 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-02
Product exploration explored 100000 steps with 10862 reset in 473 ms.
Product exploration explored 100000 steps with 10781 reset in 240 ms.
Computed a total of 7 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 7 transition count 9
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 (NOT p0) (NOT p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-02 finished in 1750 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)))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 52 transition count 52
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 52 transition count 52
Applied a total of 84 rules in 5 ms. Remains 52 /94 variables (removed 42) and now considering 52/138 (removed 86) transitions.
// Phase 1: matrix 52 rows 52 cols
[2024-05-31 07:32:44] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 07:32:44] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-31 07:32:44] [INFO ] Invariant cache hit.
[2024-05-31 07:32:44] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2024-05-31 07:32:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 52/104 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 53 constraints, problems are : Problem set: 0 solved, 51 unsolved in 951 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/104 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1232 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 2203ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2205ms
Starting structural reductions in LTL mode, iteration 1 : 52/94 places, 52/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2348 ms. Remains : 52/94 places, 52/138 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-03 finished in 2484 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(p2) U p3)&&p1))))'
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Graph (complete) has 62 edges and 94 vertex of which 36 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 67 output transitions
Drop transitions (Output transitions of discarded places.) removed 67 transitions
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 18 place count 19 transition count 23
Iterating global reduction 0 with 17 rules applied. Total rules applied 35 place count 19 transition count 23
Applied a total of 35 rules in 8 ms. Remains 19 /94 variables (removed 75) and now considering 23/138 (removed 115) transitions.
// Phase 1: matrix 23 rows 19 cols
[2024-05-31 07:32:46] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 07:32:46] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-31 07:32:46] [INFO ] Invariant cache hit.
[2024-05-31 07:32:46] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-31 07:32:46] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2024-05-31 07:32:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 23/41 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/42 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/42 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 42/42 variables, and 19 constraints, problems are : Problem set: 0 solved, 22 unsolved in 366 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 23/41 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1/42 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/42 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 42/42 variables, and 41 constraints, problems are : Problem set: 0 solved, 22 unsolved in 350 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 726ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 727ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/94 places, 23/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 837 ms. Remains : 19/94 places, 23/138 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-04
Product exploration explored 100000 steps with 4216 reset in 439 ms.
Product exploration explored 100000 steps with 4188 reset in 370 ms.
Computed a total of 19 stabilizing places and 23 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 19 transition count 23
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) (NOT p2)), (X (NOT p2)), (X (NOT p3)), (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT (AND p0 (NOT p3) (NOT p2)))), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p3) p2)))), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p3) p2)))), (X (NOT (AND p0 (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) p2))), (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (NOT (AND p0 p1 (NOT p3) p2))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))), (X (NOT p1)), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p3) p2))))), (X (X (NOT (AND p0 (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) p2)))), (X (X (NOT (AND p0 p1 (NOT p3) p2)))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1) (NOT p2)) (AND p0 (NOT p3) (NOT p2)))))), (X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (AND p0 (NOT p3) (NOT p2)))), (X (X (NOT (AND p0 (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3) p2))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p3) p2))))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p1)) (AND p0 (NOT p3) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 25 factoid took 29 ms. Reduced automaton from 3 states, 16 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-04 finished in 2003 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(G(p0))))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 52 transition count 52
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 52 transition count 52
Applied a total of 84 rules in 6 ms. Remains 52 /94 variables (removed 42) and now considering 52/138 (removed 86) transitions.
// Phase 1: matrix 52 rows 52 cols
[2024-05-31 07:32:48] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 07:32:48] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-31 07:32:48] [INFO ] Invariant cache hit.
[2024-05-31 07:32:49] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 51 sub problems to find dead transitions.
[2024-05-31 07:32:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 52/104 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (OVERLAPS) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 53 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1052 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 51 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 3 (OVERLAPS) 52/104 variables, 52/53 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 51/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 51 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 51 unsolved in 1183 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 51/51 constraints, Known Traps: 0/0 constraints]
After SMT, in 2264ms problems are : Problem set: 0 solved, 51 unsolved
Search for dead transitions found 0 dead transitions in 2266ms
Starting structural reductions in LTL mode, iteration 1 : 52/94 places, 52/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2502 ms. Remains : 52/94 places, 52/138 transitions.
Stuttering acceptance computed with spot in 175 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-05
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-05 finished in 2696 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(F(p0))))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 54 transition count 55
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 54 transition count 55
Applied a total of 80 rules in 7 ms. Remains 54 /94 variables (removed 40) and now considering 55/138 (removed 83) transitions.
// Phase 1: matrix 55 rows 54 cols
[2024-05-31 07:32:51] [INFO ] Computed 1 invariants in 10 ms
[2024-05-31 07:32:51] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-05-31 07:32:51] [INFO ] Invariant cache hit.
[2024-05-31 07:32:51] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 54 sub problems to find dead transitions.
[2024-05-31 07:32:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 55/109 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 0/109 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/109 variables, and 55 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1116 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 55/109 variables, 54/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 54/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 0/109 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/109 variables, and 109 constraints, problems are : Problem set: 0 solved, 54 unsolved in 1236 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 54/54 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 0/0 constraints]
After SMT, in 2376ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 2378ms
Starting structural reductions in LTL mode, iteration 1 : 54/94 places, 55/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2625 ms. Remains : 54/94 places, 55/138 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-06
Stuttering criterion allowed to conclude after 128 steps with 2 reset in 1 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-06 finished in 2750 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(p0)&&X(F(p1))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 56 transition count 58
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 56 transition count 58
Applied a total of 76 rules in 4 ms. Remains 56 /94 variables (removed 38) and now considering 58/138 (removed 80) transitions.
// Phase 1: matrix 58 rows 56 cols
[2024-05-31 07:32:54] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 07:32:54] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 07:32:54] [INFO ] Invariant cache hit.
[2024-05-31 07:32:54] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-31 07:32:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 58/114 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 57 constraints, problems are : Problem set: 0 solved, 57 unsolved in 802 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 58/114 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 57/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 114 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1113 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 1931ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 1932ms
Starting structural reductions in LTL mode, iteration 1 : 56/94 places, 58/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2066 ms. Remains : 56/94 places, 58/138 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-07
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-07 finished in 2188 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(p0))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Graph (complete) has 62 edges and 94 vertex of which 20 are kept as prefixes of interest. Removing 74 places using SCC suffix rule.1 ms
Discarding 74 places :
Also discarding 87 output transitions
Drop transitions (Output transitions of discarded places.) removed 87 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 19 transition count 44
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 19 place count 7 transition count 9
Iterating global reduction 1 with 12 rules applied. Total rules applied 31 place count 7 transition count 9
Applied a total of 31 rules in 3 ms. Remains 7 /94 variables (removed 87) and now considering 9/138 (removed 129) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-31 07:32:56] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 07:32:56] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 07:32:56] [INFO ] Invariant cache hit.
[2024-05-31 07:32:56] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 07:32:56] [INFO ] Redundant transitions in 11 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 7 cols
[2024-05-31 07:32:56] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/13 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 4 unsolved in 51 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/11 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 61 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 116ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/94 places, 8/138 transitions.
Graph (complete) has 2 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-31 07:32:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 07:32:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 07:32:56] [INFO ] Invariant cache hit.
[2024-05-31 07:32:56] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/94 places, 7/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 223 ms. Remains : 6/94 places, 7/138 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-08
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-08 finished in 269 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((p0&&X(G((G(p1) U p2))))))'
Support contains 5 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Graph (complete) has 62 edges and 94 vertex of which 29 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 77 output transitions
Drop transitions (Output transitions of discarded places.) removed 77 transitions
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 13 transition count 15
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 13 transition count 15
Applied a total of 33 rules in 3 ms. Remains 13 /94 variables (removed 81) and now considering 15/138 (removed 123) transitions.
// Phase 1: matrix 15 rows 13 cols
[2024-05-31 07:32:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 07:32:56] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 07:32:56] [INFO ] Invariant cache hit.
[2024-05-31 07:32:56] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-31 07:32:56] [INFO ] Redundant transitions in 0 ms returned []
Running 14 sub problems to find dead transitions.
[2024-05-31 07:32:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1/28 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 0/28 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 28/28 variables, and 13 constraints, problems are : Problem set: 0 solved, 14 unsolved in 120 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 15/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 14/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 1/28 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/28 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 28/28 variables, and 27 constraints, problems are : Problem set: 0 solved, 14 unsolved in 148 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 272ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/94 places, 15/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 13/94 places, 15/138 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-11
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-11 finished in 583 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)))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Graph (complete) has 62 edges and 94 vertex of which 18 are kept as prefixes of interest. Removing 76 places using SCC suffix rule.1 ms
Discarding 76 places :
Also discarding 89 output transitions
Drop transitions (Output transitions of discarded places.) removed 89 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 17 transition count 38
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 21 place count 7 transition count 9
Iterating global reduction 1 with 10 rules applied. Total rules applied 31 place count 7 transition count 9
Applied a total of 31 rules in 2 ms. Remains 7 /94 variables (removed 87) and now considering 9/138 (removed 129) transitions.
// Phase 1: matrix 9 rows 7 cols
[2024-05-31 07:32:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 07:32:57] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 07:32:57] [INFO ] Invariant cache hit.
[2024-05-31 07:32:57] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 07:32:57] [INFO ] Redundant transitions in 14 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 4 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 7 cols
[2024-05-31 07:32:57] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/11 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/13 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/15 variables, and 6 constraints, problems are : Problem set: 0 solved, 4 unsolved in 72 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/9 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/11 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/13 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/15 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 66 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 142ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 142ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/94 places, 8/138 transitions.
Graph (complete) has 2 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 6 /7 variables (removed 1) and now considering 7/8 (removed 1) transitions.
// Phase 1: matrix 7 rows 6 cols
[2024-05-31 07:32:57] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 07:32:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 07:32:57] [INFO ] Invariant cache hit.
[2024-05-31 07:32:57] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/94 places, 7/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 6/94 places, 7/138 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-12
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-12 finished in 296 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(!p2&&(!p0 U (p1||G(!p0)))))))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Graph (complete) has 62 edges and 94 vertex of which 34 are kept as prefixes of interest. Removing 60 places using SCC suffix rule.0 ms
Discarding 60 places :
Also discarding 69 output transitions
Drop transitions (Output transitions of discarded places.) removed 69 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 33 transition count 66
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 19 place count 17 transition count 21
Iterating global reduction 1 with 16 rules applied. Total rules applied 35 place count 17 transition count 21
Applied a total of 35 rules in 3 ms. Remains 17 /94 variables (removed 77) and now considering 21/138 (removed 117) transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-31 07:32:57] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 07:32:57] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 07:32:57] [INFO ] Invariant cache hit.
[2024-05-31 07:32:57] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2024-05-31 07:32:57] [INFO ] Redundant transitions in 14 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 12 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 17 cols
[2024-05-31 07:32:57] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 6/33 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/35 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 35/37 variables, and 16 constraints, problems are : Problem set: 0 solved, 12 unsolved in 247 ms.
Refiners :[State Equation: 16/17 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 15/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 12/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 6/33 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/35 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/35 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 35/37 variables, and 28 constraints, problems are : Problem set: 0 solved, 12 unsolved in 257 ms.
Refiners :[State Equation: 16/17 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 511ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 511ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/94 places, 20/138 transitions.
Graph (complete) has 6 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 16 /17 variables (removed 1) and now considering 19/20 (removed 1) transitions.
// Phase 1: matrix 19 rows 16 cols
[2024-05-31 07:32:58] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 07:32:58] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 07:32:58] [INFO ] Invariant cache hit.
[2024-05-31 07:32:58] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/94 places, 19/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 695 ms. Remains : 16/94 places, 19/138 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-13
Product exploration explored 100000 steps with 7776 reset in 213 ms.
Product exploration explored 100000 steps with 7898 reset in 229 ms.
Computed a total of 16 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 19
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 (NOT p2)), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-13 finished in 1400 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(p1) U (G(!F(p2)) U !p3))&&p0)))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 56 transition count 58
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 56 transition count 58
Applied a total of 76 rules in 7 ms. Remains 56 /94 variables (removed 38) and now considering 58/138 (removed 80) transitions.
// Phase 1: matrix 58 rows 56 cols
[2024-05-31 07:32:58] [INFO ] Computed 1 invariants in 5 ms
[2024-05-31 07:32:59] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-05-31 07:32:59] [INFO ] Invariant cache hit.
[2024-05-31 07:32:59] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 57 sub problems to find dead transitions.
[2024-05-31 07:32:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 58/114 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/114 variables, and 57 constraints, problems are : Problem set: 0 solved, 57 unsolved in 974 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 58/114 variables, 56/57 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 57/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/114 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/114 variables, and 114 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1354 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 2367ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2368ms
Starting structural reductions in LTL mode, iteration 1 : 56/94 places, 58/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2548 ms. Remains : 56/94 places, 58/138 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p0) (NOT p3)), true, (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-14 finished in 2933 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(p0)&&X(G(p1))) U X((p2 U p3))))'
Support contains 10 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 138/138 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 58 transition count 76
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 58 transition count 76
Applied a total of 72 rules in 6 ms. Remains 58 /94 variables (removed 36) and now considering 76/138 (removed 62) transitions.
// Phase 1: matrix 76 rows 58 cols
[2024-05-31 07:33:01] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 07:33:01] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 07:33:01] [INFO ] Invariant cache hit.
[2024-05-31 07:33:02] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2024-05-31 07:33:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 76/134 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 0/134 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 59 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1550 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (OVERLAPS) 76/134 variables, 58/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 75/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 0/134 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 134 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1877 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 58/58 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 3470ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 3472ms
Starting structural reductions in LTL mode, iteration 1 : 58/94 places, 76/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3668 ms. Remains : 58/94 places, 76/138 transitions.
Stuttering acceptance computed with spot in 376 ms :[(NOT p3), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p3), (NOT p0), true, (NOT p1), (NOT p3)]
Running random walk in product with property : ViralEpidemic-PT-S16D2C4A01-LTLFireability-15
Entered a terminal (fully accepting) state of product in 6 steps with 1 reset in 0 ms.
FORMULA ViralEpidemic-PT-S16D2C4A01-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S16D2C4A01-LTLFireability-15 finished in 4076 ms.
All properties solved by simple procedures.
Total runtime 35039 ms.
ITS solved all properties within timeout

BK_STOP 1717140786351

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S16D2C4A01"
export BK_EXAMINATION="LTLFireability"
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-S16D2C4A01, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r443-smll-171701110500396"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S16D2C4A01.tgz
mv ViralEpidemic-PT-S16D2C4A01 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;