fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r240-tall-174915590800980
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ViralEpidemic-PT-S04D1C1A03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 211021.00 0.00 0.00 FFFFFTTFFFTFTTFT normal

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590800980.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
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 r240-tall-174915590800980
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 9.9K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 11 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 284K May 29 14:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml 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 1749300495469

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 202505121319
[2025-06-07 12:48:16] [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]
[2025-06-07 12:48:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 12:48:17] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2025-06-07 12:48:17] [INFO ] Transformed 511 places.
[2025-06-07 12:48:17] [INFO ] Transformed 765 transitions.
[2025-06-07 12:48:17] [INFO ] Found NUPN structural information;
[2025-06-07 12:48:17] [INFO ] Parsed PT model containing 511 places and 765 transitions and 1785 arcs in 230 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 63 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 765/765 transitions.
Discarding 230 places :
Symmetric choice reduction at 0 with 230 rule applications. Total rules 230 place count 281 transition count 324
Iterating global reduction 0 with 230 rules applied. Total rules applied 460 place count 281 transition count 324
Applied a total of 460 rules in 54 ms. Remains 281 /511 variables (removed 230) and now considering 324/765 (removed 441) transitions.
// Phase 1: matrix 324 rows 281 cols
[2025-06-07 12:48:17] [INFO ] Computed 1 invariants in 36 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:48:17] [INFO ] Implicit Places using invariants in 358 ms returned []
[2025-06-07 12:48:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:48:17] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Running 323 sub problems to find dead transitions.
[2025-06-07 12:48:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 324/605 variables, 281/282 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/605 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (OVERLAPS) 0/605 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 282 constraints, problems are : Problem set: 0 solved, 323 unsolved in 12697 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 323 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 3 (OVERLAPS) 324/605 variables, 281/282 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/605 variables, 323/605 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/605 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 323 unsolved
At refinement iteration 6 (OVERLAPS) 0/605 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 323 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 605 constraints, problems are : Problem set: 0 solved, 323 unsolved in 17920 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 323/323 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30682ms problems are : Problem set: 0 solved, 323 unsolved
Search for dead transitions found 0 dead transitions in 30703ms
Starting structural reductions in LTL mode, iteration 1 : 281/511 places, 324/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31442 ms. Remains : 281/511 places, 324/765 transitions.
Support contains 63 out of 281 places after structural reductions.
[2025-06-07 12:48:48] [INFO ] Flatten gal took : 46 ms
[2025-06-07 12:48:48] [INFO ] Flatten gal took : 22 ms
[2025-06-07 12:48:49] [INFO ] Input system was already deterministic with 324 transitions.
Support contains 62 out of 281 places (down from 63) after GAL structural reductions.
RANDOM walk for 3643 steps (50 resets) in 292 ms. (12 steps per ms) remains 0/34 properties
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 281 stabilizing places and 324 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 281 transition count 324
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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))&&((p1 U (p2||G(p1))) U p3)))'
Support contains 7 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 240 transition count 242
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 240 transition count 242
Applied a total of 82 rules in 9 ms. Remains 240 /281 variables (removed 41) and now considering 242/324 (removed 82) transitions.
// Phase 1: matrix 242 rows 240 cols
[2025-06-07 12:48:49] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:48:49] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-07 12:48:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:48:50] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 241 sub problems to find dead transitions.
[2025-06-07 12:48:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 7847 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 241 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 10688 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 241/241 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18567ms problems are : Problem set: 0 solved, 241 unsolved
Search for dead transitions found 0 dead transitions in 18570ms
Starting structural reductions in LTL mode, iteration 1 : 240/281 places, 242/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19008 ms. Remains : 240/281 places, 242/324 transitions.
Stuttering acceptance computed with spot in 367 ms :[(OR (NOT p3) (NOT p0)), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p3), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-00 finished in 19453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&(X(X(!p1)) U (X(p3)&&p2))))'
Support contains 7 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 239 transition count 243
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 239 transition count 243
Applied a total of 84 rules in 12 ms. Remains 239 /281 variables (removed 42) and now considering 243/324 (removed 81) transitions.
// Phase 1: matrix 243 rows 239 cols
[2025-06-07 12:49:09] [INFO ] Computed 1 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:49:09] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-07 12:49:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:49:09] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-07 12:49:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 7453 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 10665 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18143ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 18144ms
Starting structural reductions in LTL mode, iteration 1 : 239/281 places, 243/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18488 ms. Remains : 239/281 places, 243/324 transitions.
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p2) (NOT p3)), (NOT p0), (OR (NOT p2) (NOT p3) p1), (NOT p3), p1, true]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-01
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-01 finished in 18716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(!p1 U (G(!p2)||X(F(p3))||G(!p1))))))'
Support contains 8 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 240 transition count 247
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 240 transition count 247
Applied a total of 82 rules in 11 ms. Remains 240 /281 variables (removed 41) and now considering 247/324 (removed 77) transitions.
// Phase 1: matrix 247 rows 240 cols
[2025-06-07 12:49:27] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:49:28] [INFO ] Implicit Places using invariants in 412 ms returned []
[2025-06-07 12:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:49:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Running 246 sub problems to find dead transitions.
[2025-06-07 12:49:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 247/487 variables, 240/241 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 0/487 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 241 constraints, problems are : Problem set: 0 solved, 246 unsolved in 8064 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 246 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 3 (OVERLAPS) 247/487 variables, 240/241 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 246/487 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 246 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 246 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 487 constraints, problems are : Problem set: 0 solved, 246 unsolved in 11216 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 246/246 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19298ms problems are : Problem set: 0 solved, 246 unsolved
Search for dead transitions found 0 dead transitions in 19298ms
Starting structural reductions in LTL mode, iteration 1 : 240/281 places, 247/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19904 ms. Remains : 240/281 places, 247/324 transitions.
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3) p2 p1), (AND (NOT p0) (NOT p3) p2 p1), (AND (NOT p0) (NOT p3) p2 p1), (AND (NOT p0) (NOT p3) p2)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-02
Stuttering criterion allowed to conclude after 81 steps with 1 reset in 2 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-02 finished in 20121 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((F(p1) U p0)))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 238 transition count 239
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 238 transition count 239
Applied a total of 86 rules in 7 ms. Remains 238 /281 variables (removed 43) and now considering 239/324 (removed 85) transitions.
// Phase 1: matrix 239 rows 238 cols
[2025-06-07 12:49:47] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:49:48] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-06-07 12:49:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:49:48] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
Running 238 sub problems to find dead transitions.
[2025-06-07 12:49:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 239/477 variables, 238/239 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 0/477 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 239 constraints, problems are : Problem set: 0 solved, 238 unsolved in 7362 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 238 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 3 (OVERLAPS) 239/477 variables, 238/239 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 238/477 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 238 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 238 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 477 constraints, problems are : Problem set: 0 solved, 238 unsolved in 10369 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 238/238 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17744ms problems are : Problem set: 0 solved, 238 unsolved
Search for dead transitions found 0 dead transitions in 17745ms
Starting structural reductions in LTL mode, iteration 1 : 238/281 places, 239/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18155 ms. Remains : 238/281 places, 239/324 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-03
Stuttering criterion allowed to conclude after 67 steps with 0 reset in 3 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-03 finished in 18301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Graph (complete) has 168 edges and 281 vertex of which 15 are kept as prefixes of interest. Removing 266 places using SCC suffix rule.1 ms
Discarding 266 places :
Also discarding 294 output transitions
Drop transitions (Output transitions of discarded places.) removed 294 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 14 transition count 27
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 10 transition count 16
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 10 transition count 16
Applied a total of 11 rules in 21 ms. Remains 10 /281 variables (removed 271) and now considering 16/324 (removed 308) transitions.
// Phase 1: matrix 16 rows 10 cols
[2025-06-07 12:50:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:06] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-07 12:50:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:06] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:50:06] [INFO ] Redundant transitions in 12 ms returned [2, 6]
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 9 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 10 cols
[2025-06-07 12:50:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/24 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 107 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 11/18 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 2/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 132 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 249ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 250ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/281 places, 14/324 transitions.
Graph (complete) has 4 edges and 10 vertex of which 8 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 8 /10 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 8 cols
[2025-06-07 12:50:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:06] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-06-07 12:50:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:06] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/281 places, 12/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 8/281 places, 12/324 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-04
Stuttering criterion allowed to conclude after 11 steps with 1 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-04 finished in 464 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Graph (complete) has 168 edges and 281 vertex of which 16 are kept as prefixes of interest. Removing 265 places using SCC suffix rule.3 ms
Discarding 265 places :
Also discarding 296 output transitions
Drop transitions (Output transitions of discarded places.) removed 296 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 15 transition count 23
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 8 place count 12 transition count 16
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 12 transition count 16
Applied a total of 11 rules in 8 ms. Remains 12 /281 variables (removed 269) and now considering 16/324 (removed 308) transitions.
// Phase 1: matrix 16 rows 12 cols
[2025-06-07 12:50:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:06] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-07 12:50:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:50:06] [INFO ] Redundant transitions in 13 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 10 sub problems to find dead transitions.
// Phase 1: matrix 15 rows 12 cols
[2025-06-07 12:50:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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/27 variables, and 11 constraints, problems are : Problem set: 0 solved, 10 unsolved in 113 ms.
Refiners :[State Equation: 11/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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/27 variables, and 21 constraints, problems are : Problem set: 0 solved, 10 unsolved in 118 ms.
Refiners :[State Equation: 11/12 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 233ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 12/281 places, 15/324 transitions.
Graph (complete) has 5 edges and 12 vertex of which 11 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 11 /12 variables (removed 1) and now considering 14/15 (removed 1) transitions.
// Phase 1: matrix 14 rows 11 cols
[2025-06-07 12:50:06] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:07] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-07 12:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:07] [INFO ] Implicit Places using invariants and state equation in 23 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 : 11/281 places, 14/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 344 ms. Remains : 11/281 places, 14/324 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-05
Product exploration explored 100000 steps with 12972 reset in 260 ms.
Product exploration explored 100000 steps with 12887 reset in 141 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
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 14 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-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-05 finished in 841 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!((X(p0) U p1) U (X(G(p2))||p0))&&F(p3)))'
Support contains 8 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 40 place count 241 transition count 246
Iterating global reduction 0 with 40 rules applied. Total rules applied 80 place count 241 transition count 246
Applied a total of 80 rules in 6 ms. Remains 241 /281 variables (removed 40) and now considering 246/324 (removed 78) transitions.
// Phase 1: matrix 246 rows 241 cols
[2025-06-07 12:50:07] [INFO ] Computed 1 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:07] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-06-07 12:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:07] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
Running 245 sub problems to find dead transitions.
[2025-06-07 12:50:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 246/487 variables, 241/242 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (OVERLAPS) 0/487 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Real declared 487/487 variables, and 242 constraints, problems are : Problem set: 0 solved, 245 unsolved in 7761 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 245 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/240 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 1 (OVERLAPS) 1/241 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/241 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 3 (OVERLAPS) 246/487 variables, 241/242 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/487 variables, 245/487 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/487 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 245 unsolved
At refinement iteration 6 (OVERLAPS) 0/487 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 245 unsolved
No progress, stopping.
After SMT solving in domain Int declared 487/487 variables, and 487 constraints, problems are : Problem set: 0 solved, 245 unsolved in 11143 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 241/241 constraints, PredecessorRefiner: 245/245 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18918ms problems are : Problem set: 0 solved, 245 unsolved
Search for dead transitions found 0 dead transitions in 18919ms
Starting structural reductions in LTL mode, iteration 1 : 241/281 places, 246/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19236 ms. Remains : 241/281 places, 246/324 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p3) p2 p0), true, p2, (NOT p3), p0, (AND p0 p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-06
Product exploration explored 100000 steps with 50000 reset in 457 ms.
Product exploration explored 100000 steps with 50000 reset in 442 ms.
Computed a total of 241 stabilizing places and 246 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 241 transition count 246
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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) p3 (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p3), (X (NOT p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p3)), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G p3)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 20 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-06 finished in 20485 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (p1 U G(!p1))) U X(X(p0)))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 235 transition count 237
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 235 transition count 237
Applied a total of 92 rules in 9 ms. Remains 235 /281 variables (removed 46) and now considering 237/324 (removed 87) transitions.
// Phase 1: matrix 237 rows 235 cols
[2025-06-07 12:50:28] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:28] [INFO ] Implicit Places using invariants in 106 ms returned []
[2025-06-07 12:50:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:28] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2025-06-07 12:50:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 237/472 variables, 235/236 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (OVERLAPS) 0/472 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 236 constraints, problems are : Problem set: 0 solved, 236 unsolved in 7460 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 236 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 3 (OVERLAPS) 237/472 variables, 235/236 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/472 variables, 236/472 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/472 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 6 (OVERLAPS) 0/472 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 236 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 472 constraints, problems are : Problem set: 0 solved, 236 unsolved in 10496 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17972ms problems are : Problem set: 0 solved, 236 unsolved
Search for dead transitions found 0 dead transitions in 17973ms
Starting structural reductions in LTL mode, iteration 1 : 235/281 places, 237/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18275 ms. Remains : 235/281 places, 237/324 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (NOT p0), (NOT p0), p1]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-07
Stuttering criterion allowed to conclude after 131 steps with 8 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-07 finished in 18557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(X(!(G(p0) U !p1))))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 237 transition count 240
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 237 transition count 240
Applied a total of 88 rules in 8 ms. Remains 237 /281 variables (removed 44) and now considering 240/324 (removed 84) transitions.
// Phase 1: matrix 240 rows 237 cols
[2025-06-07 12:50:46] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:46] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-07 12:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:50:46] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2025-06-07 12:50:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 7421 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 10137 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17591ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 17592ms
Starting structural reductions in LTL mode, iteration 1 : 237/281 places, 240/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17906 ms. Remains : 237/281 places, 240/324 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-08
Stuttering criterion allowed to conclude after 81 steps with 1 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-08 finished in 18073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Graph (complete) has 168 edges and 281 vertex of which 20 are kept as prefixes of interest. Removing 261 places using SCC suffix rule.1 ms
Discarding 261 places :
Also discarding 289 output transitions
Drop transitions (Output transitions of discarded places.) removed 289 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 16 transition count 24
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 16 transition count 24
Applied a total of 9 rules in 3 ms. Remains 16 /281 variables (removed 265) and now considering 24/324 (removed 300) transitions.
// Phase 1: matrix 24 rows 16 cols
[2025-06-07 12:51:04] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:04] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-06-07 12:51:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:04] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:51:04] [INFO ] Redundant transitions in 12 ms returned [12, 16]
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 19 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 16 cols
[2025-06-07 12:51:04] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 22/37 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 1/38 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/38 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 16 constraints, problems are : Problem set: 0 solved, 19 unsolved in 172 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 22/37 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 19/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 1/38 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 35 constraints, problems are : Problem set: 0 solved, 19 unsolved in 173 ms.
Refiners :[State Equation: 16/16 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 348ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 348ms
Starting structural reductions in SI_LTL mode, iteration 1 : 16/281 places, 22/324 transitions.
Graph (complete) has 9 edges and 16 vertex of which 14 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 1 ms. Remains 14 /16 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 14 cols
[2025-06-07 12:51:05] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:05] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-07 12:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:05] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 14/281 places, 20/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 461 ms. Remains : 14/281 places, 20/324 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-10
Product exploration explored 100000 steps with 13019 reset in 147 ms.
Product exploration explored 100000 steps with 13152 reset in 156 ms.
Computed a total of 14 stabilizing places and 20 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 14 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1), (X p1), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 10 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) 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 922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)&&F(!p1)) U X(X(G((p2 U X(p0)))))))'
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 239 transition count 243
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 239 transition count 243
Applied a total of 84 rules in 9 ms. Remains 239 /281 variables (removed 42) and now considering 243/324 (removed 81) transitions.
// Phase 1: matrix 243 rows 239 cols
[2025-06-07 12:51:05] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:05] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 12:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:05] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2025-06-07 12:51:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 7604 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 10883 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18504ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 18505ms
Starting structural reductions in LTL mode, iteration 1 : 239/281 places, 243/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18782 ms. Remains : 239/281 places, 243/324 transitions.
Stuttering acceptance computed with spot in 513 ms :[(NOT p0), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND p1 (NOT p2) (NOT p0)), (AND (NOT p0) p1), (AND p1 (NOT p0)), p1]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-11
Stuttering criterion allowed to conclude after 105 steps with 2 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLFireability-11 finished in 19318 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Graph (complete) has 168 edges and 281 vertex of which 15 are kept as prefixes of interest. Removing 266 places using SCC suffix rule.1 ms
Discarding 266 places :
Also discarding 297 output transitions
Drop transitions (Output transitions of discarded places.) removed 297 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 5 ms. Remains 11 /281 variables (removed 270) and now considering 14/324 (removed 310) transitions.
// Phase 1: matrix 14 rows 11 cols
[2025-06-07 12:51:24] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:24] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-07 12:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:24] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:51:24] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
[2025-06-07 12:51:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 110 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 115 ms.
Refiners :[State Equation: 11/11 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 237ms problems are : Problem set: 0 solved, 10 unsolved
Search for dead transitions found 0 dead transitions in 238ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/281 places, 14/324 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 11/281 places, 14/324 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-12
Product exploration explored 100000 steps with 11785 reset in 107 ms.
Product exploration explored 100000 steps with 11790 reset in 92 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
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 11 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 568 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((!p0&&X(X(!p1))&&F(p0))||G(!p1)))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 237 transition count 240
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 237 transition count 240
Applied a total of 88 rules in 8 ms. Remains 237 /281 variables (removed 44) and now considering 240/324 (removed 84) transitions.
// Phase 1: matrix 240 rows 237 cols
[2025-06-07 12:51:25] [INFO ] Computed 1 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:25] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-07 12:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:25] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2025-06-07 12:51:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 7855 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 239 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 10671 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18540ms problems are : Problem set: 0 solved, 239 unsolved
Search for dead transitions found 0 dead transitions in 18540ms
Starting structural reductions in LTL mode, iteration 1 : 237/281 places, 240/324 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18883 ms. Remains : 237/281 places, 240/324 transitions.
Stuttering acceptance computed with spot in 224 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 1744 reset in 375 ms.
Product exploration explored 100000 steps with 1750 reset in 425 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (X (X (NOT (AND p0 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 14 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 20021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 324/324 transitions.
Graph (complete) has 168 edges and 281 vertex of which 15 are kept as prefixes of interest. Removing 266 places using SCC suffix rule.1 ms
Discarding 266 places :
Also discarding 294 output transitions
Drop transitions (Output transitions of discarded places.) removed 294 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 6 ms. Remains 11 /281 variables (removed 270) and now considering 15/324 (removed 309) transitions.
// Phase 1: matrix 15 rows 11 cols
[2025-06-07 12:51:45] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-07 12:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:45] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:51:45] [INFO ] Redundant transitions in 9 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
[2025-06-07 12:51:45] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 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 84 ms.
Refiners :[State Equation: 10/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 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, 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 96 ms.
Refiners :[State Equation: 10/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 192ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/281 places, 14/324 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 1 ms. Remains 10 /11 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 10 cols
[2025-06-07 12:51:45] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:45] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-07 12:51:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:51:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/281 places, 13/324 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 10/281 places, 13/324 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLFireability-15
Product exploration explored 100000 steps with 11451 reset in 115 ms.
Product exploration explored 100000 steps with 11460 reset in 136 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)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
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 34 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 644 ms.
All properties solved by simple procedures.
Total runtime 209281 ms.

BK_STOP 1749300706490

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-5832"
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 r240-tall-174915590800980"
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.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 ;