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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K 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 3.7K May 19 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 04:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Apr 12 04:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 68K 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-S04D1C1A02-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717120967078

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-S04D1C1A02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-31 02:02:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 02:02:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 02:02:49] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-05-31 02:02:49] [INFO ] Transformed 127 places.
[2024-05-31 02:02:49] [INFO ] Transformed 189 transitions.
[2024-05-31 02:02:49] [INFO ] Found NUPN structural information;
[2024-05-31 02:02:49] [INFO ] Parsed PT model containing 127 places and 189 transitions and 441 arcs in 415 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 127 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 127/127 places, 189/189 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 94 transition count 122
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 94 transition count 122
Applied a total of 66 rules in 54 ms. Remains 94 /127 variables (removed 33) and now considering 122/189 (removed 67) transitions.
// Phase 1: matrix 122 rows 94 cols
[2024-05-31 02:02:50] [INFO ] Computed 1 invariants in 45 ms
[2024-05-31 02:02:50] [INFO ] Implicit Places using invariants in 392 ms returned []
[2024-05-31 02:02:50] [INFO ] Invariant cache hit.
[2024-05-31 02:02:51] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2024-05-31 02:02:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 122/216 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 0/216 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 95 constraints, problems are : Problem set: 0 solved, 121 unsolved in 3655 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (OVERLAPS) 122/216 variables, 94/95 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/216 variables, 121/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (OVERLAPS) 0/216 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 216 constraints, problems are : Problem set: 0 solved, 121 unsolved in 4112 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 0/0 constraints]
After SMT, in 7926ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 7968ms
Starting structural reductions in LTL mode, iteration 1 : 94/127 places, 122/189 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8751 ms. Remains : 94/127 places, 122/189 transitions.
Support contains 46 out of 94 places after structural reductions.
[2024-05-31 02:02:59] [INFO ] Flatten gal took : 90 ms
[2024-05-31 02:02:59] [INFO ] Flatten gal took : 31 ms
[2024-05-31 02:02:59] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 42 out of 94 places (down from 46) after GAL structural reductions.
RANDOM walk for 8814 steps (332 resets) in 594 ms. (14 steps per ms) remains 0/25 properties
Computed a total of 94 stabilizing places and 122 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 94 transition count 122
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(X((G(F(p0))||G(p1)))))'
Support contains 2 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 60 transition count 60
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 60 transition count 60
Applied a total of 68 rules in 10 ms. Remains 60 /94 variables (removed 34) and now considering 60/122 (removed 62) transitions.
// Phase 1: matrix 60 rows 60 cols
[2024-05-31 02:03:00] [INFO ] Computed 1 invariants in 4 ms
[2024-05-31 02:03:00] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-31 02:03:00] [INFO ] Invariant cache hit.
[2024-05-31 02:03:00] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 59 sub problems to find dead transitions.
[2024-05-31 02:03:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 60/120 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (OVERLAPS) 0/120 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 61 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1283 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 60/120 variables, 60/61 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 59/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 120 constraints, problems are : Problem set: 0 solved, 59 unsolved in 1411 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 60/60 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints]
After SMT, in 2713ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 2718ms
Starting structural reductions in LTL mode, iteration 1 : 60/94 places, 60/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2962 ms. Remains : 60/94 places, 60/122 transitions.
Stuttering acceptance computed with spot in 503 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-01
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 8 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-01 finished in 3592 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((G(F(!p0)) U (!p1&&X(G(!p2))))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 61 transition count 64
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 61 transition count 64
Applied a total of 66 rules in 9 ms. Remains 61 /94 variables (removed 33) and now considering 64/122 (removed 58) transitions.
// Phase 1: matrix 64 rows 61 cols
[2024-05-31 02:03:04] [INFO ] Computed 1 invariants in 3 ms
[2024-05-31 02:03:04] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-05-31 02:03:04] [INFO ] Invariant cache hit.
[2024-05-31 02:03:04] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Running 63 sub problems to find dead transitions.
[2024-05-31 02:03:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 64/125 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 0/125 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 62 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1416 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (OVERLAPS) 64/125 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 63/125 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 125 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1589 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 0/0 constraints]
After SMT, in 3040ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3042ms
Starting structural reductions in LTL mode, iteration 1 : 61/94 places, 64/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3327 ms. Remains : 61/94 places, 64/122 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR p1 p2), p0, p0, (OR p1 p2), p2]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-02
Product exploration explored 100000 steps with 4765 reset in 782 ms.
Product exploration explored 100000 steps with 4765 reset in 368 ms.
Computed a total of 61 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 766 ms. Reduced automaton from 5 states, 17 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-02 finished in 5690 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(p0)||F(G(p1))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Graph (complete) has 56 edges and 94 vertex of which 27 are kept as prefixes of interest. Removing 67 places using SCC suffix rule.1 ms
Discarding 67 places :
Also discarding 79 output transitions
Drop transitions (Output transitions of discarded places.) removed 79 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 26 transition count 38
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 9 place count 22 transition count 28
Iterating global reduction 1 with 4 rules applied. Total rules applied 13 place count 22 transition count 28
Applied a total of 13 rules in 45 ms. Remains 22 /94 variables (removed 72) and now considering 28/122 (removed 94) transitions.
// Phase 1: matrix 28 rows 22 cols
[2024-05-31 02:03:09] [INFO ] Computed 0 invariants in 2 ms
[2024-05-31 02:03:09] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 02:03:09] [INFO ] Invariant cache hit.
[2024-05-31 02:03:09] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-31 02:03:10] [INFO ] Redundant transitions in 18 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 20 sub problems to find dead transitions.
// Phase 1: matrix 27 rows 22 cols
[2024-05-31 02:03:10] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 23/41 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/47 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/49 variables, and 21 constraints, problems are : Problem set: 0 solved, 20 unsolved in 420 ms.
Refiners :[State Equation: 21/22 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 23/41 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 4/45 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/47 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/49 variables, and 41 constraints, problems are : Problem set: 0 solved, 20 unsolved in 465 ms.
Refiners :[State Equation: 21/22 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 911ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 912ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/94 places, 27/122 transitions.
Graph (complete) has 10 edges and 22 vertex of which 21 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
Applied a total of 1 rules in 4 ms. Remains 21 /22 variables (removed 1) and now considering 26/27 (removed 1) transitions.
// Phase 1: matrix 26 rows 21 cols
[2024-05-31 02:03:10] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 02:03:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-31 02:03:10] [INFO ] Invariant cache hit.
[2024-05-31 02:03:11] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/94 places, 26/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1199 ms. Remains : 21/94 places, 26/122 transitions.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-04
Product exploration explored 100000 steps with 8983 reset in 484 ms.
Product exploration explored 100000 steps with 9049 reset in 330 ms.
Computed a total of 21 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 26
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 p0)), (X p1), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(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 5 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-04 finished in 2184 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, 122/122 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 59 transition count 61
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 59 transition count 61
Applied a total of 70 rules in 5 ms. Remains 59 /94 variables (removed 35) and now considering 61/122 (removed 61) transitions.
// Phase 1: matrix 61 rows 59 cols
[2024-05-31 02:03:12] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 02:03:12] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 02:03:12] [INFO ] Invariant cache hit.
[2024-05-31 02:03:12] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
Running 60 sub problems to find dead transitions.
[2024-05-31 02:03:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 61/120 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (OVERLAPS) 0/120 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 60 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1033 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 61/120 variables, 59/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/120 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/120 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 120 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1457 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 59/59 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2503ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2504ms
Starting structural reductions in LTL mode, iteration 1 : 59/94 places, 61/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2680 ms. Remains : 59/94 places, 61/122 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-05 finished in 2809 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(X(X(X(F(p0))))) U p1))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 62 transition count 63
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 62 transition count 63
Applied a total of 64 rules in 7 ms. Remains 62 /94 variables (removed 32) and now considering 63/122 (removed 59) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-31 02:03:14] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 02:03:14] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 02:03:14] [INFO ] Invariant cache hit.
[2024-05-31 02:03:15] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-31 02:03:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 63 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1125 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 62/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 125 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1627 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2767ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2770ms
Starting structural reductions in LTL mode, iteration 1 : 62/94 places, 63/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2994 ms. Remains : 62/94 places, 63/122 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p1), (OR (NOT p1) p0), p0, p0, true]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-06
Entered a terminal (fully accepting) state of product in 39 steps with 1 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-06 finished in 3220 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(G(p1))&&p0)))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 62 transition count 63
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 62 transition count 63
Applied a total of 64 rules in 7 ms. Remains 62 /94 variables (removed 32) and now considering 63/122 (removed 59) transitions.
// Phase 1: matrix 63 rows 62 cols
[2024-05-31 02:03:18] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 02:03:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-31 02:03:18] [INFO ] Invariant cache hit.
[2024-05-31 02:03:18] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2024-05-31 02:03:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 0/125 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 63 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1305 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 63/125 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 62/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 0/125 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 125 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1110 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2430ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2433ms
Starting structural reductions in LTL mode, iteration 1 : 62/94 places, 63/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2631 ms. Remains : 62/94 places, 63/122 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-08 finished in 2782 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)||G(!p1))))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 61 transition count 62
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 61 transition count 62
Applied a total of 66 rules in 5 ms. Remains 61 /94 variables (removed 33) and now considering 62/122 (removed 60) transitions.
// Phase 1: matrix 62 rows 61 cols
[2024-05-31 02:03:20] [INFO ] Computed 1 invariants in 2 ms
[2024-05-31 02:03:20] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-31 02:03:20] [INFO ] Invariant cache hit.
[2024-05-31 02:03:20] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 61 sub problems to find dead transitions.
[2024-05-31 02:03:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 62/123 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 62 constraints, problems are : Problem set: 0 solved, 61 unsolved in 855 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 1/61 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (OVERLAPS) 62/123 variables, 61/62 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/123 variables, 61/123 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 0/123 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 123 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1004 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 61/61 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 0/0 constraints]
After SMT, in 1873ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 1875ms
Starting structural reductions in LTL mode, iteration 1 : 61/94 places, 62/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2025 ms. Remains : 61/94 places, 62/122 transitions.
Stuttering acceptance computed with spot in 165 ms :[p0, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 333 ms.
Product exploration explored 100000 steps with 50000 reset in 306 ms.
Computed a total of 61 stabilizing places and 62 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 62
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 33 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-09 finished in 2959 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((X(X(p1))&&p0))&&F(G(p2)))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 63 transition count 67
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 63 transition count 67
Applied a total of 62 rules in 6 ms. Remains 63 /94 variables (removed 31) and now considering 67/122 (removed 55) transitions.
// Phase 1: matrix 67 rows 63 cols
[2024-05-31 02:03:23] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 02:03:23] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-31 02:03:23] [INFO ] Invariant cache hit.
[2024-05-31 02:03:23] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-31 02:03:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 67/130 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 64 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1237 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/130 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 66/130 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 130 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1688 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 2941ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 2942ms
Starting structural reductions in LTL mode, iteration 1 : 63/94 places, 67/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3121 ms. Remains : 63/94 places, 67/122 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p2), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-11
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-11 finished in 3471 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((F(!(p0 U (X(p0)||p1)))||G(p2)))))'
Support contains 6 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 63 transition count 67
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 63 transition count 67
Applied a total of 62 rules in 7 ms. Remains 63 /94 variables (removed 31) and now considering 67/122 (removed 55) transitions.
// Phase 1: matrix 67 rows 63 cols
[2024-05-31 02:03:27] [INFO ] Computed 1 invariants in 5 ms
[2024-05-31 02:03:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-31 02:03:27] [INFO ] Invariant cache hit.
[2024-05-31 02:03:27] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2024-05-31 02:03:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 67/130 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 0/130 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 64 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1423 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 67/130 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 66/130 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 130 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1671 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 63/63 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3110ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3112ms
Starting structural reductions in LTL mode, iteration 1 : 63/94 places, 67/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3316 ms. Remains : 63/94 places, 67/122 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-12
Product exploration explored 100000 steps with 31473 reset in 363 ms.
Product exploration explored 100000 steps with 31607 reset in 326 ms.
Computed a total of 63 stabilizing places and 67 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 63 transition count 67
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (AND p2 p0 p1))), (X (NOT (AND (NOT p2) p0 p1))), (X (NOT (AND p2 p1))), (X (AND p2 (NOT p1))), (X (NOT p0)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p2 p0 p1)))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT p0))), (X (X (NOT (AND p2 p0 (NOT p1))))), (F (G (NOT p1))), (F (G p2)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 21 ms. Reduced automaton from 3 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-12 finished in 4304 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||G(p1))))'
Support contains 4 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Graph (complete) has 56 edges and 94 vertex of which 25 are kept as prefixes of interest. Removing 69 places using SCC suffix rule.1 ms
Discarding 69 places :
Also discarding 83 output transitions
Drop transitions (Output transitions of discarded places.) removed 83 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 24 transition count 36
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 9 place count 18 transition count 23
Iterating global reduction 1 with 6 rules applied. Total rules applied 15 place count 18 transition count 23
Applied a total of 15 rules in 6 ms. Remains 18 /94 variables (removed 76) and now considering 23/122 (removed 99) transitions.
// Phase 1: matrix 23 rows 18 cols
[2024-05-31 02:03:31] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 02:03:31] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 02:03:31] [INFO ] Invariant cache hit.
[2024-05-31 02:03:31] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-31 02:03:31] [INFO ] Redundant transitions in 13 ms returned [15]
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 15 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 18 cols
[2024-05-31 02:03:31] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 2/40 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 18 constraints, problems are : Problem set: 0 solved, 15 unsolved in 356 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 18/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 4/36 variables, 2/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 2/38 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 2/40 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 33 constraints, problems are : Problem set: 0 solved, 15 unsolved in 387 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 763ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 764ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/94 places, 22/122 transitions.
Graph (complete) has 8 edges and 18 vertex of which 17 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 17 /18 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-31 02:03:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 02:03:32] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-31 02:03:32] [INFO ] Invariant cache hit.
[2024-05-31 02:03:32] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/94 places, 21/122 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 970 ms. Remains : 17/94 places, 21/122 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-13
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-13 finished in 1033 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 1 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Graph (complete) has 56 edges and 94 vertex of which 9 are kept as prefixes of interest. Removing 85 places using SCC suffix rule.1 ms
Discarding 85 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 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 8 transition count 15
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 5 transition count 7
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 5 transition count 7
Applied a total of 9 rules in 3 ms. Remains 5 /94 variables (removed 89) and now considering 7/122 (removed 115) transitions.
// Phase 1: matrix 7 rows 5 cols
[2024-05-31 02:03:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 02:03:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 02:03:32] [INFO ] Invariant cache hit.
[2024-05-31 02:03:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-31 02:03:32] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-31 02:03:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/12 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 12/12 variables, and 5 constraints, problems are : Problem set: 0 solved, 4 unsolved in 88 ms.
Refiners :[State Equation: 5/5 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 2/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 2/12 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/12 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 12/12 variables, and 9 constraints, problems are : Problem set: 0 solved, 4 unsolved in 88 ms.
Refiners :[State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 188ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/94 places, 7/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 5/94 places, 7/122 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-14
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-14 finished in 327 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(p1))))'
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 122/122 transitions.
Graph (complete) has 56 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 19 transition count 33
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 13 transition count 17
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 13 transition count 17
Applied a total of 14 rules in 7 ms. Remains 13 /94 variables (removed 81) and now considering 17/122 (removed 105) transitions.
// Phase 1: matrix 17 rows 13 cols
[2024-05-31 02:03:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 02:03:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-31 02:03:32] [INFO ] Invariant cache hit.
[2024-05-31 02:03:32] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-31 02:03:33] [INFO ] Redundant transitions in 0 ms returned []
Running 12 sub problems to find dead transitions.
[2024-05-31 02:03:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 4/28 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 2/30 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 0/30 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 30/30 variables, and 13 constraints, problems are : Problem set: 0 solved, 12 unsolved in 215 ms.
Refiners :[State Equation: 13/13 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 14/24 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 12/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 4/28 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/30 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 0/30 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 30/30 variables, and 25 constraints, problems are : Problem set: 0 solved, 12 unsolved in 249 ms.
Refiners :[State Equation: 13/13 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints]
After SMT, in 469ms problems are : Problem set: 0 solved, 12 unsolved
Search for dead transitions found 0 dead transitions in 469ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/94 places, 17/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 558 ms. Remains : 13/94 places, 17/122 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A02-LTLFireability-15
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A02-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A02-LTLFireability-15 finished in 736 ms.
All properties solved by simple procedures.
Total runtime 44249 ms.
ITS solved all properties within timeout

BK_STOP 1717121014030

--------------------
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-S04D1C1A02"
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-S04D1C1A02, 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-171701110300348"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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