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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
396.331 132928.00 168300.00 519.70 FTFFFTFFFTFFFFTT 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-171701111400355.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-S04D1C1A03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111400355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 836K
-rw-r--r-- 1 mcc users 8.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 19 07:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 04:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 04:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 04:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 141K Apr 12 04:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 11 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 284K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-00
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-01
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-02
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-03
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-04
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-05
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-06
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-07
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-08
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-09
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-10
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-11
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-12
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-13
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-14
FORMULA_NAME ViralEpidemic-PT-S04D1C1A03-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717302506963

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S04D1C1A03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 04:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 04:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 04:28:29] [INFO ] Load time of PNML (sax parser for PT used): 233 ms
[2024-06-02 04:28:29] [INFO ] Transformed 511 places.
[2024-06-02 04:28:29] [INFO ] Transformed 765 transitions.
[2024-06-02 04:28:29] [INFO ] Found NUPN structural information;
[2024-06-02 04:28:29] [INFO ] Parsed PT model containing 511 places and 765 transitions and 1785 arcs in 448 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 511 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 511/511 places, 765/765 transitions.
Discarding 255 places :
Symmetric choice reduction at 0 with 255 rule applications. Total rules 255 place count 256 transition count 263
Iterating global reduction 0 with 255 rules applied. Total rules applied 510 place count 256 transition count 263
Applied a total of 510 rules in 116 ms. Remains 256 /511 variables (removed 255) and now considering 263/765 (removed 502) transitions.
// Phase 1: matrix 263 rows 256 cols
[2024-06-02 04:28:29] [INFO ] Computed 1 invariants in 52 ms
[2024-06-02 04:28:30] [INFO ] Implicit Places using invariants in 619 ms returned []
[2024-06-02 04:28:30] [INFO ] Invariant cache hit.
[2024-06-02 04:28:30] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2024-06-02 04:28:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 263/519 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 0/519 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 519/519 variables, and 257 constraints, problems are : Problem set: 0 solved, 262 unsolved in 11099 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 263/519 variables, 256/257 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/519 variables, 262/519 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/519 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 0/519 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 519/519 variables, and 519 constraints, problems are : Problem set: 0 solved, 262 unsolved in 12608 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints]
After SMT, in 23875ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 23902ms
Starting structural reductions in LTL mode, iteration 1 : 256/511 places, 263/765 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25190 ms. Remains : 256/511 places, 263/765 transitions.
Support contains 26 out of 256 places after structural reductions.
[2024-06-02 04:28:55] [INFO ] Flatten gal took : 78 ms
[2024-06-02 04:28:55] [INFO ] Flatten gal took : 36 ms
[2024-06-02 04:28:55] [INFO ] Input system was already deterministic with 263 transitions.
RANDOM walk for 6512 steps (81 resets) in 528 ms. (12 steps per ms) remains 0/16 properties
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 256 stabilizing places and 263 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 256 transition count 263
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||F(G(p1))))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 263/263 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 238 transition count 243
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 238 transition count 243
Applied a total of 36 rules in 13 ms. Remains 238 /256 variables (removed 18) and now considering 243/263 (removed 20) transitions.
// Phase 1: matrix 243 rows 238 cols
[2024-06-02 04:28:55] [INFO ] Computed 1 invariants in 8 ms
[2024-06-02 04:28:55] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-06-02 04:28:55] [INFO ] Invariant cache hit.
[2024-06-02 04:28:56] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
Running 242 sub problems to find dead transitions.
[2024-06-02 04:28:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 243/481 variables, 238/239 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (OVERLAPS) 0/481 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/481 variables, and 239 constraints, problems are : Problem set: 0 solved, 242 unsolved in 9445 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 242 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 3 (OVERLAPS) 243/481 variables, 238/239 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 242/481 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 242 unsolved
At refinement iteration 6 (OVERLAPS) 0/481 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 242 unsolved
No progress, stopping.
After SMT solving in domain Int declared 481/481 variables, and 481 constraints, problems are : Problem set: 0 solved, 242 unsolved in 10845 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 242/242 constraints, Known Traps: 0/0 constraints]
After SMT, in 20355ms problems are : Problem set: 0 solved, 242 unsolved
Search for dead transitions found 0 dead transitions in 20361ms
Starting structural reductions in LTL mode, iteration 1 : 238/256 places, 243/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20889 ms. Remains : 238/256 places, 243/263 transitions.
Stuttering acceptance computed with spot in 357 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLCardinality-00
Stuttering criterion allowed to conclude after 2135 steps with 32 reset in 30 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLCardinality-00 finished in 21360 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' '!((p0 U X(G(!p0))))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 263/263 transitions.
Graph (complete) has 162 edges and 256 vertex of which 24 are kept as prefixes of interest. Removing 232 places using SCC suffix rule.3 ms
Discarding 232 places :
Also discarding 229 output transitions
Drop transitions (Output transitions of discarded places.) removed 229 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 23 transition count 32
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 19 transition count 24
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 24
Applied a total of 10 rules in 28 ms. Remains 19 /256 variables (removed 237) and now considering 24/263 (removed 239) transitions.
// Phase 1: matrix 24 rows 19 cols
[2024-06-02 04:29:17] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 04:29:17] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-06-02 04:29:17] [INFO ] Invariant cache hit.
[2024-06-02 04:29:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-06-02 04:29:17] [INFO ] Redundant transitions in 21 ms returned [13, 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 16 sub problems to find dead transitions.
// Phase 1: matrix 22 rows 19 cols
[2024-06-02 04:29:17] [INFO ] Computed 0 invariants in 12 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 19/35 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 2/39 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 2/41 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/41 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/41 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 19 constraints, problems are : Problem set: 0 solved, 16 unsolved in 269 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 19/35 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 16/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 2/37 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 2/39 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 2/41 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 16 unsolved in 344 ms.
Refiners :[State Equation: 19/19 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 629ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 629ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/256 places, 22/263 transitions.
Graph (complete) has 11 edges and 19 vertex of which 17 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 17 /19 variables (removed 2) and now considering 20/22 (removed 2) transitions.
// Phase 1: matrix 20 rows 17 cols
[2024-06-02 04:29:17] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 04:29:17] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-02 04:29:17] [INFO ] Invariant cache hit.
[2024-06-02 04:29:17] [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.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/256 places, 20/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 842 ms. Remains : 17/256 places, 20/263 transitions.
Stuttering acceptance computed with spot in 94 ms :[p0, true, p0]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLCardinality-07 finished in 1091 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 263/263 transitions.
Graph (complete) has 162 edges and 256 vertex of which 16 are kept as prefixes of interest. Removing 240 places using SCC suffix rule.1 ms
Discarding 240 places :
Also discarding 238 output transitions
Drop transitions (Output transitions of discarded places.) removed 238 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 15 transition count 22
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 7 place count 11 transition count 14
Iterating global reduction 1 with 4 rules applied. Total rules applied 11 place count 11 transition count 14
Applied a total of 11 rules in 5 ms. Remains 11 /256 variables (removed 245) and now considering 14/263 (removed 249) transitions.
// Phase 1: matrix 14 rows 11 cols
[2024-06-02 04:29:18] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 04:29:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-02 04:29:18] [INFO ] Invariant cache hit.
[2024-06-02 04:29:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-06-02 04:29:18] [INFO ] Redundant transitions in 15 ms returned [2]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 13 rows 11 cols
[2024-06-02 04:29:18] [INFO ] Computed 0 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2/20 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 2/22 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/22 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/24 variables, and 10 constraints, problems are : Problem set: 0 solved, 8 unsolved in 114 ms.
Refiners :[State Equation: 10/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 10/18 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 2/20 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 2/22 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/22 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/24 variables, and 18 constraints, problems are : Problem set: 0 solved, 8 unsolved in 149 ms.
Refiners :[State Equation: 10/11 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 267ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 268ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/256 places, 13/263 transitions.
Graph (complete) has 4 edges and 11 vertex of which 10 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Applied a total of 1 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 10 cols
[2024-06-02 04:29:18] [INFO ] Computed 0 invariants in 0 ms
[2024-06-02 04:29:18] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-02 04:29:18] [INFO ] Invariant cache hit.
[2024-06-02 04:29:18] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/256 places, 12/263 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 405 ms. Remains : 10/256 places, 12/263 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLCardinality-08
Stuttering criterion allowed to conclude after 17 steps with 1 reset in 0 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLCardinality-08 finished in 510 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(p0)))||(X(p0)&&F(p1))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 236 transition count 235
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 236 transition count 235
Applied a total of 40 rules in 7 ms. Remains 236 /256 variables (removed 20) and now considering 235/263 (removed 28) transitions.
// Phase 1: matrix 235 rows 236 cols
[2024-06-02 04:29:18] [INFO ] Computed 1 invariants in 6 ms
[2024-06-02 04:29:18] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-02 04:29:18] [INFO ] Invariant cache hit.
[2024-06-02 04:29:19] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 461 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-02 04:29:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 235/471 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 0/471 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 237 constraints, problems are : Problem set: 0 solved, 234 unsolved in 8581 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/471 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 234/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/471 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 471 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10310 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 18936ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 18940ms
Starting structural reductions in LTL mode, iteration 1 : 236/256 places, 235/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19411 ms. Remains : 236/256 places, 235/263 transitions.
Stuttering acceptance computed with spot in 290 ms :[true, (NOT p1), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLCardinality-10 finished in 19730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||((!p0 U (p1||G(!p0))) U X(p2))))'
Support contains 6 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 263/263 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 239 transition count 238
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 239 transition count 238
Applied a total of 34 rules in 8 ms. Remains 239 /256 variables (removed 17) and now considering 238/263 (removed 25) transitions.
// Phase 1: matrix 238 rows 239 cols
[2024-06-02 04:29:38] [INFO ] Computed 1 invariants in 5 ms
[2024-06-02 04:29:38] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-06-02 04:29:38] [INFO ] Invariant cache hit.
[2024-06-02 04:29:38] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 237 sub problems to find dead transitions.
[2024-06-02 04:29:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 238/477 variables, 239/240 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (OVERLAPS) 0/477 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Real declared 477/477 variables, and 240 constraints, problems are : Problem set: 0 solved, 237 unsolved in 8924 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 237 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (OVERLAPS) 238/477 variables, 239/240 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 237/477 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 6 (OVERLAPS) 0/477 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 237 unsolved
No progress, stopping.
After SMT solving in domain Int declared 477/477 variables, and 477 constraints, problems are : Problem set: 0 solved, 237 unsolved in 10193 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 0/0 constraints]
After SMT, in 19159ms problems are : Problem set: 0 solved, 237 unsolved
Search for dead transitions found 0 dead transitions in 19163ms
Starting structural reductions in LTL mode, iteration 1 : 239/256 places, 238/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19697 ms. Remains : 239/256 places, 238/263 transitions.
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p0), false, (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLCardinality-11
Stuttering criterion allowed to conclude after 115 steps with 1 reset in 3 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLCardinality-11 finished in 20089 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((F(p1)&&p0))))'
Support contains 3 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 236 transition count 235
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 236 transition count 235
Applied a total of 40 rules in 7 ms. Remains 236 /256 variables (removed 20) and now considering 235/263 (removed 28) transitions.
// Phase 1: matrix 235 rows 236 cols
[2024-06-02 04:29:58] [INFO ] Computed 1 invariants in 4 ms
[2024-06-02 04:29:58] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-02 04:29:58] [INFO ] Invariant cache hit.
[2024-06-02 04:29:58] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-02 04:29:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 235/471 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 0/471 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 237 constraints, problems are : Problem set: 0 solved, 234 unsolved in 8837 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/471 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 234/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/471 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 471 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10090 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 18964ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 18968ms
Starting structural reductions in LTL mode, iteration 1 : 236/256 places, 235/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19426 ms. Remains : 236/256 places, 235/263 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLCardinality-13
Stuttering criterion allowed to conclude after 97 steps with 1 reset in 2 ms.
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLCardinality-13 finished in 19585 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 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 236 transition count 235
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 236 transition count 235
Applied a total of 40 rules in 9 ms. Remains 236 /256 variables (removed 20) and now considering 235/263 (removed 28) transitions.
// Phase 1: matrix 235 rows 236 cols
[2024-06-02 04:30:17] [INFO ] Computed 1 invariants in 4 ms
[2024-06-02 04:30:18] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-06-02 04:30:18] [INFO ] Invariant cache hit.
[2024-06-02 04:30:18] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2024-06-02 04:30:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 235/471 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (OVERLAPS) 0/471 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 471/471 variables, and 237 constraints, problems are : Problem set: 0 solved, 234 unsolved in 9303 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 235/471 variables, 236/237 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/471 variables, 234/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/471 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (OVERLAPS) 0/471 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 471/471 variables, and 471 constraints, problems are : Problem set: 0 solved, 234 unsolved in 10212 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 236/236 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints]
After SMT, in 19551ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 19554ms
Starting structural reductions in LTL mode, iteration 1 : 236/256 places, 235/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20085 ms. Remains : 236/256 places, 235/263 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ViralEpidemic-PT-S04D1C1A03-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 560 ms.
Product exploration explored 100000 steps with 50000 reset in 590 ms.
Computed a total of 236 stabilizing places and 235 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 236 transition count 235
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 (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 21 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ViralEpidemic-PT-S04D1C1A03-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ViralEpidemic-PT-S04D1C1A03-LTLCardinality-14 finished in 21550 ms.
All properties solved by simple procedures.
Total runtime 130720 ms.
ITS solved all properties within timeout

BK_STOP 1717302639891

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-S04D1C1A03"
export BK_EXAMINATION="LTLCardinality"
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-S04D1C1A03, examination is LTLCardinality"
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-171701111400355"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ViralEpidemic-PT-S04D1C1A03.tgz
mv ViralEpidemic-PT-S04D1C1A03 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;