Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876523800043.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 Medical-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876523800043
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M May 29 14:32 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 Medical-PT-12-LTLCardinality-00
FORMULA_NAME Medical-PT-12-LTLCardinality-01
FORMULA_NAME Medical-PT-12-LTLCardinality-02
FORMULA_NAME Medical-PT-12-LTLCardinality-03
FORMULA_NAME Medical-PT-12-LTLCardinality-04
FORMULA_NAME Medical-PT-12-LTLCardinality-05
FORMULA_NAME Medical-PT-12-LTLCardinality-06
FORMULA_NAME Medical-PT-12-LTLCardinality-07
FORMULA_NAME Medical-PT-12-LTLCardinality-08
FORMULA_NAME Medical-PT-12-LTLCardinality-09
FORMULA_NAME Medical-PT-12-LTLCardinality-10
FORMULA_NAME Medical-PT-12-LTLCardinality-11
FORMULA_NAME Medical-PT-12-LTLCardinality-12
FORMULA_NAME Medical-PT-12-LTLCardinality-13
FORMULA_NAME Medical-PT-12-LTLCardinality-14
FORMULA_NAME Medical-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1748800441426

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Medical-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 17:54:03] [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-01 17:54:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 17:54:05] [INFO ] Load time of PNML (sax parser for PT used): 817 ms
[2025-06-01 17:54:05] [INFO ] Transformed 312 places.
[2025-06-01 17:54:05] [INFO ] Transformed 5431 transitions.
[2025-06-01 17:54:05] [INFO ] Parsed PT model containing 312 places and 5431 transitions and 28790 arcs in 1070 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 242 places in 50 ms
Reduce places removed 242 places and 5204 transitions.
Reduce places removed 1 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA Medical-PT-12-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 227/227 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 227
Applied a total of 2 rules in 22 ms. Remains 67 /69 variables (removed 2) and now considering 227/227 (removed 0) transitions.
[2025-06-01 17:54:05] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
// Phase 1: matrix 182 rows 67 cols
[2025-06-01 17:54:05] [INFO ] Computed 8 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:54:05] [INFO ] Implicit Places using invariants in 362 ms returned []
[2025-06-01 17:54:05] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-01 17:54:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:54:05] [INFO ] State equation strengthened by 56 read => feed constraints.
[2025-06-01 17:54:06] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 899 ms to find 0 implicit places.
Running 222 sub problems to find dead transitions.
[2025-06-01 17:54:06] [INFO ] Flow matrix only has 182 transitions (discarded 45 similar events)
[2025-06-01 17:54:06] [INFO ] Invariant cache hit.
[2025-06-01 17:54:06] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 222 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:08] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 8 ms to minimize.
Problem TDEAD213 is UNSAT
Problem TDEAD218 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/9 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:10] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/75 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/131 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/131 constraints. Problems are: Problem set: 2 solved, 220 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/249 variables, 2/133 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/249 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 11 (OVERLAPS) 0/249 variables, 0/133 constraints. Problems are: Problem set: 2 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 133 constraints, problems are : Problem set: 2 solved, 220 unsolved in 12763 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 67/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 220 unsolved
At refinement iteration 3 (OVERLAPS) 2/65 variables, 2/10 constraints. Problems are: Problem set: 2 solved, 220 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:22] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 4 ms to minimize.
Problem TDEAD203 is UNSAT
Problem TDEAD208 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:22] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 3 ms to minimize.
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:22] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 3/13 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 6 (OVERLAPS) 182/247 variables, 65/78 constraints. Problems are: Problem set: 6 solved, 216 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/247 variables, 56/134 constraints. Problems are: Problem set: 6 solved, 216 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD128 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 133/267 constraints. Problems are: Problem set: 9 solved, 213 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:27] [INFO ] Deduced a trap along path composed of 5 places in 56 ms of which 15 ms to minimize.
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:27] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:28] [INFO ] Deduced a trap along path composed of 4 places in 32 ms of which 2 ms to minimize.
Problem TDEAD64 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:28] [INFO ] Deduced a trap along path composed of 6 places in 50 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/247 variables, 4/271 constraints. Problems are: Problem set: 23 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:32] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/247 variables, 1/272 constraints. Problems are: Problem set: 23 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:37] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/247 variables, 1/273 constraints. Problems are: Problem set: 23 solved, 199 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:42] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:44] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/247 variables, 2/275 constraints. Problems are: Problem set: 23 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 247/249 variables, and 275 constraints, problems are : Problem set: 23 solved, 199 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 65/67 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 133/222 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 43265ms problems are : Problem set: 23 solved, 199 unsolved
Search for dead transitions found 23 dead transitions in 43293ms
Found 23 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 23 transitions
Dead transitions reduction (with SMT) removed 23 transitions
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 204/227 transitions.
Reduce places removed 3 places and 23 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 64 transition count 181
Reduce places removed 1 places and 18 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 63 transition count 163
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 62 transition count 157
Reduce places removed 1 places and 12 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 6 place count 61 transition count 145
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 7 place count 60 transition count 140
Reduce places removed 1 places and 6 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 8 place count 59 transition count 134
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 8 rules in 5 ms. Remains 59 /67 variables (removed 8) and now considering 134/204 (removed 70) transitions.
[2025-06-01 17:54:49] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
// Phase 1: matrix 117 rows 59 cols
[2025-06-01 17:54:49] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:54:49] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-01 17:54:49] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
[2025-06-01 17:54:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:54:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2025-06-01 17:54:49] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 59/69 places, 134/227 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44512 ms. Remains : 59/69 places, 134/227 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 2 out of 58 places after structural reductions.
FORMULA Medical-PT-12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-01 17:54:50] [INFO ] Flatten gal took : 82 ms
[2025-06-01 17:54:50] [INFO ] Flatten gal took : 43 ms
[2025-06-01 17:54:50] [INFO ] Input system was already deterministic with 134 transitions.
RANDOM walk for 40005 steps (179 resets) in 605 ms. (66 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (45 resets) in 168 ms. (236 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (39 resets) in 249 ms. (160 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 475209 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 2
Probabilistic random walk after 475209 steps, saw 285892 distinct states, run finished after 3007 ms. (steps per millisecond=158 ) properties seen :0
[2025-06-01 17:54:53] [INFO ] Flow matrix only has 117 transitions (discarded 17 similar events)
// Phase 1: matrix 117 rows 58 cols
[2025-06-01 17:54:53] [INFO ] Computed 8 invariants in 2 ms
[2025-06-01 17:54:53] [INFO ] State equation strengthened by 49 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 3/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 15/20 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 55/75 variables, 14/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/75 variables, 19/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/75 variables, 0/40 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/77 variables, 1/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/77 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 36/113 variables, 15/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 1/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 10/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/113 variables, 0/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 50/163 variables, 12/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/163 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/163 variables, 20/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/163 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/165 variables, 1/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/165 variables, 2/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/165 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/175 variables, 10/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/175 variables, 2/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/175 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/175 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 175/175 variables, and 115 constraints, problems are : Problem set: 1 solved, 1 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 38/45 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 8/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 33/78 variables, 9/28 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 11/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 66/144 variables, 15/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/144 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/144 variables, 23/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/144 variables, 1/79 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:54:54] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/144 variables, 1/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/144 variables, 0/80 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/146 variables, 1/81 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/146 variables, 2/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/146 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 26/172 variables, 19/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/172 variables, 4/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/172 variables, 7/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/172 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 3/175 variables, 3/116 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/175 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/175 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/175 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 175/175 variables, and 117 constraints, problems are : Problem set: 1 solved, 1 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 58/58 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 460ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 58 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 58/58 places, 134/134 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 58 transition count 131
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 55 transition count 131
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 54 transition count 131
Free-agglomeration rule applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 54 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 12 place count 52 transition count 129
Applied a total of 12 rules in 45 ms. Remains 52 /58 variables (removed 6) and now considering 129/134 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 52/58 places, 129/134 transitions.
RANDOM walk for 40024 steps (8 resets) in 263 ms. (151 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1503155 steps, run timeout after 3001 ms. (steps per millisecond=500 ) properties seen :0 out of 1
Probabilistic random walk after 1503155 steps, saw 863198 distinct states, run finished after 3001 ms. (steps per millisecond=500 ) properties seen :0
[2025-06-01 17:54:57] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
// Phase 1: matrix 111 rows 52 cols
[2025-06-01 17:54:57] [INFO ] Computed 8 invariants in 2 ms
[2025-06-01 17:54:57] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/62 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/123 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 34/157 variables, 18/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 4/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 10/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/158 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/158 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/163 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/163 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/163 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 110 constraints, problems are : Problem set: 0 solved, 1 unsolved in 119 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/7 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 55/62 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 19/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 61/123 variables, 19/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 34/157 variables, 18/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 4/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 10/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/158 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/158 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/158 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 5/163 variables, 4/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/163 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 111 constraints, problems are : Problem set: 0 solved, 1 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 52/52 places, 129/129 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2025-06-01 17:54:57] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
[2025-06-01 17:54:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:54:57] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-01 17:54:57] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
[2025-06-01 17:54:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:54:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2025-06-01 17:54:58] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 17:54:58] [INFO ] Redundant transitions in 6 ms returned []
Running 128 sub problems to find dead transitions.
[2025-06-01 17:54:58] [INFO ] Flow matrix only has 111 transitions (discarded 18 similar events)
[2025-06-01 17:54:58] [INFO ] Invariant cache hit.
[2025-06-01 17:54:58] [INFO ] State equation strengthened by 50 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 111/163 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 110 constraints, problems are : Problem set: 0 solved, 128 unsolved in 3956 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (OVERLAPS) 111/163 variables, 52/60 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/163 variables, 50/110 constraints. Problems are: Problem set: 0 solved, 128 unsolved
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/163 variables, 128/238 constraints. Problems are: Problem set: 13 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:05] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:05] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:05] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 4/242 constraints. Problems are: Problem set: 13 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:06] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 1/243 constraints. Problems are: Problem set: 13 solved, 115 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:08] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:08] [INFO ] Deduced a trap along path composed of 4 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:08] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
Problem TDEAD76 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 3/246 constraints. Problems are: Problem set: 14 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:10] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:10] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 2/248 constraints. Problems are: Problem set: 14 solved, 114 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 0/248 constraints. Problems are: Problem set: 14 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:16] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/163 variables, 1/249 constraints. Problems are: Problem set: 14 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:20] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 1/250 constraints. Problems are: Problem set: 14 solved, 114 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/250 constraints. Problems are: Problem set: 14 solved, 114 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 17:55:27] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/163 variables, 1/251 constraints. Problems are: Problem set: 14 solved, 114 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 163/163 variables, and 251 constraints, problems are : Problem set: 14 solved, 114 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 34076ms problems are : Problem set: 14 solved, 114 unsolved
Search for dead transitions found 14 dead transitions in 34080ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 52/52 places, 115/129 transitions.
Reduce places removed 5 places and 24 transitions.
Graph (complete) has 172 edges and 47 vertex of which 1 are kept as prefixes of interest. Removing 46 places using SCC suffix rule.3 ms
Discarding 46 places :
Also discarding 91 output transitions
Drop transitions (Output transitions of discarded places.) removed 91 transitions
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1 transition count 0
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 6 rules in 10 ms. Remains 1 /52 variables (removed 51) and now considering 0/115 (removed 115) transitions.
[2025-06-01 17:55:32] [INFO ] Computed 0 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:55:32] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-06-01 17:55:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 17:55:32] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/52 places, 0/129 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 34461 ms. Remains : 1/52 places, 0/129 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
FORMULA Medical-PT-12-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Medical-PT-12-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 17 stable transitions
All properties solved by simple procedures.
Total runtime 88239 ms.

BK_STOP 1748800532281

--------------------
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="Medical-PT-12"
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 Medical-PT-12, 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 r128-smll-174876523800043"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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