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

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

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

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590801004.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-S08D1C2A02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590801004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 8.1K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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.2K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 13K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 101K 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 400K 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-S08D1C2A02-LTLFireability-00
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-01
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-02
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-03
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-04
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-05
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-06
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-07
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-08
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-09
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-10
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-11
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-12
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-13
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-14
FORMULA_NAME ViralEpidemic-PT-S08D1C2A02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749307089417

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-S08D1C2A02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-07 14:38:10] [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 14:38:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 14:38:11] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2025-06-07 14:38:11] [INFO ] Transformed 731 places.
[2025-06-07 14:38:11] [INFO ] Transformed 1241 transitions.
[2025-06-07 14:38:11] [INFO ] Parsed PT model containing 731 places and 1241 transitions and 2993 arcs in 237 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 2 formulas.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 72 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1241/1241 transitions.
Discarding 456 places :
Symmetric choice reduction at 0 with 456 rule applications. Total rules 456 place count 275 transition count 321
Iterating global reduction 0 with 456 rules applied. Total rules applied 912 place count 275 transition count 321
Applied a total of 912 rules in 74 ms. Remains 275 /731 variables (removed 456) and now considering 321/1241 (removed 920) transitions.
// Phase 1: matrix 321 rows 275 cols
[2025-06-07 14:38:11] [INFO ] Computed 1 invariants in 33 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:11] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-06-07 14:38:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:12] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
Running 320 sub problems to find dead transitions.
[2025-06-07 14:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 320 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 321/596 variables, 275/276 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (OVERLAPS) 0/596 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Real declared 596/596 variables, and 276 constraints, problems are : Problem set: 0 solved, 320 unsolved in 12343 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 1 (OVERLAPS) 1/275 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/275 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 3 (OVERLAPS) 321/596 variables, 275/276 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/596 variables, 320/596 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/596 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 320 unsolved
At refinement iteration 6 (OVERLAPS) 0/596 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 320 unsolved
No progress, stopping.
After SMT solving in domain Int declared 596/596 variables, and 596 constraints, problems are : Problem set: 0 solved, 320 unsolved in 17519 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 275/275 constraints, PredecessorRefiner: 320/320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 29938ms problems are : Problem set: 0 solved, 320 unsolved
Search for dead transitions found 0 dead transitions in 29953ms
Starting structural reductions in LTL mode, iteration 1 : 275/731 places, 321/1241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30713 ms. Remains : 275/731 places, 321/1241 transitions.
Support contains 72 out of 275 places after structural reductions.
[2025-06-07 14:38:42] [INFO ] Flatten gal took : 43 ms
[2025-06-07 14:38:42] [INFO ] Flatten gal took : 22 ms
[2025-06-07 14:38:42] [INFO ] Input system was already deterministic with 321 transitions.
Support contains 71 out of 275 places (down from 72) after GAL structural reductions.
RANDOM walk for 24028 steps (156 resets) in 844 ms. (28 steps per ms) remains 0/36 properties
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 275 stabilizing places and 321 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 275 transition count 321
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' '!(G((X(X((G(p0)||X(p1))))||(p2 U p3))))'
Support contains 8 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 218 transition count 221
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 218 transition count 221
Applied a total of 114 rules in 7 ms. Remains 218 /275 variables (removed 57) and now considering 221/321 (removed 100) transitions.
// Phase 1: matrix 221 rows 218 cols
[2025-06-07 14:38:43] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:43] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-07 14:38:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:38:43] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 14:38:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 221/439 variables, 218/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 219 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6704 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/439 variables, 218/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 220/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 439 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9557 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16281ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 16283ms
Starting structural reductions in LTL mode, iteration 1 : 218/275 places, 221/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16559 ms. Remains : 218/275 places, 221/321 transitions.
Stuttering acceptance computed with spot in 633 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p0) (NOT p1)), true, (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-01
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-01 finished in 17293 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(((p1 U p2)&&p0))||X(G(p3))))'
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 216 transition count 218
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 216 transition count 218
Applied a total of 118 rules in 8 ms. Remains 216 /275 variables (removed 59) and now considering 218/321 (removed 103) transitions.
// Phase 1: matrix 218 rows 216 cols
[2025-06-07 14:39:00] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:00] [INFO ] Implicit Places using invariants in 109 ms returned []
[2025-06-07 14:39:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:00] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 14:39:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 217 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6546 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 217/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 434 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9442 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16009ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 16010ms
Starting structural reductions in LTL mode, iteration 1 : 216/275 places, 218/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16299 ms. Remains : 216/275 places, 218/321 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p2), (OR (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-02
Stuttering criterion allowed to conclude after 127 steps with 0 reset in 4 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-02 finished in 16572 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((!X(X(X((F(p0) U p1)))) U p2)))'
Support contains 8 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 218 transition count 221
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 218 transition count 221
Applied a total of 114 rules in 13 ms. Remains 218 /275 variables (removed 57) and now considering 221/321 (removed 100) transitions.
// Phase 1: matrix 221 rows 218 cols
[2025-06-07 14:39:17] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:17] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-07 14:39:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:17] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 14:39:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 221/439 variables, 218/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 219 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6757 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/439 variables, 218/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 220/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 439 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9522 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16302ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 16303ms
Starting structural reductions in LTL mode, iteration 1 : 218/275 places, 221/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16611 ms. Remains : 218/275 places, 221/321 transitions.
Stuttering acceptance computed with spot in 266 ms :[(NOT p2), (NOT p2), (OR (NOT p2) p1), p1, p1, true, (AND p1 p0), p0]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-03
Entered a terminal (fully accepting) state of product in 17735 steps with 133 reset in 103 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-03 finished in 17000 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((p0 U X((X(p2)||p1)))))'
Support contains 6 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 216 transition count 218
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 216 transition count 218
Applied a total of 118 rules in 9 ms. Remains 216 /275 variables (removed 59) and now considering 218/321 (removed 103) transitions.
// Phase 1: matrix 218 rows 216 cols
[2025-06-07 14:39:34] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:34] [INFO ] Implicit Places using invariants in 96 ms returned []
[2025-06-07 14:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:34] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 14:39:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 217 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6537 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 217/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 434 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9319 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15869ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 15870ms
Starting structural reductions in LTL mode, iteration 1 : 216/275 places, 218/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16152 ms. Remains : 216/275 places, 218/321 transitions.
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-05
Product exploration explored 100000 steps with 33207 reset in 385 ms.
Product exploration explored 100000 steps with 33329 reset in 458 ms.
Computed a total of 216 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 216 transition count 218
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) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 376 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40001 steps (248 resets) in 686 ms. (58 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40003 steps (11 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 140 ms. (283 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (10 resets) in 171 ms. (232 steps per ms) remains 3/3 properties
[2025-06-07 14:39:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
Problem apf2 is UNSAT
Problem apf6 is UNSAT
After SMT solving in domain Real declared 6/434 variables, and 0 constraints, problems are : Problem set: 3 solved, 0 unsolved in 18 ms.
Refiners :[Generalized P Invariants (flows): 0/1 constraints, State Equation: 0/216 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p2))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2))), (G (OR p1 p0 p2)), (G (OR p1 (NOT p0) p2)), (G (OR p1 p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0), (F (NOT (OR p1 p0))), (F p2)]
Knowledge based reduction with 17 factoid took 322 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2025-06-07 14:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:53] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-07 14:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:39:53] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 14:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 217 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6711 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 217/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 434 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9273 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16000ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 16002ms
Finished structural reductions in LTL mode , in 1 iterations and 16286 ms. Remains : 216/216 places, 218/218 transitions.
Computed a total of 216 stabilizing places and 218 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 216 transition count 218
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) p1 (NOT p2)), (X p1), (X (X (NOT p2))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 143 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
RANDOM walk for 21426 steps (134 resets) in 127 ms. (167 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X p1), (X (X (NOT p2))), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F p0)]
Knowledge based reduction with 6 factoid took 217 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Product exploration explored 100000 steps with 33200 reset in 359 ms.
Product exploration explored 100000 steps with 33184 reset in 392 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true]
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Graph (complete) has 139 edges and 216 vertex of which 44 are kept as prefixes of interest. Removing 172 places using SCC suffix rule.3 ms
Discarding 172 places :
Also discarding 146 output transitions
Drop transitions (Output transitions of discarded places.) removed 146 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 44 transition count 69
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 21 place count 27 transition count 35
Iterating global reduction 1 with 17 rules applied. Total rules applied 38 place count 27 transition count 35
Applied a total of 38 rules in 20 ms. Remains 27 /216 variables (removed 189) and now considering 35/218 (removed 183) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:40:11] [INFO ] Redundant transitions in 15 ms returned [13, 17]
Found 2 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 2 transitions
Redundant transitions reduction (with SMT) removed 2 transitions.
Running 30 sub problems to find dead transitions.
// Phase 1: matrix 33 rows 27 cols
[2025-06-07 14:40:11] [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/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/59 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 1/60 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 0/60 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 27 constraints, problems are : Problem set: 0 solved, 30 unsolved in 347 ms.
Refiners :[State Equation: 27/27 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (OVERLAPS) 33/59 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 30/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (OVERLAPS) 1/60 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 57 constraints, problems are : Problem set: 0 solved, 30 unsolved in 349 ms.
Refiners :[State Equation: 27/27 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 700ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 700ms
Starting structural reductions in SI_LTL mode, iteration 1 : 27/216 places, 33/218 transitions.
Graph (complete) has 16 edges and 27 vertex of which 25 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 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 25 /27 variables (removed 2) and now considering 31/33 (removed 2) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/216 places, 31/218 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 744 ms. Remains : 25/216 places, 31/218 transitions.
Built C files in :
/tmp/ltsmin13899092704403391607
[2025-06-07 14:40:12] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13899092704403391607
Running compilation step : cd /tmp/ltsmin13899092704403391607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 493 ms.
Running link step : cd /tmp/ltsmin13899092704403391607;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin13899092704403391607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8065751545568319684.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 218/218 transitions.
Applied a total of 0 rules in 8 ms. Remains 216 /216 variables (removed 0) and now considering 218/218 (removed 0) transitions.
// Phase 1: matrix 218 rows 216 cols
[2025-06-07 14:40:27] [INFO ] Computed 1 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:40:27] [INFO ] Implicit Places using invariants in 97 ms returned []
[2025-06-07 14:40:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:40:27] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 14:40:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 217 constraints, problems are : Problem set: 0 solved, 217 unsolved in 7129 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 217/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 434 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9307 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16451ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 16451ms
Finished structural reductions in LTL mode , in 1 iterations and 16727 ms. Remains : 216/216 places, 218/218 transitions.
Built C files in :
/tmp/ltsmin13622972083323692276
[2025-06-07 14:40:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13622972083323692276
Running compilation step : cd /tmp/ltsmin13622972083323692276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 349 ms.
Running link step : cd /tmp/ltsmin13622972083323692276;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13622972083323692276;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16976866617934642297.hoa' '--buchi-type=spotba'
LTSmin run took 9075 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-05 finished in 79517 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(X(p0))||F(p1)))'
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 212 transition count 212
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 212 transition count 212
Applied a total of 126 rules in 14 ms. Remains 212 /275 variables (removed 63) and now considering 212/321 (removed 109) transitions.
// Phase 1: matrix 212 rows 212 cols
[2025-06-07 14:40:53] [INFO ] Computed 1 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:40:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-07 14:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:40:53] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 272 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2025-06-07 14:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 212/424 variables, 212/213 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 0/424 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 424/424 variables, and 213 constraints, problems are : Problem set: 0 solved, 211 unsolved in 6396 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/212 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/212 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (OVERLAPS) 212/424 variables, 212/213 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/424 variables, 211/424 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 0/424 variables, 0/424 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 424/424 variables, and 424 constraints, problems are : Problem set: 0 solved, 211 unsolved in 8227 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14634ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 14635ms
Starting structural reductions in LTL mode, iteration 1 : 212/275 places, 212/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14921 ms. Remains : 212/275 places, 212/321 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-07
Stuttering criterion allowed to conclude after 124 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-07 finished in 15103 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(X(X(X((X(X(p0))||G(p1)))))))'
Support contains 3 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 211 transition count 217
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 211 transition count 217
Applied a total of 128 rules in 10 ms. Remains 211 /275 variables (removed 64) and now considering 217/321 (removed 104) transitions.
// Phase 1: matrix 217 rows 211 cols
[2025-06-07 14:41:08] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:08] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-07 14:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:08] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 216 sub problems to find dead transitions.
[2025-06-07 14:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 217/428 variables, 211/212 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (OVERLAPS) 0/428 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 212 constraints, problems are : Problem set: 0 solved, 216 unsolved in 6399 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 216 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 3 (OVERLAPS) 217/428 variables, 211/212 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 216/428 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 0/428 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 216 unsolved
No progress, stopping.
After SMT solving in domain Int declared 428/428 variables, and 428 constraints, problems are : Problem set: 0 solved, 216 unsolved in 8756 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 211/211 constraints, PredecessorRefiner: 216/216 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15169ms problems are : Problem set: 0 solved, 216 unsolved
Search for dead transitions found 0 dead transitions in 15170ms
Starting structural reductions in LTL mode, iteration 1 : 211/275 places, 217/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15454 ms. Remains : 211/275 places, 217/321 transitions.
Stuttering acceptance computed with spot in 397 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-08
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-08 finished in 15873 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||(p1 U p2))))'
Support contains 4 out of 275 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Graph (complete) has 169 edges and 275 vertex of which 30 are kept as prefixes of interest. Removing 245 places using SCC suffix rule.1 ms
Discarding 245 places :
Also discarding 270 output transitions
Drop transitions (Output transitions of discarded places.) removed 270 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 29 transition count 43
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 15 place count 22 transition count 29
Iterating global reduction 1 with 7 rules applied. Total rules applied 22 place count 22 transition count 29
Applied a total of 22 rules in 12 ms. Remains 22 /275 variables (removed 253) and now considering 29/321 (removed 292) transitions.
// Phase 1: matrix 29 rows 22 cols
[2025-06-07 14:41:24] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:24] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-07 14:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:24] [INFO ] Implicit Places using invariants and state equation in 28 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 14:41:24] [INFO ] Redundant transitions in 13 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 19 sub problems to find dead transitions.
// Phase 1: matrix 27 rows 22 cols
[2025-06-07 14:41:24] [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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/41 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 4/45 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 2/47 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/49 variables, and 21 constraints, problems are : Problem set: 0 solved, 19 unsolved in 217 ms.
Refiners :[State Equation: 21/22 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/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 23/41 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 19/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 4/45 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 2/47 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/49 variables, and 40 constraints, problems are : Problem set: 0 solved, 19 unsolved in 259 ms.
Refiners :[State Equation: 21/22 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 479ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 479ms
Starting structural reductions in SI_LTL mode, iteration 1 : 22/275 places, 27/321 transitions.
Graph (complete) has 10 edges and 22 vertex of which 20 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 20 /22 variables (removed 2) and now considering 25/27 (removed 2) transitions.
// Phase 1: matrix 25 rows 20 cols
[2025-06-07 14:41:25] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-07 14:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 20/275 places, 25/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 608 ms. Remains : 20/275 places, 25/321 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-09
Stuttering criterion allowed to conclude after 45 steps with 4 reset in 0 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-09 finished in 647 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(X((G(p0) U p1))) U (p2 U G((p3||X(F(p2)))))))'
Support contains 7 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 59 place count 216 transition count 218
Iterating global reduction 0 with 59 rules applied. Total rules applied 118 place count 216 transition count 218
Applied a total of 118 rules in 11 ms. Remains 216 /275 variables (removed 59) and now considering 218/321 (removed 103) transitions.
// Phase 1: matrix 218 rows 216 cols
[2025-06-07 14:41:25] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-07 14:41:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:25] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-07 14:41: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/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 0/434 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 217 constraints, problems are : Problem set: 0 solved, 217 unsolved in 6382 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/216 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/216 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (OVERLAPS) 218/434 variables, 216/217 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/434 variables, 217/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/434 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 434 constraints, problems are : Problem set: 0 solved, 217 unsolved in 9087 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15484ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 15484ms
Starting structural reductions in LTL mode, iteration 1 : 216/275 places, 218/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15795 ms. Remains : 216/275 places, 218/321 transitions.
Stuttering acceptance computed with spot in 759 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p3) p1), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3) (NOT p0) p1)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-10
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-10 finished in 16590 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 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Graph (complete) has 169 edges and 275 vertex of which 19 are kept as prefixes of interest. Removing 256 places using SCC suffix rule.1 ms
Discarding 256 places :
Also discarding 288 output transitions
Drop transitions (Output transitions of discarded places.) removed 288 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 18 transition count 29
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 12 place count 10 transition count 13
Iterating global reduction 1 with 8 rules applied. Total rules applied 20 place count 10 transition count 13
Applied a total of 20 rules in 4 ms. Remains 10 /275 variables (removed 265) and now considering 13/321 (removed 308) transitions.
// Phase 1: matrix 13 rows 10 cols
[2025-06-07 14:41:41] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:41] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-07 14:41:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:41] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:41:41] [INFO ] Redundant transitions in 13 ms returned [5]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 7 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 10 cols
[2025-06-07 14:41:41] [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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/22 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 10 constraints, problems are : Problem set: 0 solved, 7 unsolved in 110 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 2/20 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 2/22 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/22 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 101 ms.
Refiners :[State Equation: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 217ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 217ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/275 places, 12/321 transitions.
Graph (complete) has 4 edges and 10 vertex of which 9 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 9 /10 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 9 cols
[2025-06-07 14:41:42] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:42] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-07 14:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:42] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/275 places, 11/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 326 ms. Remains : 9/275 places, 11/321 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-11
Product exploration explored 100000 steps with 7599 reset in 135 ms.
Product exploration explored 100000 steps with 7582 reset in 141 ms.
Computed a total of 9 stabilizing places and 11 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 11
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), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 12 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-S08D1C2A02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-11 finished in 689 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 X(p1))) U (G(p3)&&p2)))'
Support contains 8 out of 275 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 218 transition count 221
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 218 transition count 221
Applied a total of 114 rules in 9 ms. Remains 218 /275 variables (removed 57) and now considering 221/321 (removed 100) transitions.
// Phase 1: matrix 221 rows 218 cols
[2025-06-07 14:41:42] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:42] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-07 14:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:42] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2025-06-07 14:41:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 221/439 variables, 218/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 0/439 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 439/439 variables, and 219 constraints, problems are : Problem set: 0 solved, 220 unsolved in 6693 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/217 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/218 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 221/439 variables, 218/219 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 220/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 0/439 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Int declared 439/439 variables, and 439 constraints, problems are : Problem set: 0 solved, 220 unsolved in 9092 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15797ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 15798ms
Starting structural reductions in LTL mode, iteration 1 : 218/275 places, 221/321 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16104 ms. Remains : 218/275 places, 221/321 transitions.
Stuttering acceptance computed with spot in 291 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p3), (NOT p1), (NOT p1), true, (AND (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-12
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-12 finished in 16413 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(p0)||G(p1)))'
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Graph (complete) has 169 edges and 275 vertex of which 28 are kept as prefixes of interest. Removing 247 places using SCC suffix rule.1 ms
Discarding 247 places :
Also discarding 272 output transitions
Drop transitions (Output transitions of discarded places.) removed 272 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 27 transition count 42
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 16 place count 18 transition count 24
Iterating global reduction 1 with 9 rules applied. Total rules applied 25 place count 18 transition count 24
Applied a total of 25 rules in 5 ms. Remains 18 /275 variables (removed 257) and now considering 24/321 (removed 297) transitions.
// Phase 1: matrix 24 rows 18 cols
[2025-06-07 14:41:58] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:58] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-07 14:41:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:58] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:41:58] [INFO ] Redundant transitions in 11 ms returned [5, 17]
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 14 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 18 cols
[2025-06-07 14:41:58] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 2/40 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 18 constraints, problems are : Problem set: 0 solved, 14 unsolved in 223 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/36 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 2/40 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/40 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 32 constraints, problems are : Problem set: 0 solved, 14 unsolved in 211 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 451ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 452ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/275 places, 22/321 transitions.
Graph (complete) has 8 edges and 18 vertex of which 16 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 16 /18 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 16 cols
[2025-06-07 14:41:59] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:59] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-07 14:41:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:59] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/275 places, 20/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 575 ms. Remains : 16/275 places, 20/321 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-13
Entered a terminal (fully accepting) state of product in 173 steps with 10 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-13 finished in 699 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 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Graph (complete) has 169 edges and 275 vertex of which 19 are kept as prefixes of interest. Removing 256 places using SCC suffix rule.1 ms
Discarding 256 places :
Also discarding 281 output transitions
Drop transitions (Output transitions of discarded places.) removed 281 transitions
Reduce places removed 1 places and 1 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 7 transition count 11
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 7 transition count 11
Applied a total of 23 rules in 5 ms. Remains 7 /275 variables (removed 268) and now considering 11/321 (removed 310) transitions.
// Phase 1: matrix 11 rows 7 cols
[2025-06-07 14:41:59] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:59] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-07 14:41:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:41:59] [INFO ] Redundant transitions in 12 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 7 cols
[2025-06-07 14:41:59] [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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/13 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 2/15 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/15 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/17 variables, and 6 constraints, problems are : Problem set: 0 solved, 6 unsolved in 76 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/11 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/13 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/15 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/17 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 69 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 149ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 149ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/275 places, 10/321 transitions.
Graph (complete) has 2 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 0 ms. Remains 6 /7 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 6 cols
[2025-06-07 14:41:59] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:59] [INFO ] Implicit Places using invariants in 15 ms returned []
[2025-06-07 14:41:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:41:59] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/275 places, 9/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 247 ms. Remains : 6/275 places, 9/321 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-14
Product exploration explored 100000 steps with 11451 reset in 75 ms.
Product exploration explored 100000 steps with 11495 reset in 199 ms.
Computed a total of 6 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 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-S08D1C2A02-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-14 finished in 610 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(F(p0))||G((F(!p0)&&p1)))))'
Support contains 4 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 321/321 transitions.
Graph (complete) has 169 edges and 275 vertex of which 32 are kept as prefixes of interest. Removing 243 places using SCC suffix rule.2 ms
Discarding 243 places :
Also discarding 261 output transitions
Drop transitions (Output transitions of discarded places.) removed 261 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 31 transition count 55
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 18 place count 18 transition count 25
Iterating global reduction 1 with 13 rules applied. Total rules applied 31 place count 18 transition count 25
Applied a total of 31 rules in 6 ms. Remains 18 /275 variables (removed 257) and now considering 25/321 (removed 296) transitions.
// Phase 1: matrix 25 rows 18 cols
[2025-06-07 14:42:00] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:42:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-06-07 14:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:42:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 14:42:00] [INFO ] Redundant transitions in 15 ms returned [2, 6, 18]
Found 3 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 3 transitions
Redundant transitions reduction (with SMT) removed 3 transitions.
Running 14 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 18 cols
[2025-06-07 14:42:00] [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/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 2/38 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/40 variables, and 17 constraints, problems are : Problem set: 0 solved, 14 unsolved in 183 ms.
Refiners :[State Equation: 17/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 18/32 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 4/36 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 2/38 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/38 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/40 variables, and 31 constraints, problems are : Problem set: 0 solved, 14 unsolved in 180 ms.
Refiners :[State Equation: 17/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 367ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/275 places, 22/321 transitions.
Graph (complete) has 8 edges and 18 vertex of which 15 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Applied a total of 1 rules in 1 ms. Remains 15 /18 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 15 cols
[2025-06-07 14:42:00] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:42:00] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-07 14:42:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 14:42:00] [INFO ] Implicit Places using invariants and state equation in 25 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 : 15/275 places, 19/321 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 497 ms. Remains : 15/275 places, 19/321 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-15
Product exploration explored 100000 steps with 8149 reset in 103 ms.
Product exploration explored 100000 steps with 8173 reset in 113 ms.
Computed a total of 15 stabilizing places and 19 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 19
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 17 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-15 finished in 844 ms.
All properties solved by simple procedures.
Total runtime 230195 ms.

BK_STOP 1749307321429

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

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