About the Execution of ITS-Tools for HealthRecord-PT-03
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 90184.00 | 0.00 | 0.00 | FTFFTFFFFFFFFTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008100555.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 HealthRecord-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008100555
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 47K 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 49K 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 HealthRecord-PT-03-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-03-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748997357039
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-03
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 00:35:59] [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-04 00:35:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 00:36:00] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2025-06-04 00:36:00] [INFO ] Transformed 121 places.
[2025-06-04 00:36:00] [INFO ] Transformed 232 transitions.
[2025-06-04 00:36:00] [INFO ] Found NUPN structural information;
[2025-06-04 00:36:00] [INFO ] Parsed PT model containing 121 places and 232 transitions and 597 arcs in 387 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 7 transitions
Reduce redundant transitions removed 7 transitions.
FORMULA HealthRecord-PT-03-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 17 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 225/225 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 67 transition count 122
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 67 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 113 place count 62 transition count 112
Iterating global reduction 0 with 5 rules applied. Total rules applied 118 place count 62 transition count 112
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 120 place count 62 transition count 110
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 121 place count 61 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 122 place count 61 transition count 107
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 60 transition count 105
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 60 transition count 105
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 60 transition count 104
Applied a total of 125 rules in 82 ms. Remains 60 /121 variables (removed 61) and now considering 104/225 (removed 121) transitions.
[2025-06-04 00:36:00] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
// Phase 1: matrix 101 rows 60 cols
[2025-06-04 00:36:00] [INFO ] Computed 9 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:00] [INFO ] Implicit Places using invariants in 390 ms returned []
[2025-06-04 00:36:00] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 00:36:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:36:01] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-04 00:36:01] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 00:36:01] [INFO ] Invariant cache hit.
[2025-06-04 00:36:01] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:02] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:03] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:03] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:03] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:03] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:03] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:04] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:04] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 100/160 variables, 60/77 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:07] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/161 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 11 (OVERLAPS) 0/161 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 79 constraints, problems are : Problem set: 0 solved, 103 unsolved in 9623 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 100/160 variables, 60/78 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 103/181 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 182 constraints, problems are : Problem set: 0 solved, 103 unsolved in 13434 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23215ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 23237ms
Starting structural reductions in LTL mode, iteration 1 : 60/121 places, 104/225 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24062 ms. Remains : 60/121 places, 104/225 transitions.
Support contains 17 out of 60 places after structural reductions.
[2025-06-04 00:36:24] [INFO ] Flatten gal took : 62 ms
[2025-06-04 00:36:24] [INFO ] Flatten gal took : 25 ms
[2025-06-04 00:36:25] [INFO ] Input system was already deterministic with 104 transitions.
Support contains 16 out of 60 places (down from 17) after GAL structural reductions.
RANDOM walk for 40000 steps (2698 resets) in 1456 ms. (27 steps per ms) remains 2/10 properties
BEST_FIRST walk for 40003 steps (401 resets) in 303 ms. (131 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (405 resets) in 223 ms. (178 steps per ms) remains 2/2 properties
[2025-06-04 00:36:25] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 00:36:25] [INFO ] Invariant cache hit.
[2025-06-04 00:36:25] [INFO ] State equation strengthened by 1 read => feed constraints.
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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 21/60 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 100/160 variables, 60/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/161 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 70 constraints, problems are : Problem set: 0 solved, 2 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:25] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 21/60 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:26] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:26] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:26] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:26] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 100/160 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/161 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/161 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 77 constraints, problems are : Problem set: 0 solved, 2 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 666ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 45 ms.
FORMULA HealthRecord-PT-03-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 3 stabilizing places and 4 stable transitions
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(F(((G(p0) U X(X(!p1)))&&X(F(p2))))))'
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 104/104 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 51 transition count 87
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 51 transition count 87
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 51 transition count 86
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 48 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 48 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 48 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 47 transition count 76
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 47 transition count 76
Applied a total of 28 rules in 9 ms. Remains 47 /60 variables (removed 13) and now considering 76/104 (removed 28) transitions.
[2025-06-04 00:36:26] [INFO ] Flow matrix only has 74 transitions (discarded 2 similar events)
// Phase 1: matrix 74 rows 47 cols
[2025-06-04 00:36:26] [INFO ] Computed 8 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:26] [INFO ] Implicit Places using invariants in 49 ms returned []
[2025-06-04 00:36:26] [INFO ] Flow matrix only has 74 transitions (discarded 2 similar events)
[2025-06-04 00:36:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:36:26] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2025-06-04 00:36:26] [INFO ] Flow matrix only has 74 transitions (discarded 2 similar events)
[2025-06-04 00:36:26] [INFO ] Invariant cache hit.
[2025-06-04 00:36:26] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:27] [INFO ] Deduced a trap composed of 12 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:27] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:27] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:28] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 73/120 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 1/121 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/121 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 61 constraints, problems are : Problem set: 0 solved, 75 unsolved in 4858 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 73/120 variables, 47/60 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 75/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/121 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 136 constraints, problems are : Problem set: 0 solved, 75 unsolved in 6832 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11730ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 11748ms
Starting structural reductions in LTL mode, iteration 1 : 47/60 places, 76/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11927 ms. Remains : 47/60 places, 76/104 transitions.
Stuttering acceptance computed with spot in 853 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), p1, (NOT p2), p1, p1, (AND (NOT p2) p1), p1, (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-03-LTLCardinality-02
Stuttering criterion allowed to conclude after 4288 steps with 1096 reset in 82 ms.
FORMULA HealthRecord-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-03-LTLCardinality-02 finished in 12973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 104/104 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 49 transition count 83
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 49 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 23 place count 49 transition count 82
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 27 place count 45 transition count 73
Iterating global reduction 1 with 4 rules applied. Total rules applied 31 place count 45 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 45 transition count 72
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 34 place count 43 transition count 67
Iterating global reduction 2 with 2 rules applied. Total rules applied 36 place count 43 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 37 place count 43 transition count 66
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 42 transition count 64
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 42 transition count 64
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 42 transition count 63
Applied a total of 40 rules in 17 ms. Remains 42 /60 variables (removed 18) and now considering 63/104 (removed 41) transitions.
[2025-06-04 00:36:39] [INFO ] Flow matrix only has 61 transitions (discarded 2 similar events)
// Phase 1: matrix 61 rows 42 cols
[2025-06-04 00:36:39] [INFO ] Computed 8 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:39] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-04 00:36:39] [INFO ] Flow matrix only has 61 transitions (discarded 2 similar events)
[2025-06-04 00:36:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:36:39] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2025-06-04 00:36:39] [INFO ] Flow matrix only has 61 transitions (discarded 2 similar events)
[2025-06-04 00:36:39] [INFO ] Invariant cache hit.
[2025-06-04 00:36:39] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:40] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:40] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:40] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:40] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 60/102 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 55 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3637 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 60/102 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 62/116 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 1/103 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 117 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5091 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8758ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 8760ms
Starting structural reductions in LTL mode, iteration 1 : 42/60 places, 63/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8946 ms. Remains : 42/60 places, 63/104 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-03-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 344 ms.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-03-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-03-LTLCardinality-04 finished in 9853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 104/104 transitions.
Graph (trivial) has 66 edges and 60 vertex of which 10 / 60 are part of one of the 5 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 11 place count 44 transition count 80
Iterating global reduction 0 with 10 rules applied. Total rules applied 21 place count 44 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 22 place count 44 transition count 79
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 26 place count 40 transition count 70
Iterating global reduction 1 with 4 rules applied. Total rules applied 30 place count 40 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 31 place count 40 transition count 69
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 39 transition count 67
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 39 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 39 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 36 place count 38 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 37 place count 38 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 37 transition count 69
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 37 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 36 transition count 66
Applied a total of 42 rules in 69 ms. Remains 36 /60 variables (removed 24) and now considering 66/104 (removed 38) transitions.
[2025-06-04 00:36:49] [INFO ] Flow matrix only has 61 transitions (discarded 5 similar events)
// Phase 1: matrix 61 rows 36 cols
[2025-06-04 00:36:49] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:49] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-04 00:36:49] [INFO ] Flow matrix only has 61 transitions (discarded 5 similar events)
[2025-06-04 00:36:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:49] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 00:36:49] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:36:49] [INFO ] Redundant transitions in 2 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-04 00:36:49] [INFO ] Flow matrix only has 61 transitions (discarded 5 similar events)
[2025-06-04 00:36:49] [INFO ] Invariant cache hit.
[2025-06-04 00:36:49] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:50] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 60/96 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 51 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1995 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:52] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 60/96 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 52/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 104 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2908 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4926ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4928ms
Starting structural reductions in SI_LTL mode, iteration 1 : 36/60 places, 66/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5227 ms. Remains : 36/60 places, 66/104 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-03-LTLCardinality-06
Product exploration explored 100000 steps with 18 reset in 172 ms.
Product exploration explored 100000 steps with 1 reset in 210 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
RANDOM walk for 31700 steps (3300 resets) in 320 ms. (98 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 36/36 places, 66/66 transitions.
Applied a total of 0 rules in 7 ms. Remains 36 /36 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2025-06-04 00:36:55] [INFO ] Flow matrix only has 61 transitions (discarded 5 similar events)
[2025-06-04 00:36:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:55] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 00:36:55] [INFO ] Flow matrix only has 61 transitions (discarded 5 similar events)
[2025-06-04 00:36:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:36:55] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 00:36:55] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:36:55] [INFO ] Redundant transitions in 2 ms returned []
Running 52 sub problems to find dead transitions.
[2025-06-04 00:36:55] [INFO ] Flow matrix only has 61 transitions (discarded 5 similar events)
[2025-06-04 00:36:55] [INFO ] Invariant cache hit.
[2025-06-04 00:36:55] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:56] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:56] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 60/96 variables, 36/45 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/97 variables, and 51 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1972 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (OVERLAPS) 7/36 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:36:58] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 60/96 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 6/52 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 52/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/97 variables, and 104 constraints, problems are : Problem set: 0 solved, 52 unsolved in 2906 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 36/36 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4900ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 4901ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5058 ms. Remains : 36/36 places, 66/66 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Computed a total of 8 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
RANDOM walk for 22024 steps (2293 resets) in 57 ms. (379 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Product exploration explored 100000 steps with 27 reset in 86 ms.
Product exploration explored 100000 steps with 0 reset in 107 ms.
Built C files in :
/tmp/ltsmin454542978694215612
[2025-06-04 00:37:01] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2025-06-04 00:37:01] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:37:01] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2025-06-04 00:37:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:37:01] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2025-06-04 00:37:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 00:37:01] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin454542978694215612
Running compilation step : cd /tmp/ltsmin454542978694215612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 632 ms.
Running link step : cd /tmp/ltsmin454542978694215612;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin454542978694215612;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14918354698702698973.hoa' '--buchi-type=spotba'
LTSmin run took 153 ms.
FORMULA HealthRecord-PT-03-LTLCardinality-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-03-LTLCardinality-06 finished in 12946 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 104/104 transitions.
Graph (trivial) has 61 edges and 60 vertex of which 10 / 60 are part of one of the 5 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 43 transition count 78
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 43 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 43 transition count 77
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 28 place count 39 transition count 68
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 39 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 39 transition count 67
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 35 place count 37 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 37 place count 37 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 37 transition count 61
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 36 transition count 59
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 36 transition count 59
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 41 place count 36 transition count 58
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 35 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 46 place count 35 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 48 place count 34 transition count 58
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 33 transition count 57
Applied a total of 49 rules in 35 ms. Remains 33 /60 variables (removed 27) and now considering 57/104 (removed 47) transitions.
[2025-06-04 00:37:02] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
// Phase 1: matrix 52 rows 33 cols
[2025-06-04 00:37:02] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:37:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-06-04 00:37:02] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2025-06-04 00:37:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:37:02] [INFO ] State equation strengthened by 5 read => feed constraints.
[2025-06-04 00:37:02] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:37:02] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2025-06-04 00:37:02] [INFO ] Flow matrix only has 52 transitions (discarded 5 similar events)
[2025-06-04 00:37:02] [INFO ] Invariant cache hit.
[2025-06-04 00:37:02] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 7/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:03] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:03] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 51/84 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/84 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 47 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1765 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 7/33 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 51/84 variables, 33/42 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/84 variables, 43/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/84 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (OVERLAPS) 0/84 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 90 constraints, problems are : Problem set: 0 solved, 43 unsolved in 2266 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 33/33 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4050ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 4051ms
Starting structural reductions in SI_LTL mode, iteration 1 : 33/60 places, 57/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4249 ms. Remains : 33/60 places, 57/104 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-03-LTLCardinality-09
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-03-LTLCardinality-09 finished in 4379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F((X(F(!p0))&&p1))))'
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 104/104 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 51 transition count 88
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 51 transition count 88
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 51 transition count 87
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 48 transition count 80
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 48 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 48 transition count 79
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 47 transition count 77
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 47 transition count 77
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 47 transition count 76
Applied a total of 29 rules in 12 ms. Remains 47 /60 variables (removed 13) and now considering 76/104 (removed 28) transitions.
[2025-06-04 00:37:06] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
// Phase 1: matrix 75 rows 47 cols
[2025-06-04 00:37:06] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:37:06] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 00:37:06] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2025-06-04 00:37:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 00:37:06] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2025-06-04 00:37:06] [INFO ] Flow matrix only has 75 transitions (discarded 1 similar events)
[2025-06-04 00:37:06] [INFO ] Invariant cache hit.
[2025-06-04 00:37:06] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:07] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:07] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 74/121 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/122 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:10] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 5 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/122 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 122/122 variables, and 58 constraints, problems are : Problem set: 0 solved, 75 unsolved in 5950 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:13] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:13] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 74/121 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 75/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/122 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/122 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 122/122 variables, and 135 constraints, problems are : Problem set: 0 solved, 75 unsolved in 8594 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14560ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 14563ms
Starting structural reductions in LTL mode, iteration 1 : 47/60 places, 76/104 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14740 ms. Remains : 47/60 places, 76/104 transitions.
Stuttering acceptance computed with spot in 219 ms :[true, (NOT p0), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : HealthRecord-PT-03-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-03-LTLCardinality-10 finished in 14981 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 104/104 transitions.
Graph (trivial) has 65 edges and 60 vertex of which 10 / 60 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 45 transition count 82
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 45 transition count 82
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 23 place count 41 transition count 73
Iterating global reduction 0 with 4 rules applied. Total rules applied 27 place count 41 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 41 transition count 72
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 39 transition count 67
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 39 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 33 place count 39 transition count 66
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 38 transition count 64
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 38 transition count 64
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 37 place count 37 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 37 transition count 62
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 36 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 36 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 35 transition count 64
Applied a total of 43 rules in 42 ms. Remains 35 /60 variables (removed 25) and now considering 64/104 (removed 40) transitions.
[2025-06-04 00:37:21] [INFO ] Flow matrix only has 59 transitions (discarded 5 similar events)
// Phase 1: matrix 59 rows 35 cols
[2025-06-04 00:37:21] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:37:21] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 00:37:21] [INFO ] Flow matrix only has 59 transitions (discarded 5 similar events)
[2025-06-04 00:37:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 00:37:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 00:37:22] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 00:37:22] [INFO ] Redundant transitions in 2 ms returned []
Running 50 sub problems to find dead transitions.
[2025-06-04 00:37:22] [INFO ] Flow matrix only has 59 transitions (discarded 5 similar events)
[2025-06-04 00:37:22] [INFO ] Invariant cache hit.
[2025-06-04 00:37:22] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:22] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:22] [INFO ] Deduced a trap composed of 13 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 5 (OVERLAPS) 58/93 variables, 35/45 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (OVERLAPS) 0/93 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Real declared 93/94 variables, and 51 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 2 (OVERLAPS) 7/35 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:24] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 50 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 00:37:24] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/35 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 7 (OVERLAPS) 58/93 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 50/103 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/93 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/93 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 93/94 variables, and 103 constraints, problems are : Problem set: 0 solved, 50 unsolved in 2901 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5055ms problems are : Problem set: 0 solved, 50 unsolved
Search for dead transitions found 0 dead transitions in 5056ms
Starting structural reductions in SI_LTL mode, iteration 1 : 35/60 places, 64/104 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5287 ms. Remains : 35/60 places, 64/104 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-03-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-03-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-03-LTLCardinality-15 finished in 5359 ms.
All properties solved by simple procedures.
Total runtime 87498 ms.
BK_STOP 1748997447223
--------------------
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="HealthRecord-PT-03"
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 HealthRecord-PT-03, 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 r100-smll-174867008100555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-03.tgz
mv HealthRecord-PT-03 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 '
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 ;