Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068200814.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 EisenbergMcGuire-PT-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068200814
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.6M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K 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 3.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 156K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 3.1M May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748858366039

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 09:59:27] [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-02 09:59:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 09:59:27] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2025-06-02 09:59:27] [INFO ] Transformed 1090 places.
[2025-06-02 09:59:27] [INFO ] Transformed 5200 transitions.
[2025-06-02 09:59:27] [INFO ] Found NUPN structural information;
[2025-06-02 09:59:27] [INFO ] Parsed PT model containing 1090 places and 5200 transitions and 25400 arcs in 352 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1527 ms. (26 steps per ms) remains 11/15 properties
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 138 ms. (287 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 11/11 properties
[2025-06-02 09:59:28] [INFO ] Flatten gal took : 654 ms
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 11/11 properties
[2025-06-02 09:59:28] [INFO ] Flow matrix only has 2330 transitions (discarded 2870 similar events)
// Phase 1: matrix 2330 rows 1090 cols
[2025-06-02 09:59:28] [INFO ] Computed 31 invariants in 29 ms
[2025-06-02 09:59:29] [INFO ] State equation strengthened by 1246 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
[2025-06-02 09:59:29] [INFO ] Flatten gal took : 227 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2025-06-02 09:59:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8455707655989712981.gal : 98 ms
[2025-06-02 09:59:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12689170788342935958.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/ReachabilityCardinality8455707655989712981.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12689170788342935958.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
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 907/1071 variables, 21/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1071 variables, 907/1092 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Loading property file /tmp/ReachabilityCardinality12689170788342935958.prop.
At refinement iteration 4 (INCLUDED_ONLY) 0/1071 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/1090 variables, 10/1102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 19/1121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1090 variables, 0/1121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 2330/3420 variables, 1090/2211 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3420 variables, 1246/3457 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :8 after 10
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :10 after 12
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :12 after 14
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :14 after 15
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :15 after 77
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :77 after 155
At refinement iteration 10 (INCLUDED_ONLY) 0/3420 variables, 0/3457 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3420/3420 variables, and 3457 constraints, problems are : Problem set: 0 solved, 11 unsolved in 5043 ms.
Refiners :[Domain max(s): 1090/1090 constraints, Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 1090/1090 constraints, ReadFeed: 1246/1246 constraints, PredecessorRefiner: 11/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :155 after 280
At refinement iteration 0 (INCLUDED_ONLY) 0/164 variables, 164/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/164 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 907/1071 variables, 21/185 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1071 variables, 907/1092 constraints. Problems are: Problem set: 0 solved, 11 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :280 after 1831
At refinement iteration 4 (INCLUDED_ONLY) 0/1071 variables, 0/1092 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 19/1090 variables, 10/1102 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1090 variables, 19/1121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:36] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:37] [INFO ] Deduced a trap composed of 3 places in 359 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:37] [INFO ] Deduced a trap composed of 29 places in 361 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :1831 after 4300
[2025-06-02 09:59:37] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:38] [INFO ] Deduced a trap composed of 3 places in 221 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:38] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:38] [INFO ] Deduced a trap composed of 41 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:39] [INFO ] Deduced a trap composed of 3 places in 527 ms of which 26 ms to minimize.
SMT process timed out in 10259ms, After SMT, problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 164 out of 1090 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1090/1090 places, 5200/5200 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 0 with 6 rules applied. Total rules applied 6 place count 1090 transition count 5194
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 14 place count 1084 transition count 5192
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 16 place count 1082 transition count 5192
Performed 229 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 229 Pre rules applied. Total rules applied 16 place count 1082 transition count 4963
Deduced a syphon composed of 229 places in 9 ms
Reduce places removed 229 places and 0 transitions.
Iterating global reduction 3 with 458 rules applied. Total rules applied 474 place count 853 transition count 4963
Discarding 78 places :
Symmetric choice reduction at 3 with 78 rule applications. Total rules 552 place count 775 transition count 4183
Iterating global reduction 3 with 78 rules applied. Total rules applied 630 place count 775 transition count 4183
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 750 place count 715 transition count 4123
Applied a total of 750 rules in 608 ms. Remains 715 /1090 variables (removed 375) and now considering 4123/5200 (removed 1077) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 615 ms. Remains : 715/1090 places, 4123/5200 transitions.
RANDOM walk for 40000 steps (8 resets) in 674 ms. (59 steps per ms) remains 10/11 properties
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 178530 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :5 out of 10
Probabilistic random walk after 178530 steps, saw 136323 distinct states, run finished after 3005 ms. (steps per millisecond=59 ) properties seen :5
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2023-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-02 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 09:59:43] [INFO ] Flow matrix only has 1253 transitions (discarded 2870 similar events)
// Phase 1: matrix 1253 rows 715 cols
[2025-06-02 09:59:43] [INFO ] Computed 31 invariants in 8 ms
[2025-06-02 09:59:43] [INFO ] State equation strengthened by 544 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/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 607/686 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19/705 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1253/1958 variables, 705/735 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1958 variables, 544/1279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1958 variables, 0/1279 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 10/1968 variables, 10/1289 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1968 variables, 1/1290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1968 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :4300 after 39492
At refinement iteration 11 (OVERLAPS) 0/1968 variables, 0/1290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1968/1968 variables, and 1290 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1666 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 715/715 constraints, ReadFeed: 544/544 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 607/686 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/686 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19/705 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:45] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:45] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 3 places in 194 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 16 places in 185 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:46] [INFO ] Deduced a trap composed of 3 places in 148 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 31 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 19 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 34 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:47] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:48] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:48] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/705 variables, 15/45 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:48] [INFO ] Deduced a trap composed of 11 places in 284 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:48] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:49] [INFO ] Deduced a trap composed of 14 places in 252 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:49] [INFO ] Deduced a trap composed of 26 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:49] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:49] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 14 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/705 variables, 6/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:49] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:50] [INFO ] Deduced a trap composed of 37 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:50] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:50] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:50] [INFO ] Deduced a trap composed of 44 places in 135 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/705 variables, 5/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:50] [INFO ] Deduced a trap composed of 57 places in 105 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/705 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:51] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:51] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 8 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/705 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:51] [INFO ] Deduced a trap composed of 52 places in 131 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/705 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1253/1958 variables, 705/765 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1958 variables, 544/1309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:52] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:52] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 7 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1958 variables, 2/1311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
SDD proceeding with computation,11 properties remain. new max is 32768
SDD size :39492 after 80899
At refinement iteration 14 (INCLUDED_ONLY) 0/1958 variables, 0/1311 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 10/1968 variables, 10/1321 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1968 variables, 1/1322 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1968 variables, 4/1326 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:54] [INFO ] Deduced a trap composed of 80 places in 388 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:55] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:55] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 11 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1968 variables, 3/1329 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:56] [INFO ] Deduced a trap composed of 59 places in 418 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:57] [INFO ] Deduced a trap composed of 59 places in 405 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:57] [INFO ] Deduced a trap composed of 59 places in 401 ms of which 56 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1968 variables, 3/1332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:58] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 09:59:58] [INFO ] Deduced a trap composed of 29 places in 380 ms of which 40 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1968 variables, 2/1334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1968 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1968 variables, 0/1334 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1968/1968 variables, and 1334 constraints, problems are : Problem set: 0 solved, 5 unsolved in 15693 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 715/715 constraints, ReadFeed: 544/544 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17417ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4081 ms.
Support contains 79 out of 715 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 715/715 places, 4123/4123 transitions.
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 38 Pre rules applied. Total rules applied 0 place count 715 transition count 4085
Deduced a syphon composed of 38 places in 3 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 0 with 76 rules applied. Total rules applied 76 place count 677 transition count 4085
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 670 transition count 4015
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 670 transition count 4015
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 110 place count 660 transition count 4005
Applied a total of 110 rules in 291 ms. Remains 660 /715 variables (removed 55) and now considering 4005/4123 (removed 118) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 660/715 places, 4005/4123 transitions.
RANDOM walk for 40000 steps (8 resets) in 258 ms. (154 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 203577 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :1 out of 5
Probabilistic random walk after 203577 steps, saw 148845 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :1
FORMULA EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 10:00:08] [INFO ] Flow matrix only has 1135 transitions (discarded 2870 similar events)
// Phase 1: matrix 1135 rows 660 cols
[2025-06-02 10:00:08] [INFO ] Computed 31 invariants in 8 ms
[2025-06-02 10:00:08] [INFO ] State equation strengthened by 481 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 554/631 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/631 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/650 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1135/1785 variables, 650/680 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1785 variables, 481/1161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1785 variables, 0/1161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/1795 variables, 10/1171 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1795 variables, 1/1172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1795 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1795 variables, 0/1172 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1795/1795 variables, and 1172 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 660/660 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 4/3 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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 554/631 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/631 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/650 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:10] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:10] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:10] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:10] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:10] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:10] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:11] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:11] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:11] [INFO ] Deduced a trap composed of 31 places in 167 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:11] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:11] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:11] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:12] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:12] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:12] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:12] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1135/1785 variables, 650/696 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1785 variables, 481/1177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:13] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1785 variables, 1/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:14] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 6 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1785 variables, 1/1179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1785 variables, 0/1179 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 10/1795 variables, 10/1189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1795 variables, 1/1190 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1795 variables, 3/1193 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:15] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1795 variables, 1/1194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:16] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1795 variables, 1/1195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1795 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:17] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 4 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/1795 variables, 1/1196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1795 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,11 properties remain. new max is 65536
SDD size :80899 after 220751
At refinement iteration 20 (OVERLAPS) 0/1795 variables, 0/1196 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1795/1795 variables, and 1196 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9055 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 660/660 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10507ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2220 ms.
Support contains 77 out of 660 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 660/660 places, 4005/4005 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 660 transition count 4003
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 658 transition count 4003
Applied a total of 4 rules in 227 ms. Remains 658 /660 variables (removed 2) and now considering 4003/4005 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 658/660 places, 4003/4005 transitions.
RANDOM walk for 40000 steps (8 resets) in 291 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 210342 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 4
Probabilistic random walk after 210342 steps, saw 153686 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) properties seen :0
[2025-06-02 10:00:24] [INFO ] Flow matrix only has 1133 transitions (discarded 2870 similar events)
// Phase 1: matrix 1133 rows 658 cols
[2025-06-02 10:00:24] [INFO ] Computed 31 invariants in 4 ms
[2025-06-02 10:00:24] [INFO ] State equation strengthened by 481 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 552/629 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/648 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1133/1781 variables, 648/678 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1781 variables, 481/1159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1781 variables, 0/1159 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10/1791 variables, 10/1169 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1791 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1791 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/1791 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1791/1791 variables, and 1170 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1353 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 658/658 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 4/3 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/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 552/629 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/629 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19/648 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 18 places in 119 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:26] [INFO ] Deduced a trap composed of 32 places in 89 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:27] [INFO ] Deduced a trap composed of 50 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:27] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:27] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:27] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:27] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:27] [INFO ] Deduced a trap composed of 25 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:27] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:28] [INFO ] Deduced a trap composed of 3 places in 181 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/648 variables, 12/42 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:28] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:28] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:28] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:28] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/648 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/648 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1133/1781 variables, 648/694 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1781 variables, 481/1175 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:29] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:29] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1781 variables, 2/1177 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:30] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1781 variables, 1/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1781 variables, 0/1178 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 10/1791 variables, 10/1188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1791 variables, 1/1189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1791 variables, 3/1192 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:32] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:32] [INFO ] Deduced a trap composed of 37 places in 87 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1791 variables, 2/1194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 10:00:33] [INFO ] Deduced a trap composed of 82 places in 396 ms of which 67 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1791 variables, 1/1195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1791 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/1791 variables, 0/1195 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1791/1791 variables, and 1195 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8724 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 658/658 constraints, ReadFeed: 481/481 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10111ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 2165 ms.
Support contains 77 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 4003/4003 transitions.
Applied a total of 0 rules in 162 ms. Remains 658 /658 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 658/658 places, 4003/4003 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 4003/4003 transitions.
Applied a total of 0 rules in 142 ms. Remains 658 /658 variables (removed 0) and now considering 4003/4003 (removed 0) transitions.
[2025-06-02 10:00:37] [INFO ] Flow matrix only has 1133 transitions (discarded 2870 similar events)
[2025-06-02 10:00:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:00:38] [INFO ] Implicit Places using invariants in 991 ms returned []
[2025-06-02 10:00:38] [INFO ] Flow matrix only has 1133 transitions (discarded 2870 similar events)
[2025-06-02 10:00:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 10:00:38] [INFO ] State equation strengthened by 481 read => feed constraints.
[2025-06-02 10:00:44] [INFO ] Implicit Places using invariants and state equation in 5832 ms returned []
Implicit Place search using SMT with State Equation took 6857 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 10:00:44] [INFO ] Redundant transitions in 264 ms returned []
Running 3993 sub problems to find dead transitions.
[2025-06-02 10:00:44] [INFO ] Flow matrix only has 1133 transitions (discarded 2870 similar events)
[2025-06-02 10:00:44] [INFO ] Invariant cache hit.
[2025-06-02 10:00:44] [INFO ] State equation strengthened by 481 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-14 is true.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 3993 unsolved
SMT process timed out in 32003ms, After SMT, problems are : Problem set: 0 solved, 3993 unsolved
Search for dead transitions found 0 dead transitions in 32020ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39308 ms. Remains : 658/658 places, 4003/4003 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2897 edges and 658 vertex of which 88 / 658 are part of one of the 10 SCC in 3 ms
Free SCC test removed 78 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2844 transitions
Reduce isomorphic transitions removed 3123 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 84 transitions
Trivial Post-agglo rules discarded 84 transitions
Performed 84 trivial Post agglomeration. Transition count delta: 84
Iterating post reduction 0 with 84 rules applied. Total rules applied 85 place count 580 transition count 796
Reduce places removed 84 places and 0 transitions.
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Iterating post reduction 1 with 98 rules applied. Total rules applied 183 place count 496 transition count 782
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 197 place count 482 transition count 782
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 197 place count 482 transition count 773
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 215 place count 473 transition count 773
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 230 place count 458 transition count 758
Iterating global reduction 3 with 15 rules applied. Total rules applied 245 place count 458 transition count 758
Performed 148 Post agglomeration using F-continuation condition.Transition count delta: 148
Deduced a syphon composed of 148 places in 0 ms
Reduce places removed 148 places and 0 transitions.
Iterating global reduction 3 with 296 rules applied. Total rules applied 541 place count 310 transition count 610
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 603 place count 310 transition count 548
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 611 place count 306 transition count 573
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 612 place count 306 transition count 572
Drop transitions (Redundant composition of simpler transitions.) removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 5 with 36 rules applied. Total rules applied 648 place count 306 transition count 536
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 652 place count 304 transition count 544
Free-agglomeration rule applied 68 times.
Iterating global reduction 5 with 68 rules applied. Total rules applied 720 place count 304 transition count 476
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 5 with 68 rules applied. Total rules applied 788 place count 236 transition count 476
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 790 place count 236 transition count 474
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 797 place count 236 transition count 474
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 798 place count 236 transition count 474
Applied a total of 798 rules in 100 ms. Remains 236 /658 variables (removed 422) and now considering 474/4003 (removed 3529) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 474 rows 236 cols
[2025-06-02 10:01:16] [INFO ] Computed 31 invariants in 2 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 10:01:16] [INFO ] After 61ms 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-02 10:01:16] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned sat
[2025-06-02 10:01:16] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 3 ms returned sat
[2025-06-02 10:01:16] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2025-06-02 10:01:16] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
SDD proceeding with computation,10 properties remain. new max is 65536
[2025-06-02 10:01:17] [INFO ] After 437ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2025-06-02 10:01:17] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:01:17] [INFO ] Flatten gal took : 15 ms
[2025-06-02 10:01:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1575645913878427213.gal : 4 ms
[2025-06-02 10:01:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3912105137997763479.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/ReachabilityCardinality1575645913878427213.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3912105137997763479.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 ...328
Loading property file /tmp/ReachabilityCardinality3912105137997763479.prop.
SDD size :220751 after 1.87863e+06
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 15
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :15 after 25
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :25 after 192
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :192 after 840
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :840 after 6300
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :6300 after 36027
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :36027 after 47235
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :47235 after 63153
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :63153 after 496860
Detected timeout of ITS tools.
[2025-06-02 10:01:32] [INFO ] Flatten gal took : 14 ms
[2025-06-02 10:01:32] [INFO ] Applying decomposition
[2025-06-02 10:01:32] [INFO ] Flatten gal took : 13 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/graph3939564259120242036.txt' '-o' '/tmp/graph3939564259120242036.bin' '-w' '/tmp/graph3939564259120242036.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3939564259120242036.bin' '-l' '-1' '-v' '-w' '/tmp/graph3939564259120242036.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:01:32] [INFO ] Decomposing Gal with order
[2025-06-02 10:01:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:01:32] [INFO ] Removed a total of 454 redundant transitions.
[2025-06-02 10:01:32] [INFO ] Flatten gal took : 66 ms
[2025-06-02 10:01:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 66 labels/synchronizations in 16 ms.
[2025-06-02 10:01:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13819556425028021481.gal : 6 ms
[2025-06-02 10:01:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1392031344978515143.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/ReachabilityCardinality13819556425028021481.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1392031344978515143.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/ReachabilityCardinality1392031344978515143.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 44
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :44 after 132
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :132 after 546
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :546 after 8736
Invariant property EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-08 does not hold.
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-05 is true.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :8736 after 9.62043e+08
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :9.62043e+08 after 8.06723e+09
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,1.05869e+14,0.116049,8340,295,81,6690,1331,1076,8565,196,4556,0
Total reachable state count : 105869316833280

Verifying 4 reachability properties.
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-05 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
EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-05,13,0.118661,8596,114,37,6690,1331,1153,8565,209,4556,375
Invariant property EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-08 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
EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-08,8.05493e+08,0.121586,8596,336,71,6690,1331,1211,8565,213,4556,750
Reachability property EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-09 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
EisenbergMcGuire-PT-10-ReachabilityCardinality-2024-09,4.2436e+08,0.122256,8596,180,63,6690,1331,1220,8565,214,4556,849
Invariant property EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-10 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
EisenbergMcGuire-PT-10-ReachabilityCardinality-2025-10,2.7058e+10,0.128049,8596,468,88,6690,1331,1285,8565,214,4556,1715
Over-approximation ignoring read arcs solved 0 properties in 16119 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 10:01:32] [INFO ] Flatten gal took : 157 ms
[2025-06-02 10:01:32] [INFO ] Applying decomposition
[2025-06-02 10:01:33] [INFO ] Flatten gal took : 153 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/graph8105290609630323513.txt' '-o' '/tmp/graph8105290609630323513.bin' '-w' '/tmp/graph8105290609630323513.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8105290609630323513.bin' '-l' '-1' '-v' '-w' '/tmp/graph8105290609630323513.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:01:33] [INFO ] Decomposing Gal with order
[2025-06-02 10:01:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:01:34] [INFO ] Removed a total of 10866 redundant transitions.
[2025-06-02 10:01:34] [INFO ] Flatten gal took : 437 ms
[2025-06-02 10:01:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 546 labels/synchronizations in 169 ms.
[2025-06-02 10:01:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5105935520149457837.gal : 34 ms
[2025-06-02 10:01:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5924550113009758827.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/ReachabilityCardinality5105935520149457837.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5924550113009758827.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 ...307
Loading property file /tmp/ReachabilityCardinality5924550113009758827.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 :1 after 1
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :2 after 16
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :16 after 65610
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :65610 after 68956
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :68956 after 352684
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :352684 after 1.38831e+06
Detected timeout of ITS tools.
[2025-06-02 10:31:38] [INFO ] Flatten gal took : 749 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7135503597513260968
[2025-06-02 10:31:38] [INFO ] Too many transitions (4003) to apply POR reductions. Disabling POR matrices.
[2025-06-02 10:31:38] [INFO ] Applying decomposition
[2025-06-02 10:31:39] [INFO ] Built C files in 533ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7135503597513260968
Running compilation step : cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 10:31:39] [INFO ] Flatten gal took : 638 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/graph11037626976824430766.txt' '-o' '/tmp/graph11037626976824430766.bin' '-w' '/tmp/graph11037626976824430766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11037626976824430766.bin' '-l' '-1' '-v' '-w' '/tmp/graph11037626976824430766.weights' '-q' '0' '-e' '0.001'
[2025-06-02 10:31:42] [INFO ] Decomposing Gal with order
[2025-06-02 10:31:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 10:31:43] [INFO ] Removed a total of 8795 redundant transitions.
[2025-06-02 10:31:43] [INFO ] Flatten gal took : 680 ms
[2025-06-02 10:32:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1117 labels/synchronizations in 184 ms.
[2025-06-02 10:32:17] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17772645028329990913.gal : 27 ms
[2025-06-02 10:32:17] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10918708893569466928.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/ReachabilityCardinality17772645028329990913.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10918708893569466928.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 ...309
Loading property file /tmp/ReachabilityCardinality10918708893569466928.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 49
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :49 after 85180
Compilation finished in 40367 ms.
Running link step : cd /tmp/ltsmin7135503597513260968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202405==true'
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :85180 after 2.51325e+06
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :2.51325e+06 after 7.66916e+06
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :7.66916e+06 after 1.35957e+07
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1.35957e+07 after 1.43203e+07
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :1.43203e+07 after 1.74036e+07
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202405==true'
Running LTSmin : cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202508==true'
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :1.74036e+07 after 9.33769e+07
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202508==true'
Running LTSmin : cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202409==true'
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :9.33769e+07 after 1.13043e+08
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202409==true'
Running LTSmin : cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202510==true'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202510==true'
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin7135503597513260968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'EisenbergMcGuirePT10ReachabilityCardinality202405==true'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="EisenbergMcGuire-PT-10"
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 EisenbergMcGuire-PT-10, 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 r072-tall-174860068200814"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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