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.r444-smll-171701111400356.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 itstools
Input is ViralEpidemic-PT-S04D1C1A03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r444-smll-171701111400356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 04:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 04:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 141K Apr 12 04:02 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 284K 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-S04D1C1A03-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717185174976

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S04D1C1A03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-31 19:52:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 19:52:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 19:52:58] [INFO ] Load time of PNML (sax parser for PT used): 368 ms
[2024-05-31 19:52:58] [INFO ] Transformed 511 places.
[2024-05-31 19:52:58] [INFO ] Transformed 765 transitions.
[2024-05-31 19:52:58] [INFO ] Found NUPN structural information;
[2024-05-31 19:52:58] [INFO ] Parsed PT model containing 511 places and 765 transitions and 1785 arcs in 636 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 765/765 transitions.
Discarding 239 places :
Symmetric choice reduction at 0 with 239 rule applications. Total rules 239 place count 272 transition count 306
Iterating global reduction 0 with 239 rules applied. Total rules applied 478 place count 272 transition count 306
Applied a total of 478 rules in 151 ms. Remains 272 /511 variables (removed 239) and now considering 306/765 (removed 459) transitions.
// Phase 1: matrix 306 rows 272 cols
[2024-05-31 19:52:58] [INFO ] Computed 1 invariants in 66 ms
[2024-05-31 19:52:59] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-05-31 19:52:59] [INFO ] Invariant cache hit.
[2024-05-31 19:52:59] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
Running 305 sub problems to find dead transitions.
[2024-05-31 19:53:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 306/578 variables, 272/273 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (OVERLAPS) 0/578 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 273 constraints, problems are : Problem set: 0 solved, 305 unsolved in 17909 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 305 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 1 (OVERLAPS) 1/272 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/272 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 3 (OVERLAPS) 306/578 variables, 272/273 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/578 variables, 305/578 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/578 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 305 unsolved
At refinement iteration 6 (OVERLAPS) 0/578 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 305 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 578 constraints, problems are : Problem set: 0 solved, 305 unsolved in 17046 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 305/305 constraints, Known Traps: 0/0 constraints]
After SMT, in 35164ms problems are : Problem set: 0 solved, 305 unsolved
Search for dead transitions found 0 dead transitions in 35211ms
Starting structural reductions in LTL mode, iteration 1 : 272/511 places, 306/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36816 ms. Remains : 272/511 places, 306/765 transitions.
Support contains 49 out of 272 places after structural reductions.
[2024-05-31 19:53:35] [INFO ] Flatten gal took : 109 ms
[2024-05-31 19:53:35] [INFO ] Flatten gal took : 50 ms
[2024-05-31 19:53:35] [INFO ] Input system was already deterministic with 306 transitions.
Support contains 47 out of 272 places (down from 49) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 26 to 24
RANDOM walk for 26000 steps (371 resets) in 1333 ms. (19 steps per ms) remains 0/24 properties
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 272 stabilizing places and 306 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 272 transition count 306
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 23 are kept as prefixes of interest. Removing 249 places using SCC suffix rule.1 ms
Discarding 249 places :
Also discarding 267 output transitions
Drop transitions (Output transitions of discarded places.) removed 267 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 22 transition count 34
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 17 transition count 22
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 17 transition count 22
Applied a total of 15 rules in 29 ms. Remains 17 /272 variables (removed 255) and now considering 22/306 (removed 284) transitions.
// Phase 1: matrix 22 rows 17 cols
[2024-05-31 19:53:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 19:53:36] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 19:53:36] [INFO ] Invariant cache hit.
[2024-05-31 19:53:36] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2024-05-31 19:53:36] [INFO ] Redundant transitions in 13 ms returned [5]
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 17 sub problems to find dead transitions.
// Phase 1: matrix 21 rows 17 cols
[2024-05-31 19:53:36] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 19/34 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 2/36 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 17 constraints, problems are : Problem set: 0 solved, 17 unsolved in 238 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 19/34 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 17/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 2/36 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 2/38 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 34 constraints, problems are : Problem set: 0 solved, 17 unsolved in 207 ms.
Refiners :[State Equation: 17/17 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 453ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 454ms
Starting structural reductions in SI_LTL mode, iteration 1 : 17/272 places, 21/306 transitions.
Graph (complete) has 9 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 20/21 (removed 1) transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-05-31 19:53:37] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 19:53:37] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 19:53:37] [INFO ] Invariant cache hit.
[2024-05-31 19:53:37] [INFO ] Implicit Places using invariants and state equation in 29 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 : 16/272 places, 20/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 617 ms. Remains : 16/272 places, 20/306 transitions.
Stuttering acceptance computed with spot in 330 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-02
Product exploration explored 100000 steps with 12851 reset in 552 ms.
Product exploration explored 100000 steps with 12864 reset in 287 ms.
Computed a total of 16 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 16 transition count 20
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 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-S04D1C1A03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 finished in 1934 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||X(((!(p0 U p3)&&p4)||p2))))))'
Support contains 7 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 239 transition count 243
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 239 transition count 243
Applied a total of 66 rules in 12 ms. Remains 239 /272 variables (removed 33) and now considering 243/306 (removed 63) transitions.
// Phase 1: matrix 243 rows 239 cols
[2024-05-31 19:53:38] [INFO ] Computed 1 invariants in 7 ms
[2024-05-31 19:53:38] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-31 19:53:38] [INFO ] Invariant cache hit.
[2024-05-31 19:53:39] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-31 19:53:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 243/482 variables, 239/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 0/482 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 240 constraints, problems are : Problem set: 0 solved, 242 unsolved in 11693 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/482 variables, 239/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 242/482 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 482 constraints, problems are : Problem set: 0 solved, 242 unsolved in 13542 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 25281ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 25286ms
Starting structural reductions in LTL mode, iteration 1 : 239/272 places, 243/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25705 ms. Remains : 239/272 places, 243/306 transitions.
Stuttering acceptance computed with spot in 522 ms :[true, (NOT p1), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3)), p3, (AND (NOT p1) p3), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3)), (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) p3))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-03
Product exploration explored 100000 steps with 25000 reset in 618 ms.
Product exploration explored 100000 steps with 25000 reset in 566 ms.
Computed a total of 239 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 239 transition count 243
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) p2 p4 (NOT p3)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p4)), (F (G (NOT p3)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 95 ms. Reduced automaton from 9 states, 17 edges and 5 AP (stutter sensitive) to 6 states, 8 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[true, (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), p3, (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3))]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (508 resets) in 453 ms. (88 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 377 ms. (105 steps per ms) remains 1/1 properties
[2024-05-31 19:54:06] [INFO ] Invariant cache hit.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 5/482 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 22 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 42ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2 p4 (NOT p3)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2)), (F (G p4)), (F (G (NOT p3))), (G (OR p2 (NOT p0) p3 (NOT p4)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p3))), (F p0), (F (NOT (AND (OR p2 (NOT p3)) (OR p2 p4)))), (F (NOT p2)), (F (NOT p4)), (F p3)]
Knowledge based reduction with 11 factoid took 444 ms. Reduced automaton from 6 states, 8 edges and 4 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Support contains 3 out of 239 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 239/239 places, 243/243 transitions.
Applied a total of 0 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2024-05-31 19:54:07] [INFO ] Invariant cache hit.
[2024-05-31 19:54:08] [INFO ] Implicit Places using invariants in 276 ms returned []
[2024-05-31 19:54:08] [INFO ] Invariant cache hit.
[2024-05-31 19:54:08] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-05-31 19:54:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 243/482 variables, 239/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 0/482 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 240 constraints, problems are : Problem set: 0 solved, 242 unsolved in 12366 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/482 variables, 239/240 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 242/482 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 482 constraints, problems are : Problem set: 0 solved, 242 unsolved in 14007 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 26407ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 26411ms
Finished structural reductions in LTL mode , in 1 iterations and 27114 ms. Remains : 239/239 places, 243/243 transitions.
Computed a total of 239 stabilizing places and 243 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 239 transition count 243
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 p2 (NOT p3) p4), (F (G p2)), (F (G (NOT p3))), (F (G p4))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 108 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 993 steps (12 resets) in 32 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p2 (NOT p3) p4), (F (G p2)), (F (G (NOT p3))), (F (G p4))]
False Knowledge obtained : [(F (NOT (AND (OR p2 (NOT p3)) (OR p2 p4)))), (F (NOT p2)), (F (NOT p4)), (F p3)]
Knowledge based reduction with 4 factoid took 299 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Stuttering acceptance computed with spot in 228 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Product exploration explored 100000 steps with 25000 reset in 573 ms.
Product exploration explored 100000 steps with 25000 reset in 409 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 249 ms :[(OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), (OR (AND (NOT p2) (NOT p4)) (AND (NOT p2) p3)), true]
Support contains 3 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 243/243 transitions.
Graph (complete) has 150 edges and 239 vertex of which 25 are kept as prefixes of interest. Removing 214 places using SCC suffix rule.1 ms
Discarding 214 places :
Also discarding 203 output transitions
Drop transitions (Output transitions of discarded places.) removed 203 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 25 transition count 38
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 20 transition count 28
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 20 transition count 28
Applied a total of 13 rules in 6 ms. Remains 20 /239 variables (removed 219) and now considering 28/243 (removed 215) transitions.
[2024-05-31 19:54:37] [INFO ] Redundant transitions in 19 ms returned [6, 21]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 22 sub problems to find dead transitions.
// Phase 1: matrix 26 rows 20 cols
[2024-05-31 19:54:37] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 26/45 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 1/46 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 20 constraints, problems are : Problem set: 0 solved, 22 unsolved in 327 ms.
Refiners :[State Equation: 20/20 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 26/45 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 22/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 1/46 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 42 constraints, problems are : Problem set: 0 solved, 22 unsolved in 347 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints]
After SMT, in 681ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/239 places, 26/243 transitions.
Graph (complete) has 12 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 24/26 (removed 2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/239 places, 24/243 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 715 ms. Remains : 18/239 places, 24/243 transitions.
Built C files in :
/tmp/ltsmin9957910222574475433
[2024-05-31 19:54:38] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9957910222574475433
Running compilation step : cd /tmp/ltsmin9957910222574475433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1295 ms.
Running link step : cd /tmp/ltsmin9957910222574475433;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin9957910222574475433;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1114969959449762136.hoa' '--buchi-type=spotba'
LTSmin run took 157 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 finished in 61557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 236 transition count 236
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 236 transition count 236
Applied a total of 72 rules in 9 ms. Remains 236 /272 variables (removed 36) and now considering 236/306 (removed 70) transitions.
// Phase 1: matrix 236 rows 236 cols
[2024-05-31 19:54:40] [INFO ] Computed 1 invariants in 5 ms
[2024-05-31 19:54:40] [INFO ] Implicit Places using invariants in 277 ms returned []
[2024-05-31 19:54:40] [INFO ] Invariant cache hit.
[2024-05-31 19:54:40] [INFO ] Implicit Places using invariants and state equation in 395 ms returned []
Implicit Place search using SMT with State Equation took 674 ms to find 0 implicit places.
Running 235 sub problems to find dead transitions.
[2024-05-31 19:54:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 236/472 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 0/472 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 237 constraints, problems are : Problem set: 0 solved, 235 unsolved in 11429 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 3 (OVERLAPS) 236/472 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 235/472 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 235 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 472 constraints, problems are : Problem set: 0 solved, 235 unsolved in 13228 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 235/235 constraints, Known Traps: 0/0 constraints]
After SMT, in 24692ms problems are : Problem set: 0 solved, 235 unsolved
Search for dead transitions found 0 dead transitions in 24695ms
Starting structural reductions in LTL mode, iteration 1 : 236/272 places, 236/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25379 ms. Remains : 236/272 places, 236/306 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 317 ms.
Product exploration explored 100000 steps with 50000 reset in 482 ms.
Computed a total of 236 stabilizing places and 236 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 236
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 finished in 26373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 28 are kept as prefixes of interest. Removing 244 places using SCC suffix rule.1 ms
Discarding 244 places :
Also discarding 253 output transitions
Drop transitions (Output transitions of discarded places.) removed 253 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 27 transition count 47
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 20 transition count 29
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 20 transition count 29
Applied a total of 20 rules in 5 ms. Remains 20 /272 variables (removed 252) and now considering 29/306 (removed 277) transitions.
// Phase 1: matrix 29 rows 20 cols
[2024-05-31 19:55:06] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 19:55:06] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 19:55:06] [INFO ] Invariant cache hit.
[2024-05-31 19:55:06] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-31 19:55:06] [INFO ] Redundant transitions in 14 ms returned [5, 20]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 18 sub problems to find dead transitions.
// Phase 1: matrix 27 rows 20 cols
[2024-05-31 19:55:06] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 4/43 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/45 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/47 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 20 constraints, problems are : Problem set: 0 solved, 18 unsolved in 294 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 23/39 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 18/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 4/43 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/45 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/45 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 2/47 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/47 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/47 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 38 constraints, problems are : Problem set: 0 solved, 18 unsolved in 457 ms.
Refiners :[State Equation: 20/20 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 758ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 758ms
Starting structural reductions in SI_LTL mode, iteration 1 : 20/272 places, 27/306 transitions.
Graph (complete) has 9 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 18 /20 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 18 cols
[2024-05-31 19:55:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:55:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-31 19:55:07] [INFO ] Invariant cache hit.
[2024-05-31 19:55:07] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/272 places, 25/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 916 ms. Remains : 18/272 places, 25/306 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-05
Product exploration explored 100000 steps with 7092 reset in 263 ms.
Product exploration explored 100000 steps with 7103 reset in 292 ms.
Computed a total of 18 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 18 transition count 25
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 p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 23 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 finished in 1600 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 U p1))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 31 are kept as prefixes of interest. Removing 241 places using SCC suffix rule.1 ms
Discarding 241 places :
Also discarding 253 output transitions
Drop transitions (Output transitions of discarded places.) removed 253 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 30 transition count 47
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 13 place count 23 transition count 31
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 23 transition count 31
Applied a total of 20 rules in 5 ms. Remains 23 /272 variables (removed 249) and now considering 31/306 (removed 275) transitions.
// Phase 1: matrix 31 rows 23 cols
[2024-05-31 19:55:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:55:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-31 19:55:08] [INFO ] Invariant cache hit.
[2024-05-31 19:55:08] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2024-05-31 19:55:08] [INFO ] Redundant transitions in 19 ms returned [5, 23]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 20 sub problems to find dead transitions.
// Phase 1: matrix 29 rows 23 cols
[2024-05-31 19:55:08] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 25/44 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 4/48 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/50 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/52 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 23 constraints, problems are : Problem set: 0 solved, 20 unsolved in 490 ms.
Refiners :[State Equation: 23/23 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/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 25/44 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 4/48 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/50 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2/52 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 43 constraints, problems are : Problem set: 0 solved, 20 unsolved in 517 ms.
Refiners :[State Equation: 23/23 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1013ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1017ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/272 places, 29/306 transitions.
Graph (complete) has 11 edges and 23 vertex of which 21 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 21 /23 variables (removed 2) and now considering 27/29 (removed 2) transitions.
// Phase 1: matrix 27 rows 21 cols
[2024-05-31 19:55:09] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 19:55:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-31 19:55:09] [INFO ] Invariant cache hit.
[2024-05-31 19:55:09] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/272 places, 27/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1239 ms. Remains : 21/272 places, 27/306 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-06
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 finished in 1366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(X((G(F(p0))||G(p1)))))))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 14 are kept as prefixes of interest. Removing 258 places using SCC suffix rule.1 ms
Discarding 258 places :
Also discarding 277 output transitions
Drop transitions (Output transitions of discarded places.) removed 277 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 13 transition count 26
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 9 transition count 14
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 9 transition count 14
Applied a total of 11 rules in 6 ms. Remains 9 /272 variables (removed 263) and now considering 14/306 (removed 292) transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-31 19:55:09] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 19:55:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 19:55:09] [INFO ] Invariant cache hit.
[2024-05-31 19:55:09] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-31 19:55:09] [INFO ] Redundant transitions in 17 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 8 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 9 cols
[2024-05-31 19:55:09] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 8 constraints, problems are : Problem set: 0 solved, 8 unsolved in 141 ms.
Refiners :[State Equation: 8/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 8/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/22 variables, and 16 constraints, problems are : Problem set: 0 solved, 8 unsolved in 165 ms.
Refiners :[State Equation: 8/9 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 311ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/272 places, 13/306 transitions.
Graph (complete) has 3 edges and 9 vertex of which 8 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 1 ms. Remains 8 /9 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-05-31 19:55:09] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:55:09] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 19:55:09] [INFO ] Invariant cache hit.
[2024-05-31 19:55:09] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/272 places, 12/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 8/272 places, 12/306 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-08
Product exploration explored 100000 steps with 15360 reset in 378 ms.
Product exploration explored 100000 steps with 15428 reset in 318 ms.
Computed a total of 8 stabilizing places and 12 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 12
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 finished in 1333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 31 are kept as prefixes of interest. Removing 241 places using SCC suffix rule.1 ms
Discarding 241 places :
Also discarding 253 output transitions
Drop transitions (Output transitions of discarded places.) removed 253 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 31 transition count 51
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 8 place count 26 transition count 38
Iterating global reduction 1 with 5 rules applied. Total rules applied 13 place count 26 transition count 38
Applied a total of 13 rules in 3 ms. Remains 26 /272 variables (removed 246) and now considering 38/306 (removed 268) transitions.
// Phase 1: matrix 38 rows 26 cols
[2024-05-31 19:55:10] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:55:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 19:55:10] [INFO ] Invariant cache hit.
[2024-05-31 19:55:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-31 19:55:10] [INFO ] Redundant transitions in 15 ms returned [10, 14, 26, 30]
Found 4 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 4 transitions
Redundant transitions reduction (with SMT) removed 4 transitions.
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 34 rows 26 cols
[2024-05-31 19:55:10] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 34/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 0/60 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 26 constraints, problems are : Problem set: 0 solved, 29 unsolved in 333 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 34/59 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 29/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 55 constraints, problems are : Problem set: 0 solved, 29 unsolved in 531 ms.
Refiners :[State Equation: 26/26 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 869ms problems are : Problem set: 0 solved, 29 unsolved
Search for dead transitions found 0 dead transitions in 869ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/272 places, 34/306 transitions.
Graph (complete) has 15 edges and 26 vertex of which 22 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Applied a total of 1 rules in 1 ms. Remains 22 /26 variables (removed 4) and now considering 30/34 (removed 4) transitions.
// Phase 1: matrix 30 rows 22 cols
[2024-05-31 19:55:11] [INFO ] Computed 0 invariants in 3 ms
[2024-05-31 19:55:11] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-31 19:55:11] [INFO ] Invariant cache hit.
[2024-05-31 19:55:11] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 22/272 places, 30/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1044 ms. Remains : 22/272 places, 30/306 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-09
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-09 finished in 1214 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 (!p2||G(!p1))))&&p0)))'
Support contains 6 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 240 transition count 242
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 240 transition count 242
Applied a total of 64 rules in 13 ms. Remains 240 /272 variables (removed 32) and now considering 242/306 (removed 64) transitions.
// Phase 1: matrix 242 rows 240 cols
[2024-05-31 19:55:12] [INFO ] Computed 1 invariants in 8 ms
[2024-05-31 19:55:12] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-31 19:55:12] [INFO ] Invariant cache hit.
[2024-05-31 19:55:12] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2024-05-31 19:55:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 241 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 242/482 variables, 240/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (OVERLAPS) 0/482 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Real declared 482/482 variables, and 241 constraints, problems are : Problem set: 0 solved, 241 unsolved in 11202 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 3 (OVERLAPS) 242/482 variables, 240/241 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/482 variables, 241/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/482 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
At refinement iteration 6 (OVERLAPS) 0/482 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 241 unsolved
No progress, stopping.
After SMT solving in domain Int declared 482/482 variables, and 482 constraints, problems are : Problem set: 0 solved, 241 unsolved in 11749 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints]
After SMT, in 22984ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 22989ms
Starting structural reductions in LTL mode, iteration 1 : 240/272 places, 242/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23752 ms. Remains : 240/272 places, 242/306 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (OR (NOT p0) (AND p1 p2)), (OR (NOT p0) (AND p1 p2)), (AND p2 p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 352 ms.
Product exploration explored 100000 steps with 33333 reset in 467 ms.
Computed a total of 240 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 240 transition count 242
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 p2) (NOT p1)), (X p0), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-10 finished in 24839 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 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 17 are kept as prefixes of interest. Removing 255 places using SCC suffix rule.1 ms
Discarding 255 places :
Also discarding 277 output transitions
Drop transitions (Output transitions of discarded places.) removed 277 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 16 transition count 27
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 13 transition count 19
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 13 transition count 19
Applied a total of 8 rules in 3 ms. Remains 13 /272 variables (removed 259) and now considering 19/306 (removed 287) transitions.
// Phase 1: matrix 19 rows 13 cols
[2024-05-31 19:55:36] [INFO ] Computed 0 invariants in 1 ms
[2024-05-31 19:55:36] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-31 19:55:36] [INFO ] Invariant cache hit.
[2024-05-31 19:55:36] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-31 19:55:36] [INFO ] Redundant transitions in 16 ms returned [2, 6, 10]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 10 sub problems to find dead transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-05-31 19:55:36] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/27 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 27/29 variables, and 12 constraints, problems are : Problem set: 0 solved, 10 unsolved in 113 ms.
Refiners :[State Equation: 12/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/25 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/27 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/27 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 27/29 variables, and 22 constraints, problems are : Problem set: 0 solved, 10 unsolved in 129 ms.
Refiners :[State Equation: 12/13 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 247ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 13/272 places, 16/306 transitions.
Graph (complete) has 6 edges and 13 vertex of which 10 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /13 variables (removed 3) and now considering 13/16 (removed 3) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-31 19:55:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:55:37] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 19:55:37] [INFO ] Invariant cache hit.
[2024-05-31 19:55:37] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/272 places, 13/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 363 ms. Remains : 10/272 places, 13/306 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-11
Product exploration explored 100000 steps with 11407 reset in 95 ms.
Product exploration explored 100000 steps with 11437 reset in 154 ms.
Computed a total of 10 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 13
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 19 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 finished in 718 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 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 15 are kept as prefixes of interest. Removing 257 places using SCC suffix rule.1 ms
Discarding 257 places :
Also discarding 279 output transitions
Drop transitions (Output transitions of discarded places.) removed 279 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 14 transition count 20
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 11 transition count 14
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 11 transition count 14
Applied a total of 13 rules in 8 ms. Remains 11 /272 variables (removed 261) and now considering 14/306 (removed 292) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-05-31 19:55:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:55:37] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 19:55:37] [INFO ] Invariant cache hit.
[2024-05-31 19:55:37] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-31 19:55:37] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2024-05-31 19:55:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 2/23 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/25 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 194 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 12/21 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 2/23 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/23 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 2/25 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 200 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 398ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/272 places, 14/306 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 478 ms. Remains : 11/272 places, 14/306 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-12
Product exploration explored 100000 steps with 11845 reset in 146 ms.
Product exploration explored 100000 steps with 11884 reset in 168 ms.
Computed a total of 11 stabilizing places and 14 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 11 transition count 14
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-12 finished in 914 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&&X(X(!p1))&&F(p0))||G(!p1)))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 237 transition count 240
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 237 transition count 240
Applied a total of 70 rules in 8 ms. Remains 237 /272 variables (removed 35) and now considering 240/306 (removed 66) transitions.
// Phase 1: matrix 240 rows 237 cols
[2024-05-31 19:55:38] [INFO ] Computed 1 invariants in 7 ms
[2024-05-31 19:55:38] [INFO ] Implicit Places using invariants in 295 ms returned []
[2024-05-31 19:55:38] [INFO ] Invariant cache hit.
[2024-05-31 19:55:39] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 754 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2024-05-31 19:55:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 239 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 240/477 variables, 237/238 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (OVERLAPS) 0/477 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 238 constraints, problems are : Problem set: 0 solved, 239 unsolved in 12224 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 3 (OVERLAPS) 240/477 variables, 237/238 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 239/477 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 239 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 477 constraints, problems are : Problem set: 0 solved, 239 unsolved in 13469 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints]
After SMT, in 25738ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 25743ms
Starting structural reductions in LTL mode, iteration 1 : 237/272 places, 240/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26505 ms. Remains : 237/272 places, 240/306 transitions.
Stuttering acceptance computed with spot in 333 ms :[p1, p1, p1, p1, (AND (NOT p0) p1), p1]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-13
Product exploration explored 100000 steps with 1749 reset in 711 ms.
Product exploration explored 100000 steps with 1736 reset in 846 ms.
Computed a total of 237 stabilizing places and 240 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 237 transition count 240
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 (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 25 ms. Reduced automaton from 6 states, 16 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-13 finished in 28607 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 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 306/306 transitions.
Graph (complete) has 165 edges and 272 vertex of which 15 are kept as prefixes of interest. Removing 257 places using SCC suffix rule.1 ms
Discarding 257 places :
Also discarding 276 output transitions
Drop transitions (Output transitions of discarded places.) removed 276 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 14 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 10 place count 11 transition count 15
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 11 transition count 15
Applied a total of 13 rules in 4 ms. Remains 11 /272 variables (removed 261) and now considering 15/306 (removed 291) transitions.
// Phase 1: matrix 15 rows 11 cols
[2024-05-31 19:56:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:56:07] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-31 19:56:07] [INFO ] Invariant cache hit.
[2024-05-31 19:56:07] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-31 19:56:07] [INFO ] Redundant transitions in 17 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 8 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-05-31 19:56:07] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/21 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/23 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/25 variables, and 10 constraints, problems are : Problem set: 0 solved, 8 unsolved in 142 ms.
Refiners :[State Equation: 10/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 11/19 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/19 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/21 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/23 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/25 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 157 ms.
Refiners :[State Equation: 10/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 303ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/272 places, 14/306 transitions.
Graph (complete) has 4 edges and 11 vertex of which 10 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 10 /11 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-05-31 19:56:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 19:56:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-31 19:56:07] [INFO ] Invariant cache hit.
[2024-05-31 19:56:07] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/272 places, 13/306 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 10/272 places, 13/306 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-15
Product exploration explored 100000 steps with 11454 reset in 134 ms.
Product exploration explored 100000 steps with 11447 reset in 155 ms.
Computed a total of 10 stabilizing places and 13 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 10 transition count 13
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 18 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-15 finished in 870 ms.
All properties solved by simple procedures.
Total runtime 190536 ms.

BK_STOP 1717185368375

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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