fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r544-smll-171701111400380
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ViralEpidemic-PT-S08D1C2A02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
534.819 186646.00 231315.00 894.00 FFFFTFTFTFTFFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r544-smll-171701111400380.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
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 r544-smll-171701111400380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 920K
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 04:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Apr 12 04:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 12 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Apr 12 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 400K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ViralEpidemic-PT-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 1717307599085

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S08D1C2A02
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 05:53:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 05:53:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 05:53:21] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2024-06-02 05:53:21] [INFO ] Transformed 731 places.
[2024-06-02 05:53:21] [INFO ] Transformed 1241 transitions.
[2024-06-02 05:53:21] [INFO ] Parsed PT model containing 731 places and 1241 transitions and 2993 arcs in 368 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Support contains 62 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 1241/1241 transitions.
Discarding 464 places :
Symmetric choice reduction at 0 with 464 rule applications. Total rules 464 place count 267 transition count 310
Iterating global reduction 0 with 464 rules applied. Total rules applied 928 place count 267 transition count 310
Applied a total of 928 rules in 151 ms. Remains 267 /731 variables (removed 464) and now considering 310/1241 (removed 931) transitions.
// Phase 1: matrix 310 rows 267 cols
[2024-06-02 05:53:22] [INFO ] Computed 1 invariants in 49 ms
[2024-06-02 05:53:22] [INFO ] Implicit Places using invariants in 521 ms returned []
[2024-06-02 05:53:22] [INFO ] Invariant cache hit.
[2024-06-02 05:53:22] [INFO ] Implicit Places using invariants and state equation in 469 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
Running 309 sub problems to find dead transitions.
[2024-06-02 05:53:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 309 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 310/577 variables, 267/268 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 0/577 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/577 variables, and 268 constraints, problems are : Problem set: 0 solved, 309 unsolved in 14142 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (OVERLAPS) 310/577 variables, 267/268 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 309/577 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 0/577 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/577 variables, and 577 constraints, problems are : Problem set: 0 solved, 309 unsolved in 16933 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints]
After SMT, in 31255ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 31287ms
Starting structural reductions in LTL mode, iteration 1 : 267/731 places, 310/1241 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32520 ms. Remains : 267/731 places, 310/1241 transitions.
Support contains 62 out of 267 places after structural reductions.
[2024-06-02 05:53:54] [INFO ] Flatten gal took : 76 ms
[2024-06-02 05:53:54] [INFO ] Flatten gal took : 41 ms
[2024-06-02 05:53:54] [INFO ] Input system was already deterministic with 310 transitions.
Support contains 58 out of 267 places (down from 62) after GAL structural reductions.
RANDOM walk for 11675 steps (74 resets) in 634 ms. (18 steps per ms) remains 0/31 properties
Computed a total of 267 stabilizing places and 310 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 267 transition count 310
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!X(p0))) U p0))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 16 are kept as prefixes of interest. Removing 251 places using SCC suffix rule.2 ms
Discarding 251 places :
Also discarding 280 output transitions
Drop transitions (Output transitions of discarded places.) removed 280 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 24
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 11 place count 10 transition count 14
Iterating global reduction 1 with 5 rules applied. Total rules applied 16 place count 10 transition count 14
Applied a total of 16 rules in 34 ms. Remains 10 /267 variables (removed 257) and now considering 14/310 (removed 296) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-06-02 05:53:55] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:53:55] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-02 05:53:55] [INFO ] Invariant cache hit.
[2024-06-02 05:53:55] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-06-02 05:53:55] [INFO ] Redundant transitions in 17 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 7 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-06-02 05:53:55] [INFO ] Computed 0 invariants in 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) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 113 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
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) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/22 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 101 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 222ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/267 places, 12/310 transitions.
Graph (complete) has 4 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 2 ms. Remains 8 /10 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-06-02 05:53:55] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 05:53:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-02 05:53:55] [INFO ] Invariant cache hit.
[2024-06-02 05:53:55] [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 : 8/267 places, 10/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 387 ms. Remains : 8/267 places, 10/310 transitions.
Stuttering acceptance computed with spot in 294 ms :[p0, (NOT p0), true]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-00
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 2 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-00 finished in 769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(p1))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 214 transition count 215
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 214 transition count 215
Applied a total of 106 rules in 21 ms. Remains 214 /267 variables (removed 53) and now considering 215/310 (removed 95) transitions.
// Phase 1: matrix 215 rows 214 cols
[2024-06-02 05:53:56] [INFO ] Computed 1 invariants in 8 ms
[2024-06-02 05:53:56] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-06-02 05:53:56] [INFO ] Invariant cache hit.
[2024-06-02 05:53:56] [INFO ] Implicit Places using invariants and state equation in 346 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 05:53:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 215/429 variables, 214/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/429 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 215 constraints, problems are : Problem set: 0 solved, 214 unsolved in 7686 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/429 variables, 214/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 214/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 429 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9141 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 16898ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 16904ms
Starting structural reductions in LTL mode, iteration 1 : 214/267 places, 215/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17476 ms. Remains : 214/267 places, 215/310 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-01
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 3 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-01 finished in 17667 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 21 are kept as prefixes of interest. Removing 246 places using SCC suffix rule.1 ms
Discarding 246 places :
Also discarding 273 output transitions
Drop transitions (Output transitions of discarded places.) removed 273 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 20 transition count 34
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 13 place count 10 transition count 14
Iterating global reduction 1 with 10 rules applied. Total rules applied 23 place count 10 transition count 14
Applied a total of 23 rules in 4 ms. Remains 10 /267 variables (removed 257) and now considering 14/310 (removed 296) transitions.
// Phase 1: matrix 14 rows 10 cols
[2024-06-02 05:54:13] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 05:54:13] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 05:54:13] [INFO ] Invariant cache hit.
[2024-06-02 05:54:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-02 05:54:14] [INFO ] Redundant transitions in 15 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 7 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-06-02 05:54:14] [INFO ] Computed 0 invariants in 1 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) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 7 unsolved in 121 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
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) 0/20 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/22 variables, and 16 constraints, problems are : Problem set: 0 solved, 7 unsolved in 114 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 240ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 241ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/267 places, 12/310 transitions.
Graph (complete) has 4 edges and 10 vertex of which 8 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Applied a total of 1 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-06-02 05:54:14] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:54:14] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-02 05:54:14] [INFO ] Invariant cache hit.
[2024-06-02 05:54:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/267 places, 10/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 364 ms. Remains : 8/267 places, 10/310 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-02
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-02 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||(F(p0)&&(G(F(!p1))||(F(!p1)&&G(F(p2)))))))))'
Support contains 6 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 216 transition count 218
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 216 transition count 218
Applied a total of 102 rules in 10 ms. Remains 216 /267 variables (removed 51) and now considering 218/310 (removed 92) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-06-02 05:54:14] [INFO ] Computed 1 invariants in 4 ms
[2024-06-02 05:54:14] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-02 05:54:14] [INFO ] Invariant cache hit.
[2024-06-02 05:54:14] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 05:54:14] [INFO ] Invariant cache hit.
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 7888 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
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 9280 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 17220ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 17225ms
Starting structural reductions in LTL mode, iteration 1 : 216/267 places, 218/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17723 ms. Remains : 216/267 places, 218/310 transitions.
Stuttering acceptance computed with spot in 405 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p0)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-03
Stuttering criterion allowed to conclude after 153 steps with 0 reset in 5 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-03 finished in 18173 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F((!p1 U (p2||G(!p1))))))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 27 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.1 ms
Discarding 240 places :
Also discarding 255 output transitions
Drop transitions (Output transitions of discarded places.) removed 255 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 26 transition count 50
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 16 place count 15 transition count 22
Iterating global reduction 1 with 11 rules applied. Total rules applied 27 place count 15 transition count 22
Applied a total of 27 rules in 4 ms. Remains 15 /267 variables (removed 252) and now considering 22/310 (removed 288) transitions.
// Phase 1: matrix 22 rows 15 cols
[2024-06-02 05:54:32] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 05:54:32] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-02 05:54:32] [INFO ] Invariant cache hit.
[2024-06-02 05:54:32] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-02 05:54:32] [INFO ] Redundant transitions in 17 ms returned [2, 15]
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 13 sub problems to find dead transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-06-02 05:54:32] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 4/31 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/33 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 33/35 variables, and 14 constraints, problems are : Problem set: 0 solved, 13 unsolved in 220 ms.
Refiners :[State Equation: 14/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 16/27 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 13/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 4/31 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/33 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/33 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 33/35 variables, and 27 constraints, problems are : Problem set: 0 solved, 13 unsolved in 221 ms.
Refiners :[State Equation: 14/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 447ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 448ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/267 places, 20/310 transitions.
Graph (complete) has 6 edges and 15 vertex of which 13 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 13 /15 variables (removed 2) and now considering 18/20 (removed 2) transitions.
// Phase 1: matrix 18 rows 13 cols
[2024-06-02 05:54:33] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:54:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 05:54:33] [INFO ] Invariant cache hit.
[2024-06-02 05:54:33] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/267 places, 18/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 601 ms. Remains : 13/267 places, 18/310 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-04
Product exploration explored 100000 steps with 10677 reset in 326 ms.
Product exploration explored 100000 steps with 10712 reset in 259 ms.
Computed a total of 13 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 13 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p2) p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 24 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-04 finished in 1487 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 212 transition count 212
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 212 transition count 212
Applied a total of 110 rules in 8 ms. Remains 212 /267 variables (removed 55) and now considering 212/310 (removed 98) transitions.
// Phase 1: matrix 212 rows 212 cols
[2024-06-02 05:54:34] [INFO ] Computed 1 invariants in 3 ms
[2024-06-02 05:54:34] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-06-02 05:54:34] [INFO ] Invariant cache hit.
[2024-06-02 05:54:34] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 412 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-06-02 05:54:34] [INFO ] Invariant cache hit.
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 7585 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
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 8549 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 212/212 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 0/0 constraints]
After SMT, in 16174ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 16177ms
Starting structural reductions in LTL mode, iteration 1 : 212/267 places, 212/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16599 ms. Remains : 212/267 places, 212/310 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-05 finished in 16711 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((X(!p0) U ((X(!p0)&&G(!p1))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G(!p1))||X(G(!p0)))))||(!p2&&(X(!p0) U ((X(!p0)&&G(!p1))||X(G(!p0))))))))))'
Support contains 6 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 216 transition count 218
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 216 transition count 218
Applied a total of 102 rules in 6 ms. Remains 216 /267 variables (removed 51) and now considering 218/310 (removed 92) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-06-02 05:54:50] [INFO ] Computed 1 invariants in 4 ms
[2024-06-02 05:54:50] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-02 05:54:50] [INFO ] Invariant cache hit.
[2024-06-02 05:54:51] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 05:54:51] [INFO ] Invariant cache hit.
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 8106 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
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 9106 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 17249ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 17252ms
Starting structural reductions in LTL mode, iteration 1 : 216/267 places, 218/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17702 ms. Remains : 216/267 places, 218/310 transitions.
Stuttering acceptance computed with spot in 348 ms :[p0, false, p0, (AND p0 p1), false, false, false]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-06
Product exploration explored 100000 steps with 28605 reset in 544 ms.
Product exploration explored 100000 steps with 28588 reset in 701 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)...)
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1 p0)))), (F (G (NOT p2))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 24 factoid took 87 ms. Reduced automaton from 7 states, 32 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-06 finished in 19530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 21 are kept as prefixes of interest. Removing 246 places using SCC suffix rule.2 ms
Discarding 246 places :
Also discarding 268 output transitions
Drop transitions (Output transitions of discarded places.) removed 268 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 20 transition count 32
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 15 place count 15 transition count 20
Iterating global reduction 1 with 5 rules applied. Total rules applied 20 place count 15 transition count 20
Applied a total of 20 rules in 6 ms. Remains 15 /267 variables (removed 252) and now considering 20/310 (removed 290) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-06-02 05:55:10] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 05:55:10] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-02 05:55:10] [INFO ] Invariant cache hit.
[2024-06-02 05:55:10] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-02 05:55:10] [INFO ] Redundant transitions in 15 ms returned [2, 12]
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 13 sub problems to find dead transitions.
// Phase 1: matrix 18 rows 15 cols
[2024-06-02 05:55:10] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 2/31 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/33 variables, and 14 constraints, problems are : Problem set: 0 solved, 13 unsolved in 154 ms.
Refiners :[State Equation: 14/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 15/27 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 13/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 2/29 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 2/31 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/33 variables, and 27 constraints, problems are : Problem set: 0 solved, 13 unsolved in 223 ms.
Refiners :[State Equation: 14/15 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 382ms problems are : Problem set: 0 solved, 13 unsolved
Search for dead transitions found 0 dead transitions in 383ms
Starting structural reductions in SI_LTL mode, iteration 1 : 15/267 places, 18/310 transitions.
Graph (complete) has 7 edges and 15 vertex of which 13 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 3 ms. Remains 13 /15 variables (removed 2) and now considering 16/18 (removed 2) transitions.
// Phase 1: matrix 16 rows 13 cols
[2024-06-02 05:55:10] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 05:55:10] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-02 05:55:10] [INFO ] Invariant cache hit.
[2024-06-02 05:55:10] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/267 places, 16/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 540 ms. Remains : 13/267 places, 16/310 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-07
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-07 finished in 597 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 20 are kept as prefixes of interest. Removing 247 places using SCC suffix rule.1 ms
Discarding 247 places :
Also discarding 276 output transitions
Drop transitions (Output transitions of discarded places.) removed 276 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 19 transition count 31
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 12 place count 10 transition count 13
Iterating global reduction 1 with 9 rules applied. Total rules applied 21 place count 10 transition count 13
Applied a total of 21 rules in 3 ms. Remains 10 /267 variables (removed 257) and now considering 13/310 (removed 297) transitions.
// Phase 1: matrix 13 rows 10 cols
[2024-06-02 05:55:10] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:55:10] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-02 05:55:10] [INFO ] Invariant cache hit.
[2024-06-02 05:55:10] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-02 05:55:10] [INFO ] Redundant transitions in 16 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-06-02 05:55:10] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/22 variables, and 9 constraints, problems are : Problem set: 0 solved, 8 unsolved in 108 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 9/16 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/20 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/22 variables, and 17 constraints, problems are : Problem set: 0 solved, 8 unsolved in 135 ms.
Refiners :[State Equation: 9/10 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 248ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 248ms
Starting structural reductions in SI_LTL mode, iteration 1 : 10/267 places, 12/310 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
[2024-06-02 05:55:11] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:55:11] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-02 05:55:11] [INFO ] Invariant cache hit.
[2024-06-02 05:55:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/267 places, 11/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 375 ms. Remains : 9/267 places, 11/310 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-08
Product exploration explored 100000 steps with 10507 reset in 153 ms.
Product exploration explored 100000 steps with 10561 reset in 197 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)...)
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 23 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-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-08 finished in 834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 214 transition count 215
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 214 transition count 215
Applied a total of 106 rules in 14 ms. Remains 214 /267 variables (removed 53) and now considering 215/310 (removed 95) transitions.
// Phase 1: matrix 215 rows 214 cols
[2024-06-02 05:55:11] [INFO ] Computed 1 invariants in 3 ms
[2024-06-02 05:55:11] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-02 05:55:11] [INFO ] Invariant cache hit.
[2024-06-02 05:55:12] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 05:55:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 215/429 variables, 214/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/429 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 215 constraints, problems are : Problem set: 0 solved, 214 unsolved in 7871 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/429 variables, 214/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 214/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 429 constraints, problems are : Problem set: 0 solved, 214 unsolved in 9006 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 16913ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 16921ms
Starting structural reductions in LTL mode, iteration 1 : 214/267 places, 215/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17358 ms. Remains : 214/267 places, 215/310 transitions.
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-09
Stuttering criterion allowed to conclude after 133 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-09 finished in 17517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||G(p2)||p0)))'
Support contains 6 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 51 places :
Symmetric choice reduction at 0 with 51 rule applications. Total rules 51 place count 216 transition count 218
Iterating global reduction 0 with 51 rules applied. Total rules applied 102 place count 216 transition count 218
Applied a total of 102 rules in 6 ms. Remains 216 /267 variables (removed 51) and now considering 218/310 (removed 92) transitions.
// Phase 1: matrix 218 rows 216 cols
[2024-06-02 05:55:29] [INFO ] Computed 1 invariants in 3 ms
[2024-06-02 05:55:29] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 05:55:29] [INFO ] Invariant cache hit.
[2024-06-02 05:55:29] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2024-06-02 05:55:29] [INFO ] Invariant cache hit.
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 7630 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
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 9001 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 216/216 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints]
After SMT, in 16680ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 16684ms
Starting structural reductions in LTL mode, iteration 1 : 216/267 places, 218/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17204 ms. Remains : 216/267 places, 218/310 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Product exploration explored 100000 steps with 50000 reset in 424 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)...)
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (F (G p1)), (F (G p2)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 13 factoid took 23 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-10 finished in 18336 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 214 transition count 215
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 214 transition count 215
Applied a total of 106 rules in 5 ms. Remains 214 /267 variables (removed 53) and now considering 215/310 (removed 95) transitions.
// Phase 1: matrix 215 rows 214 cols
[2024-06-02 05:55:47] [INFO ] Computed 1 invariants in 2 ms
[2024-06-02 05:55:47] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-02 05:55:47] [INFO ] Invariant cache hit.
[2024-06-02 05:55:48] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 05:55:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 215/429 variables, 214/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 0/429 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 215 constraints, problems are : Problem set: 0 solved, 214 unsolved in 7681 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/213 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/214 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/214 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (OVERLAPS) 215/429 variables, 214/215 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 214/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 429 constraints, problems are : Problem set: 0 solved, 214 unsolved in 8790 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 214/214 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 0/0 constraints]
After SMT, in 16511ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 16514ms
Starting structural reductions in LTL mode, iteration 1 : 214/267 places, 215/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16993 ms. Remains : 214/267 places, 215/310 transitions.
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-11
Entered a terminal (fully accepting) state of product in 380 steps with 3 reset in 5 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-11 finished in 17207 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U X(!p1))) U (G(p3)&&p2)))'
Support contains 8 out of 267 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 218 transition count 221
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 218 transition count 221
Applied a total of 98 rules in 5 ms. Remains 218 /267 variables (removed 49) and now considering 221/310 (removed 89) transitions.
// Phase 1: matrix 221 rows 218 cols
[2024-06-02 05:56:04] [INFO ] Computed 1 invariants in 3 ms
[2024-06-02 05:56:05] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-02 05:56:05] [INFO ] Invariant cache hit.
[2024-06-02 05:56:05] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 478 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2024-06-02 05:56:05] [INFO ] Invariant cache hit.
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 7912 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
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 9423 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 218/218 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 17368ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 17372ms
Starting structural reductions in LTL mode, iteration 1 : 218/267 places, 221/310 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17856 ms. Remains : 218/267 places, 221/310 transitions.
Stuttering acceptance computed with spot in 346 ms :[(OR (NOT p2) (NOT p3)), p1, (NOT p3), p1, p1, true, (AND (NOT p3) 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 0 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-12 finished in 18242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 28 are kept as prefixes of interest. Removing 239 places using SCC suffix rule.1 ms
Discarding 239 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 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 /267 variables (removed 249) and now considering 24/310 (removed 286) transitions.
// Phase 1: matrix 24 rows 18 cols
[2024-06-02 05:56:23] [INFO ] Computed 0 invariants in 1 ms
[2024-06-02 05:56:23] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-02 05:56:23] [INFO ] Invariant cache hit.
[2024-06-02 05:56:23] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2024-06-02 05:56:23] [INFO ] Redundant transitions in 16 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
[2024-06-02 05:56:23] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 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 238 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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 257 ms.
Refiners :[State Equation: 18/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 501ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/267 places, 22/310 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 2 ms. Remains 16 /18 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 16 cols
[2024-06-02 05:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:56:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-02 05:56:23] [INFO ] Invariant cache hit.
[2024-06-02 05:56:23] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/267 places, 20/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 655 ms. Remains : 16/267 places, 20/310 transitions.
Stuttering acceptance computed with spot in 133 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 50 steps with 2 reset in 0 ms.
FORMULA ViralEpidemic-PT-S08D1C2A02-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S08D1C2A02-LTLFireability-13 finished in 804 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 19 are kept as prefixes of interest. Removing 248 places using SCC suffix rule.1 ms
Discarding 248 places :
Also discarding 270 output transitions
Drop transitions (Output transitions of discarded places.) removed 270 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 4 ms. Remains 7 /267 variables (removed 260) and now considering 11/310 (removed 299) transitions.
// Phase 1: matrix 11 rows 7 cols
[2024-06-02 05:56:23] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:56:23] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-02 05:56:23] [INFO ] Invariant cache hit.
[2024-06-02 05:56:23] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-02 05:56:23] [INFO ] Redundant transitions in 13 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-06-02 05:56:23] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 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 75 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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 76 ms.
Refiners :[State Equation: 6/7 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 156ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 156ms
Starting structural reductions in SI_LTL mode, iteration 1 : 7/267 places, 10/310 transitions.
Graph (complete) has 2 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 6 /7 variables (removed 1) and now considering 9/10 (removed 1) transitions.
// Phase 1: matrix 9 rows 6 cols
[2024-06-02 05:56:24] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:56:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-02 05:56:24] [INFO ] Invariant cache hit.
[2024-06-02 05:56:24] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/267 places, 9/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 266 ms. Remains : 6/267 places, 9/310 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S08D1C2A02-LTLFireability-14
Product exploration explored 100000 steps with 11557 reset in 79 ms.
Product exploration explored 100000 steps with 11551 reset in 92 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)...)
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 15 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 535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G((F(!p0)&&p1)))))'
Support contains 4 out of 267 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 267/267 places, 310/310 transitions.
Graph (complete) has 166 edges and 267 vertex of which 34 are kept as prefixes of interest. Removing 233 places using SCC suffix rule.1 ms
Discarding 233 places :
Also discarding 246 output transitions
Drop transitions (Output transitions of discarded places.) removed 246 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 33 transition count 59
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 20 place count 18 transition count 25
Iterating global reduction 1 with 15 rules applied. Total rules applied 35 place count 18 transition count 25
Applied a total of 35 rules in 5 ms. Remains 18 /267 variables (removed 249) and now considering 25/310 (removed 285) transitions.
// Phase 1: matrix 25 rows 18 cols
[2024-06-02 05:56:24] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:56:24] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-02 05:56:24] [INFO ] Invariant cache hit.
[2024-06-02 05:56:24] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-02 05:56:24] [INFO ] Redundant transitions in 17 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
[2024-06-02 05:56:24] [INFO ] Computed 0 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 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 190 ms.
Refiners :[State Equation: 17/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/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 216 ms.
Refiners :[State Equation: 17/18 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 410ms problems are : Problem set: 0 solved, 14 unsolved
Search for dead transitions found 0 dead transitions in 410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 18/267 places, 22/310 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 3 ms. Remains 15 /18 variables (removed 3) and now considering 19/22 (removed 3) transitions.
// Phase 1: matrix 19 rows 15 cols
[2024-06-02 05:56:24] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 05:56:24] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 05:56:24] [INFO ] Invariant cache hit.
[2024-06-02 05:56:24] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/267 places, 19/310 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 606 ms. Remains : 15/267 places, 19/310 transitions.
Stuttering acceptance computed with spot in 88 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 8208 reset in 120 ms.
Product exploration explored 100000 steps with 8171 reset in 127 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)...)
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 18 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 1011 ms.
All properties solved by simple procedures.
Total runtime 184394 ms.
ITS solved all properties within timeout

BK_STOP 1717307785731

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ViralEpidemic-PT-S08D1C2A02"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r544-smll-171701111400380"
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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;