Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915590800963.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is ViralEpidemic-PT-S03D1C1A08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915590800963
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 29M
-rw-r--r-- 1 mcc users 7.6K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 11 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 29M May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749296884572

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ViralEpidemic-PT-S03D1C1A08
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-07 11:48:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-07 11:48:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-07 11:48:07] [INFO ] Load time of PNML (sax parser for PT used): 1506 ms
[2025-06-07 11:48:07] [INFO ] Transformed 49206 places.
[2025-06-07 11:48:08] [INFO ] Transformed 68887 transitions.
[2025-06-07 11:48:08] [INFO ] Found NUPN structural information;
[2025-06-07 11:48:08] [INFO ] Parsed PT model containing 49206 places and 68887 transitions and 157456 arcs in 1952 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 320 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 11:48:36] [INFO ] Invariants computation overflowed in 27327 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:49:13] [INFO ] Performed 9390/49206 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 11:49:43] [INFO ] Performed 23591/49206 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-07 11:50:13] [INFO ] Performed 37820/49206 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-07 11:50:39] [INFO ] Implicit Places using invariants in 150144 ms returned []
Implicit Place search using SMT only with invariants took 150199 ms to find 0 implicit places.
Running 68886 sub problems to find dead transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 11:51:02] [INFO ] Invariants computation overflowed in 22808 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 480485ms, After SMT, problems are : Problem set: 0 solved, 68886 unsolved
Search for dead transitions found 0 dead transitions in 480735ms
Finished structural reductions in LTL mode , in 1 iterations and 631487 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Support contains 14 out of 49206 places after structural reductions.
[2025-06-07 11:58:42] [INFO ] Flatten gal took : 1919 ms
[2025-06-07 11:58:44] [INFO ] Flatten gal took : 1652 ms
[2025-06-07 11:58:46] [INFO ] Input system was already deterministic with 68887 transitions.
RANDOM walk for 40000 steps (256 resets) in 14320 ms. (2 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 10125 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 10313 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (13 resets) in 10180 ms. (3 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (10 resets) in 9674 ms. (4 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (11 resets) in 9683 ms. (4 steps per ms) remains 5/5 properties
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 11:59:28] [INFO ] Invariants computation overflowed in 24258 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 32/42 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 122/164 variables, 48/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 144/308 variables, 54/170 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 54/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 268/576 variables, 94/318 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 94/412 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 488/1064 variables, 170/582 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1064 variables, 170/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1064 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 803/1867 variables, 282/1034 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1867 variables, 282/1316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1867 variables, 0/1316 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 1445/3312 variables, 506/1822 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3312 variables, 506/2328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3312 variables, 0/2328 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 2295/5607 variables, 810/3138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/5607 variables, 810/3948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/5607 variables, 0/3948 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (OVERLAPS) 4011/9618 variables, 1421/5369 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/9618 variables, 1421/6790 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 9618/118093 variables, and 6790 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5010 ms.
Refiners :[Domain max(s): 3395/49206 constraints, State Equation: 3395/49206 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 32/42 variables, 10/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 122/164 variables, 48/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/164 variables, 48/116 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/164 variables, 5/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 144/308 variables, 54/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 54/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 268/576 variables, 94/323 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 94/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 488/1064 variables, 170/587 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1064 variables, 170/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1064 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 803/1867 variables, 282/1039 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1867 variables, 282/1321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1867 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SMT process timed out in 34606ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 55 ms.
Support contains 10 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 100 are kept as prefixes of interest. Removing 49106 places using SCC suffix rule.51 ms
Discarding 49106 places :
Also discarding 68629 output transitions
Drop transitions (Output transitions of discarded places.) removed 68629 transitions
Drop transitions (Empty/Sink Transition effects.) removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 209 rules applied. Total rules applied 210 place count 100 transition count 49
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 253 place count 57 transition count 49
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 253 place count 57 transition count 43
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 265 place count 51 transition count 43
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 279 place count 37 transition count 29
Iterating global reduction 2 with 14 rules applied. Total rules applied 293 place count 37 transition count 29
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 313 place count 27 transition count 19
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 314 place count 26 transition count 18
Ensure Unique test removed 4 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 318 place count 22 transition count 18
Applied a total of 318 rules in 209 ms. Remains 22 /49206 variables (removed 49184) and now considering 18/68887 (removed 68869) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 209 ms. Remains : 22/49206 places, 18/68887 transitions.
RANDOM walk for 77 steps (2 resets) in 5 ms. (12 steps per ms) remains 0/5 properties
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 74 are kept as prefixes of interest. Removing 49132 places using SCC suffix rule.167 ms
Discarding 49132 places :
Also discarding 68751 output transitions
Drop transitions (Output transitions of discarded places.) removed 68751 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 73 transition count 125
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 36 place count 48 transition count 65
Iterating global reduction 1 with 25 rules applied. Total rules applied 61 place count 48 transition count 65
Graph (complete) has 27 edges and 48 vertex of which 47 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 62 place count 47 transition count 64
Applied a total of 62 rules in 254 ms. Remains 47 /49206 variables (removed 49159) and now considering 64/68887 (removed 68823) transitions.
// Phase 1: matrix 64 rows 47 cols
[2025-06-07 11:59:39] [INFO ] Computed 0 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-07 11:59:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:39] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 11:59:39] [INFO ] Redundant transitions in 17 ms returned [11, 24, 62]
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 47 sub problems to find dead transitions.
// Phase 1: matrix 61 rows 47 cols
[2025-06-07 11:59:39] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 57/100 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 4/104 variables, 2/45 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 2/108 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/108 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/108 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 108/108 variables, and 47 constraints, problems are : Problem set: 0 solved, 47 unsolved in 914 ms.
Refiners :[State Equation: 47/47 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 57/100 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 47/90 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 4/104 variables, 2/92 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 2/106 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 2/108 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/108 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/108 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 108/108 variables, and 94 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1161 ms.
Refiners :[State Equation: 47/47 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2082ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2083ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/49206 places, 61/68887 transitions.
Graph (complete) has 26 edges and 47 vertex of which 44 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 5 ms. Remains 44 /47 variables (removed 3) and now considering 58/61 (removed 3) transitions.
// Phase 1: matrix 58 rows 44 cols
[2025-06-07 11:59:41] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:41] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-07 11:59:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:41] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/49206 places, 58/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2517 ms. Remains : 44/49206 places, 58/68887 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00
Stuttering criterion allowed to conclude after 662 steps with 25 reset in 10 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-00 finished in 2823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G(p1))))'
Support contains 4 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 123 are kept as prefixes of interest. Removing 49083 places using SCC suffix rule.35 ms
Discarding 49083 places :
Also discarding 68657 output transitions
Drop transitions (Output transitions of discarded places.) removed 68657 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 122 transition count 215
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 52 place count 85 transition count 122
Iterating global reduction 1 with 37 rules applied. Total rules applied 89 place count 85 transition count 122
Applied a total of 89 rules in 99 ms. Remains 85 /49206 variables (removed 49121) and now considering 122/68887 (removed 68765) transitions.
// Phase 1: matrix 122 rows 85 cols
[2025-06-07 11:59:42] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:42] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-07 11:59:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:42] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 11:59:42] [INFO ] Redundant transitions in 19 ms returned [9, 14, 22, 46, 62, 82, 106, 115]
Found 8 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 8 transitions
Redundant transitions reduction (with SMT) removed 8 transitions.
Running 92 sub problems to find dead transitions.
// Phase 1: matrix 114 rows 85 cols
[2025-06-07 11:59:42] [INFO ] Computed 0 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 110/191 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 4/195 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 2/197 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 2/199 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/199 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 85 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2553 ms.
Refiners :[State Equation: 85/85 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 110/191 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/191 variables, 92/173 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/191 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 4/195 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 2/197 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 2/199 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/199 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 177 constraints, problems are : Problem set: 0 solved, 92 unsolved in 3342 ms.
Refiners :[State Equation: 85/85 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5905ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 5907ms
Starting structural reductions in SI_LTL mode, iteration 1 : 85/49206 places, 114/68887 transitions.
Graph (complete) has 50 edges and 85 vertex of which 77 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 3 ms. Remains 77 /85 variables (removed 8) and now considering 106/114 (removed 8) transitions.
// Phase 1: matrix 106 rows 77 cols
[2025-06-07 11:59:48] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-07 11:59:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 11:59:48] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 77/49206 places, 106/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6223 ms. Remains : 77/49206 places, 106/68887 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02
Stuttering criterion allowed to conclude after 1684 steps with 38 reset in 12 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-02 finished in 6405 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 1 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 170 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:00:09] [INFO ] Invariants computation overflowed in 21207 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:00:47] [INFO ] Performed 9191/49206 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 12:01:17] [INFO ] Performed 22831/49206 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-07 12:01:47] [INFO ] Performed 35248/49206 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-07 12:02:17] [INFO ] Implicit Places using invariants in 149314 ms returned []
Implicit Place search using SMT only with invariants took 149317 ms to find 0 implicit places.
Running 68886 sub problems to find dead transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:02:39] [INFO ] Invariants computation overflowed in 21285 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 470721ms, After SMT, problems are : Problem set: 0 solved, 68886 unsolved
Search for dead transitions found 0 dead transitions in 470947ms
Finished structural reductions in LTL mode , in 1 iterations and 620555 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 13 ms.
FORMULA ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ViralEpidemic-PT-S03D1C1A08-LTLCardinality-04 finished in 620890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 125 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:10:38] [INFO ] Invariants computation overflowed in 29312 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:11:16] [INFO ] Performed 7542/49206 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 12:11:46] [INFO ] Performed 16436/49206 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-07 12:12:16] [INFO ] Performed 25975/49206 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-07 12:12:46] [INFO ] Performed 37468/49206 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2025-06-07 12:12:46] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2025-06-07 12:12:46] [INFO ] Implicit Places using invariants in 157082 ms returned []
Implicit Place search using SMT only with invariants took 157083 ms to find 0 implicit places.
Running 68886 sub problems to find dead transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:13:09] [INFO ] Invariants computation overflowed in 22403 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 468148ms, After SMT, problems are : Problem set: 0 solved, 68886 unsolved
Search for dead transitions found 0 dead transitions in 468360ms
Finished structural reductions in LTL mode , in 1 iterations and 625691 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ViralEpidemic-PT-S03D1C1A08-LTLCardinality-05
Product exploration timeout after 34180 steps with 231 reset in 10003 ms.
Product exploration timeout after 26110 steps with 175 reset in 10001 ms.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (278 resets) in 12867 ms. (3 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (17 resets) in 11282 ms. (3 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 28803 steps, run timeout after 18012 ms. (steps per millisecond=1 ) properties seen :0 out of 1
Probabilistic random walk after 28803 steps, saw 27997 distinct states, run finished after 18018 ms. (steps per millisecond=1 ) properties seen :0
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:28:30] [INFO ] Invariants computation overflowed in 25967 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/27 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/46 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 46/92 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/166 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 138/304 variables, 48/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/304 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/304 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 222/526 variables, 78/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 78/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 414/940 variables, 144/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/940 variables, 144/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/940 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 666/1606 variables, 234/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1606 variables, 234/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1606 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1234/2840 variables, 431/1557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2840 variables, 431/1988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2840 variables, 0/1988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1958/4798 variables, 689/2677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4798 variables, 689/3366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4798 variables, 0/3366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 3612/8410 variables, 1263/4629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/8410 variables, 1263/5892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/8410 variables, 0/5892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 5652/14062 variables, 2007/7899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/14062 variables, 2007/9906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/14062 variables, 0/9906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 31501ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 24 are kept as prefixes of interest. Removing 49182 places using SCC suffix rule.39 ms
Discarding 49182 places :
Also discarding 68826 output transitions
Drop transitions (Output transitions of discarded places.) removed 68826 transitions
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 24 transition count 9
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 66 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 10 transition count 8
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 7 transition count 5
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 6 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 5 transition count 3
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 4 transition count 3
Applied a total of 78 rules in 177 ms. Remains 4 /49206 variables (removed 49202) and now considering 3/68887 (removed 68884) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 4/49206 places, 3/68887 transitions.
RANDOM walk for 16 steps (2 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 215 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:29:03] [INFO ] Invariants computation overflowed in 26214 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-07 12:29:39] [INFO ] Performed 5652/49206 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-07 12:30:09] [INFO ] Performed 14542/49206 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-07 12:30:39] [INFO ] Performed 26160/49206 implicitness test of which 0 returned IMPLICIT in 90 seconds.
[2025-06-07 12:31:09] [INFO ] Performed 37968/49206 implicitness test of which 0 returned IMPLICIT in 120 seconds.
[2025-06-07 12:31:09] [INFO ] Timeout of Implicit test with SMT after 120 seconds.
[2025-06-07 12:31:09] [INFO ] Implicit Places using invariants in 152713 ms returned []
Implicit Place search using SMT only with invariants took 152716 ms to find 0 implicit places.
Running 68886 sub problems to find dead transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:31:42] [INFO ] Invariants computation overflowed in 32486 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
SMT process timed out in 501269ms, After SMT, problems are : Problem set: 0 solved, 68886 unsolved
Search for dead transitions found 0 dead transitions in 501498ms
Finished structural reductions in LTL mode , in 1 iterations and 654531 ms. Remains : 49206/49206 places, 68887/68887 transitions.
Computed a total of 49206 stabilizing places and 68887 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 49206 transition count 68887
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (275 resets) in 13550 ms. (2 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 11078 ms. (3 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 29310 steps, run timeout after 18007 ms. (steps per millisecond=1 ) properties seen :0 out of 1
Probabilistic random walk after 29310 steps, saw 28488 distinct states, run finished after 18008 ms. (steps per millisecond=1 ) properties seen :0
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:46:55] [INFO ] Invariants computation overflowed in 25744 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 6/8 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/27 variables, 8/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 19/46 variables, 7/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/46 variables, 7/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/46 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 46/92 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/92 variables, 16/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/166 variables, 26/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/166 variables, 26/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/166 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 138/304 variables, 48/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/304 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/304 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 222/526 variables, 78/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 78/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 414/940 variables, 144/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/940 variables, 144/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/940 variables, 0/658 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 666/1606 variables, 234/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1606 variables, 234/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1606 variables, 0/1126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 1234/2840 variables, 431/1557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2840 variables, 431/1988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2840 variables, 0/1988 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 1958/4798 variables, 689/2677 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/4798 variables, 689/3366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/4798 variables, 0/3366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (OVERLAPS) 3612/8410 variables, 1263/4629 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/8410 variables, 1263/5892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/8410 variables, 0/5892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 5652/14062 variables, 2007/7899 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 30895ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 24 are kept as prefixes of interest. Removing 49182 places using SCC suffix rule.14 ms
Discarding 49182 places :
Also discarding 68826 output transitions
Drop transitions (Output transitions of discarded places.) removed 68826 transitions
Drop transitions (Empty/Sink Transition effects.) removed 39 transitions
Reduce isomorphic transitions removed 39 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 52 rules applied. Total rules applied 53 place count 24 transition count 9
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 66 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 10 transition count 8
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 71 place count 7 transition count 5
Iterating global reduction 2 with 3 rules applied. Total rules applied 74 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 6 transition count 4
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 77 place count 5 transition count 3
Ensure Unique test removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 4 transition count 3
Applied a total of 78 rules in 62 ms. Remains 4 /49206 variables (removed 49202) and now considering 3/68887 (removed 68884) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 4/49206 places, 3/68887 transitions.
RANDOM walk for 16 steps (2 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 32760 steps with 220 reset in 10001 ms.
Product exploration timeout after 24800 steps with 174 reset in 10003 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Graph (complete) has 29523 edges and 49206 vertex of which 77 are kept as prefixes of interest. Removing 49129 places using SCC suffix rule.35 ms
Discarding 49129 places :
Also discarding 68748 output transitions
Drop transitions (Output transitions of discarded places.) removed 68748 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 77 transition count 135
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 30 place count 52 transition count 72
Iterating global reduction 1 with 25 rules applied. Total rules applied 55 place count 52 transition count 72
Graph (complete) has 33 edges and 52 vertex of which 51 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
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 51 transition count 71
Applied a total of 56 rules in 100 ms. Remains 51 /49206 variables (removed 49155) and now considering 71/68887 (removed 68816) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-07 12:47:21] [INFO ] Redundant transitions in 20 ms returned [7, 23, 27, 56, 66, 69]
Found 6 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT only with invariants) removed 6 transitions
Redundant transitions reduction (with SMT) removed 6 transitions.
Running 56 sub problems to find dead transitions.
// Phase 1: matrix 65 rows 51 cols
[2025-06-07 12:47:21] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 65/115 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (OVERLAPS) 1/116 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (OVERLAPS) 0/116 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 116/116 variables, and 51 constraints, problems are : Problem set: 0 solved, 56 unsolved in 653 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 1 (OVERLAPS) 65/115 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 56/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/116 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 56 unsolved
At refinement iteration 6 (OVERLAPS) 0/116 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Int declared 116/116 variables, and 107 constraints, problems are : Problem set: 0 solved, 56 unsolved in 874 ms.
Refiners :[State Equation: 51/51 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1535ms problems are : Problem set: 0 solved, 56 unsolved
Search for dead transitions found 0 dead transitions in 1535ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/49206 places, 65/68887 transitions.
Graph (complete) has 32 edges and 51 vertex of which 45 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Applied a total of 1 rules in 2 ms. Remains 45 /51 variables (removed 6) and now considering 59/65 (removed 6) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/49206 places, 59/68887 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1664 ms. Remains : 45/49206 places, 59/68887 transitions.
Built C files in :
/tmp/ltsmin16855000506478033866
[2025-06-07 12:47:23] [INFO ] Built C files in 609ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16855000506478033866
Running compilation step : cd /tmp/ltsmin16855000506478033866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16855000506478033866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16855000506478033866;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 49206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49206/49206 places, 68887/68887 transitions.
Applied a total of 0 rules in 193 ms. Remains 49206 /49206 variables (removed 0) and now considering 68887/68887 (removed 0) transitions.
// Phase 1: matrix 68887 rows 49206 cols
[2025-06-07 12:47:57] [INFO ] Invariants computation overflowed in 30045 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ViralEpidemic-PT-S03D1C1A08, 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 r240-tall-174915590800963"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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