Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008300670.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-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008300670
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 117K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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 175K 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-17-ReachabilityCardinality-2025-00
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-01
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-02
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-03
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-04
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-05
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-06
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-07
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-08
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-09
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-10
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-11
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-12
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-13
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-14
FORMULA_NAME HealthRecord-PT-17-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1749013231923

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-04 05:00:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 05:00:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 05:00:34] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2025-06-04 05:00:35] [INFO ] Transformed 624 places.
[2025-06-04 05:00:35] [INFO ] Transformed 828 transitions.
[2025-06-04 05:00:35] [INFO ] Found NUPN structural information;
[2025-06-04 05:00:35] [INFO ] Parsed PT model containing 624 places and 828 transitions and 1879 arcs in 615 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (341 resets) in 2654 ms. (15 steps per ms) remains 9/12 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-04 05:00:36] [INFO ] Flatten gal took : 195 ms
BEST_FIRST walk for 40004 steps (59 resets) in 469 ms. (85 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 492 ms. (81 steps per ms) remains 9/9 properties
[2025-06-04 05:00:36] [INFO ] Flatten gal took : 174 ms
BEST_FIRST walk for 40003 steps (57 resets) in 307 ms. (129 steps per ms) remains 9/9 properties
[2025-06-04 05:00:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10930363778641231630.gal : 144 ms
[2025-06-04 05:00:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5790876128787502133.prop : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10930363778641231630.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5790876128787502133.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40002 steps (63 resets) in 1061 ms. (37 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (56 resets) in 416 ms. (95 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality5790876128787502133.prop.
BEST_FIRST walk for 40004 steps (72 resets) in 339 ms. (117 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (55 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (54 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (60 resets) in 280 ms. (142 steps per ms) remains 9/9 properties
// Phase 1: matrix 828 rows 624 cols
[2025-06-04 05:00:37] [INFO ] Computed 18 invariants in 44 ms
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 11
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :11 after 12
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :12 after 16
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :16 after 27
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :27 after 55
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :55 after 363
Excessive predecessor constraint size, skipping predecessor.
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/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 175/259 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 175/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 365/624 variables, 8/277 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/624 variables, 365/642 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/624 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 828/1452 variables, 624/1266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/1452 variables, 0/1266 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1452/1452 variables, and 1266 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5052 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 624/624 constraints, PredecessorRefiner: 9/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 175/259 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 175/269 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:43] [INFO ] Deduced a trap composed of 85 places in 326 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:43] [INFO ] Deduced a trap composed of 86 places in 258 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:43] [INFO ] Deduced a trap composed of 99 places in 135 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:43] [INFO ] Deduced a trap composed of 91 places in 96 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:44] [INFO ] Deduced a trap composed of 86 places in 151 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:44] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 29 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:44] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:44] [INFO ] Deduced a trap composed of 86 places in 141 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:44] [INFO ] Deduced a trap composed of 86 places in 144 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:45] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:45] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:45] [INFO ] Deduced a trap composed of 92 places in 82 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/259 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:45] [INFO ] Deduced a trap composed of 86 places in 156 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:46] [INFO ] Deduced a trap composed of 86 places in 142 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:46] [INFO ] Deduced a trap composed of 86 places in 139 ms of which 29 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 365/624 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/624 variables, 365/657 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:47] [INFO ] Deduced a trap composed of 108 places in 320 ms of which 75 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 624/1452 variables, and 658 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5008 ms.
Refiners :[Domain max(s): 624/624 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/624 constraints, PredecessorRefiner: 1/8 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10270ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 84 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 828/828 transitions.
Graph (trivial) has 576 edges and 624 vertex of which 53 / 624 are part of one of the 14 SCC in 8 ms
Free SCC test removed 39 places
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (complete) has 1239 edges and 585 vertex of which 569 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.5 ms
Discarding 16 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 210 transitions
Trivial Post-agglo rules discarded 210 transitions
Performed 210 trivial Post agglomeration. Transition count delta: 210
Iterating post reduction 0 with 210 rules applied. Total rules applied 212 place count 569 transition count 554
Reduce places removed 210 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 231 rules applied. Total rules applied 443 place count 359 transition count 533
Reduce places removed 6 places and 0 transitions.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Iterating post reduction 2 with 37 rules applied. Total rules applied 480 place count 353 transition count 502
Reduce places removed 31 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 34 rules applied. Total rules applied 514 place count 322 transition count 499
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 515 place count 321 transition count 499
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 515 place count 321 transition count 491
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 531 place count 313 transition count 491
Discarding 59 places :
Symmetric choice reduction at 5 with 59 rule applications. Total rules 590 place count 254 transition count 376
Iterating global reduction 5 with 59 rules applied. Total rules applied 649 place count 254 transition count 376
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 650 place count 254 transition count 375
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 654 place count 250 transition count 367
Iterating global reduction 6 with 4 rules applied. Total rules applied 658 place count 250 transition count 367
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 722 place count 218 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 723 place count 218 transition count 334
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -48
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 7 with 22 rules applied. Total rules applied 745 place count 207 transition count 382
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 748 place count 207 transition count 379
Free-agglomeration rule applied 25 times.
Iterating global reduction 7 with 25 rules applied. Total rules applied 773 place count 207 transition count 354
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 798 place count 182 transition count 354
Drop transitions (Redundant composition of simpler transitions.) removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 803 place count 182 transition count 349
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 804 place count 182 transition count 349
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 809 place count 182 transition count 349
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 811 place count 180 transition count 347
Iterating global reduction 8 with 2 rules applied. Total rules applied 813 place count 180 transition count 347
Applied a total of 813 rules in 305 ms. Remains 180 /624 variables (removed 444) and now considering 347/828 (removed 481) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 318 ms. Remains : 180/624 places, 347/828 transitions.
RANDOM walk for 40000 steps (1238 resets) in 435 ms. (91 steps per ms) remains 7/9 properties
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (208 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (203 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (210 resets) in 191 ms. (208 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (279 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (212 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (211 resets) in 101 ms. (392 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (223 resets) in 242 ms. (164 steps per ms) remains 7/7 properties
[2025-06-04 05:00:48] [INFO ] Flow matrix only has 344 transitions (discarded 3 similar events)
// Phase 1: matrix 344 rows 180 cols
[2025-06-04 05:00:48] [INFO ] Computed 9 invariants in 5 ms
[2025-06-04 05:00:48] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 13/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 84/180 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 344/524 variables, 180/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/524 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 524/524 variables, and 195 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 180/180 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 13/96 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 84/180 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 344/524 variables, 180/189 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/524 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/524 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:50] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:50] [INFO ] Deduced a trap composed of 33 places in 98 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:50] [INFO ] Deduced a trap composed of 38 places in 129 ms of which 9 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/524 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:51] [INFO ] Deduced a trap along path composed of 2 places in 24 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/524 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/524 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:52] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 15 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/524 variables, 1/206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:53] [INFO ] Deduced a trap composed of 42 places in 119 ms of which 9 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/524 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/524 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:00:54] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 20 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/524 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/524 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 0/524 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 524/524 variables, and 208 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 180/180 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7610ms problems are : Problem set: 0 solved, 7 unsolved
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-09 FALSE TECHNIQUES PARIKH_WALK
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 3 properties in 1722 ms.
Support contains 48 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 347/347 transitions.
Graph (trivial) has 93 edges and 180 vertex of which 5 / 180 are part of one of the 2 SCC in 1 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 177 transition count 331
Reduce places removed 11 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 17 rules applied. Total rules applied 29 place count 166 transition count 325
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 36 place count 160 transition count 324
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 36 place count 160 transition count 319
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 155 transition count 319
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 54 place count 147 transition count 303
Iterating global reduction 3 with 8 rules applied. Total rules applied 62 place count 147 transition count 303
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 72 place count 142 transition count 298
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 142 transition count 295
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 85 place count 137 transition count 309
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 87 place count 135 transition count 299
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 135 transition count 299
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 90 place count 135 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 93 place count 135 transition count 295
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 101 place count 135 transition count 287
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 5 with 8 rules applied. Total rules applied 109 place count 127 transition count 287
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 127 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 111 place count 127 transition count 286
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 113 place count 127 transition count 286
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 114 place count 126 transition count 285
Iterating global reduction 6 with 1 rules applied. Total rules applied 115 place count 126 transition count 285
Applied a total of 115 rules in 90 ms. Remains 126 /180 variables (removed 54) and now considering 285/347 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 126/180 places, 285/347 transitions.
RANDOM walk for 40000 steps (1668 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (250 resets) in 72 ms. (548 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (243 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (245 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (271 resets) in 208 ms. (191 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 563506 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 4
Probabilistic random walk after 563506 steps, saw 103023 distinct states, run finished after 3009 ms. (steps per millisecond=187 ) properties seen :0
[2025-06-04 05:01:01] [INFO ] Flow matrix only has 280 transitions (discarded 5 similar events)
// Phase 1: matrix 280 rows 126 cols
[2025-06-04 05:01:01] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 05:01:01] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 68/126 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 280/406 variables, 126/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 141 constraints, problems are : Problem set: 0 solved, 4 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 10/58 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 68/126 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:01] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 280/406 variables, 126/136 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 6/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 4/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:02] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:02] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:02] [INFO ] Deduced a trap composed of 22 places in 88 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:02] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 13 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:02] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/406 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:03] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 8 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:03] [INFO ] Deduced a trap composed of 37 places in 102 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/406 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 406/406 variables, and 153 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2756 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3134ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 864 ms.
Support contains 48 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 285/285 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 285/285 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 126/126 places, 285/285 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 285/285 transitions.
Applied a total of 0 rules in 6 ms. Remains 126 /126 variables (removed 0) and now considering 285/285 (removed 0) transitions.
[2025-06-04 05:01:05] [INFO ] Flow matrix only has 280 transitions (discarded 5 similar events)
[2025-06-04 05:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:01:05] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 05:01:05] [INFO ] Flow matrix only has 280 transitions (discarded 5 similar events)
[2025-06-04 05:01:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:01:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 05:01:05] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:01:05] [INFO ] Redundant transitions in 40 ms returned []
Running 283 sub problems to find dead transitions.
[2025-06-04 05:01:05] [INFO ] Flow matrix only has 280 transitions (discarded 5 similar events)
[2025-06-04 05:01:05] [INFO ] Invariant cache hit.
[2025-06-04 05:01:05] [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/125 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 4 (OVERLAPS) 280/406 variables, 126/135 constraints. Problems are: Problem set: 0 solved, 283 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 283 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:12] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:13] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:13] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:13] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:14] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 8 ms to minimize.
Problem TDEAD224 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:14] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:15] [INFO ] Deduced a trap composed of 28 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:15] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:15] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:15] [INFO ] Deduced a trap composed of 26 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 05:01:15] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 11/152 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 8 (OVERLAPS) 0/406 variables, 0/152 constraints. Problems are: Problem set: 1 solved, 282 unsolved
No progress, stopping.
After SMT solving in domain Real declared 406/406 variables, and 152 constraints, problems are : Problem set: 1 solved, 282 unsolved in 24779 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 283/283 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 282 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 2 (OVERLAPS) 1/126 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 11/20 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 5 (OVERLAPS) 280/406 variables, 126/146 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 6/152 constraints. Problems are: Problem set: 1 solved, 282 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/406 variables, 282/434 constraints. Problems are: Problem set: 1 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:43] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/406 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 282 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:47] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:01:48] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/406 variables, 2/437 constraints. Problems are: Problem set: 1 solved, 282 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 406/406 variables, and 437 constraints, problems are : Problem set: 1 solved, 282 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 126/126 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 282/283 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55083ms problems are : Problem set: 1 solved, 282 unsolved
Search for dead transitions found 1 dead transitions in 55090ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 126/126 places, 284/285 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 125 transition count 283
Applied a total of 2 rules in 13 ms. Remains 125 /126 variables (removed 1) and now considering 283/284 (removed 1) transitions.
[2025-06-04 05:02:00] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
// Phase 1: matrix 278 rows 125 cols
[2025-06-04 05:02:00] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:02:00] [INFO ] Implicit Places using invariants in 138 ms returned []
[2025-06-04 05:02:00] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
[2025-06-04 05:02:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:02:00] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 05:02:00] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 125/126 places, 283/285 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55798 ms. Remains : 125/126 places, 283/285 transitions.
RANDOM walk for 40000 steps (1654 resets) in 362 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (252 resets) in 80 ms. (493 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (245 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (248 resets) in 43 ms. (909 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (276 resets) in 129 ms. (307 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 596889 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 4
Probabilistic random walk after 596889 steps, saw 109324 distinct states, run finished after 3001 ms. (steps per millisecond=198 ) properties seen :0
[2025-06-04 05:02:04] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
[2025-06-04 05:02:04] [INFO ] Invariant cache hit.
[2025-06-04 05:02:04] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 68/125 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 278/403 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/403 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 140 constraints, problems are : Problem set: 0 solved, 4 unsolved in 369 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 9/57 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 68/125 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:04] [INFO ] Deduced a trap composed of 26 places in 84 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 278/403 variables, 125/135 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 6/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 4/145 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:04] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:05] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:05] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 7 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/403 variables, 2/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/403 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/403 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 403/403 variables, and 148 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1951ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 528 ms.
Support contains 48 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 283/283 transitions.
Applied a total of 0 rules in 7 ms. Remains 125 /125 variables (removed 0) and now considering 283/283 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 125/125 places, 283/283 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 283/283 transitions.
Applied a total of 0 rules in 6 ms. Remains 125 /125 variables (removed 0) and now considering 283/283 (removed 0) transitions.
[2025-06-04 05:02:06] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
[2025-06-04 05:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:02:06] [INFO ] Implicit Places using invariants in 93 ms returned []
[2025-06-04 05:02:06] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
[2025-06-04 05:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 05:02:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-04 05:02:06] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 05:02:06] [INFO ] Redundant transitions in 36 ms returned []
Running 281 sub problems to find dead transitions.
[2025-06-04 05:02:06] [INFO ] Flow matrix only has 278 transitions (discarded 5 similar events)
[2025-06-04 05:02:06] [INFO ] Invariant cache hit.
[2025-06-04 05:02:06] [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/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (OVERLAPS) 278/403 variables, 125/134 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:13] [INFO ] Deduced a trap composed of 34 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:13] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:14] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:14] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:15] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:15] [INFO ] Deduced a trap composed of 27 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:15] [INFO ] Deduced a trap composed of 30 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:15] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:15] [INFO ] Deduced a trap composed of 26 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 05:02:16] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:18] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:19] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:19] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:20] [INFO ] Deduced a trap composed of 39 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 05:02:20] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 9 (OVERLAPS) 0/403 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
No progress, stopping.
After SMT solving in domain Real declared 403/403 variables, and 155 constraints, problems are : Problem set: 0 solved, 281 unsolved in 27740 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/124 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 2 (OVERLAPS) 1/125 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 5 (OVERLAPS) 278/403 variables, 125/149 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 6/155 constraints. Problems are: Problem set: 0 solved, 281 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 281/436 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:42] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:43] [INFO ] Deduced a trap composed of 63 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:43] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 3/439 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:02:54] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 281 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/403 variables, and 440 constraints, problems are : Problem set: 0 solved, 281 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 125/125 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 281/281 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57913ms problems are : Problem set: 0 solved, 281 unsolved
Search for dead transitions found 0 dead transitions in 57918ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58287 ms. Remains : 125/125 places, 283/283 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 125 transition count 278
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 1 with 17 rules applied. Total rules applied 22 place count 125 transition count 261
Applied a total of 22 rules in 14 ms. Remains 125 /125 variables (removed 0) and now considering 261/283 (removed 22) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 261 rows 125 cols
[2025-06-04 05:03:04] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 05:03:04] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-04 05:03:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-04 05:03:05] [INFO ] [Nat]Absence check using 1 positive and 8 generalized place invariants in 6 ms returned sat
[2025-06-04 05:03:05] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:05] [INFO ] Deduced a trap composed of 20 places in 54 ms of which 4 ms to minimize.
[2025-06-04 05:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:05] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 12 ms to minimize.
[2025-06-04 05:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
TRAPS : Iteration 1
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:05] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 3 ms to minimize.
[2025-06-04 05:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:05] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 4 ms to minimize.
[2025-06-04 05:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
TRAPS : Iteration 2
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 05:03:05] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 14 ms to minimize.
[2025-06-04 05:03:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
TRAPS : Iteration 3
[2025-06-04 05:03:06] [INFO ] After 1068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2025-06-04 05:03:06] [INFO ] After 1225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-04 05:03:06] [INFO ] Flatten gal took : 62 ms
[2025-06-04 05:03:06] [INFO ] Flatten gal took : 23 ms
[2025-06-04 05:03:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11389468434714198999.gal : 4 ms
[2025-06-04 05:03:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9781679749646948813.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11389468434714198999.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9781679749646948813.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9781679749646948813.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 18
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :18 after 54
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :54 after 227
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :227 after 25975
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :25975 after 309918
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :309918 after 312355
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :312355 after 319798
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :319798 after 470815
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :470815 after 619753
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :619753 after 8.95513e+06
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :8.95513e+06 after 1.59081e+07
Detected timeout of ITS tools.
[2025-06-04 05:03:21] [INFO ] Flatten gal took : 22 ms
[2025-06-04 05:03:21] [INFO ] Applying decomposition
[2025-06-04 05:03:21] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12100857590393334252.txt' '-o' '/tmp/graph12100857590393334252.bin' '-w' '/tmp/graph12100857590393334252.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12100857590393334252.bin' '-l' '-1' '-v' '-w' '/tmp/graph12100857590393334252.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:03:21] [INFO ] Decomposing Gal with order
[2025-06-04 05:03:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:03:21] [INFO ] Removed a total of 348 redundant transitions.
[2025-06-04 05:03:21] [INFO ] Flatten gal took : 94 ms
[2025-06-04 05:03:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 21 ms.
[2025-06-04 05:03:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15926559510604416316.gal : 7 ms
[2025-06-04 05:03:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9307256316589877576.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15926559510604416316.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9307256316589877576.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality9307256316589877576.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :7 after 169
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :169 after 793816
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.05842e+06 after 1.05844e+06
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.05844e+06 after 2.57805e+07
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.41321e+09,1.4325,33732,1526,246,50973,2363,669,91358,150,10277,0
Total reachable state count : 3413207174

Verifying 4 reachability properties.
Invariant property HealthRecord-PT-17-ReachabilityCardinality-2025-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-03,2,1.4617,33860,53,17,50973,2363,683,91358,157,10277,3851
Reachability property HealthRecord-PT-17-ReachabilityCardinality-2025-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-06,18000,1.46564,33860,65,32,50973,2363,691,91358,158,10277,4533
Reachability property HealthRecord-PT-17-ReachabilityCardinality-2025-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-14,6000,1.46613,33860,64,36,50973,2363,692,91358,159,10277,4558
Invariant property HealthRecord-PT-17-ReachabilityCardinality-2025-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-15,84425,1.50288,33860,107,54,50973,2363,740,91358,162,10277,12856
Over-approximation ignoring read arcs solved 0 properties in 18458 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-04 05:03:23] [INFO ] Flatten gal took : 37 ms
[2025-06-04 05:03:23] [INFO ] Applying decomposition
[2025-06-04 05:03:23] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1684223306084917090.txt' '-o' '/tmp/graph1684223306084917090.bin' '-w' '/tmp/graph1684223306084917090.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1684223306084917090.bin' '-l' '-1' '-v' '-w' '/tmp/graph1684223306084917090.weights' '-q' '0' '-e' '0.001'
[2025-06-04 05:03:23] [INFO ] Decomposing Gal with order
[2025-06-04 05:03:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-04 05:03:23] [INFO ] Removed a total of 257 redundant transitions.
[2025-06-04 05:03:23] [INFO ] Flatten gal took : 73 ms
[2025-06-04 05:03:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 13 ms.
[2025-06-04 05:03:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17207115032120044224.gal : 18 ms
[2025-06-04 05:03:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5131449939273696558.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17207115032120044224.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5131449939273696558.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5131449939273696558.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 217
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :217 after 343
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :343 after 721
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :721 after 84461
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :84461 after 368101
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :368101 after 394561
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :394561 after 395541
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :1.3779e+12 after 1.53334e+12
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :1.53334e+12 after 5.42356e+12
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :2.00341e+13 after 1.23788e+14
Reachability property HealthRecord-PT-17-ReachabilityCardinality-2025-14 is true.
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Reachability property HealthRecord-PT-17-ReachabilityCardinality-2025-06 is true.
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :2.09449e+14 after 4.92915e+14
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :8.93798e+14 after 1.14095e+15
Invariant property HealthRecord-PT-17-ReachabilityCardinality-2025-03 does not hold.
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2.00067e+15 after 2.1431e+15
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.1431e+15 after 2.42815e+15
Invariant property HealthRecord-PT-17-ReachabilityCardinality-2025-15 does not hold.
FORMULA HealthRecord-PT-17-ReachabilityCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 16385 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.49919e+15,558.53,4103548,82915,29322,4.8742e+06,1.24266e+06,1359,1.92435e+07,334,1.119e+07,0
Total reachable state count : 3499189203517258

Verifying 4 reachability properties.
Invariant property HealthRecord-PT-17-ReachabilityCardinality-2025-03 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-03,6561,580.788,4103548,141,54,4.8742e+06,1.24266e+06,1415,1.92435e+07,349,1.119e+07,0
Reachability property HealthRecord-PT-17-ReachabilityCardinality-2025-06 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-06,42,587.867,4103548,152,73,4.8742e+06,1.24266e+06,1446,1.92435e+07,349,1.119e+07,0
Reachability property HealthRecord-PT-17-ReachabilityCardinality-2025-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-14,1344,587.869,4103548,166,75,4.8742e+06,1.24266e+06,1454,1.92435e+07,349,1.119e+07,0
Invariant property HealthRecord-PT-17-ReachabilityCardinality-2025-15 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
HealthRecord-PT-17-ReachabilityCardinality-2025-15,2.57939e+07,707.764,4103548,220,117,4.8742e+06,1.24266e+06,1584,1.92435e+07,362,1.119e+07,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 878361 ms.

BK_STOP 1749014112800

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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-17"
export BK_EXAMINATION="ReachabilityCardinality"
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-17, examination is ReachabilityCardinality"
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-174867008300670"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-17.tgz
mv HealthRecord-PT-17 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;