Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505100062.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool itstools
Input is CANConstruction-PT-070, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100062
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.7M
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 20:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 12 20:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.3M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716228092242

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-070
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 18:01:33] [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]
[2024-05-20 18:01:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 18:01:34] [INFO ] Load time of PNML (sax parser for PT used): 589 ms
[2024-05-20 18:01:34] [INFO ] Transformed 10642 places.
[2024-05-20 18:01:34] [INFO ] Transformed 20160 transitions.
[2024-05-20 18:01:34] [INFO ] Parsed PT model containing 10642 places and 20160 transitions and 60200 arcs in 775 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (31 resets) in 4134 ms. (9 steps per ms) remains 11/16 properties
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 754 ms. (52 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 304 ms. (131 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 647 ms. (61 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 11/11 properties
[2024-05-20 18:01:36] [INFO ] Flatten gal took : 1409 ms
BEST_FIRST walk for 40004 steps (8 resets) in 514 ms. (77 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 11/11 properties
// Phase 1: matrix 20160 rows 10642 cols
[2024-05-20 18:01:37] [INFO ] Computed 141 invariants in 308 ms
[2024-05-20 18:01:37] [INFO ] Flatten gal took : 644 ms
[2024-05-20 18:01:37] [INFO ] State equation strengthened by 9730 read => feed constraints.
[2024-05-20 18:01:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6140091834752191049.gal : 422 ms
[2024-05-20 18:01:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13827664758855401889.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6140091834752191049.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13827664758855401889.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem CANConstruction-PT-070-ReachabilityCardinality-2024-10 is UNSAT
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 10409/10560 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10560 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Loading property file /tmp/ReachabilityCardinality13827664758855401889.prop.
At refinement iteration 3 (INCLUDED_ONLY) 0/10560 variables, 0/60 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 13/10573 variables, 13/73 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10573 variables, 0/73 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 68/10641 variables, 68/141 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 10641/30802 variables, and 141 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5118 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 0/10642 constraints, ReadFeed: 0/9730 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 10410/10560 variables, 58/58 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10560 variables, 2/60 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-05-20 18:02:03] [INFO ] Deduced a trap composed of 5 places in 19343 ms of which 425 ms to minimize.
SMT process timed out in 26775ms, After SMT, problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 150 out of 10642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10642/10642 places, 20160/20160 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 473 transitions
Trivial Post-agglo rules discarded 473 transitions
Performed 473 trivial Post agglomeration. Transition count delta: 473
Iterating post reduction 0 with 473 rules applied. Total rules applied 473 place count 10642 transition count 19687
Reduce places removed 473 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 476 rules applied. Total rules applied 949 place count 10169 transition count 19684
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 952 place count 10166 transition count 19684
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 952 place count 10166 transition count 19677
Deduced a syphon composed of 7 places in 37 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 966 place count 10159 transition count 19677
Discarding 4700 places :
Symmetric choice reduction at 3 with 4700 rule applications. Total rules 5666 place count 5459 transition count 10277
Iterating global reduction 3 with 4700 rules applied. Total rules applied 10366 place count 5459 transition count 10277
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 4 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 10492 place count 5396 transition count 10214
Free-agglomeration rule applied 63 times.
Iterating global reduction 3 with 63 rules applied. Total rules applied 10555 place count 5396 transition count 10151
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 10618 place count 5333 transition count 10151
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 10620 place count 5333 transition count 10149
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 10622 place count 5331 transition count 10149
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 5 with 81 rules applied. Total rules applied 10703 place count 5331 transition count 10149
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 10706 place count 5331 transition count 10149
Applied a total of 10706 rules in 7669 ms. Remains 5331 /10642 variables (removed 5311) and now considering 10149/20160 (removed 10011) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7686 ms. Remains : 5331/10642 places, 10149/20160 transitions.
RANDOM walk for 40000 steps (78 resets) in 1379 ms. (28 steps per ms) remains 4/10 properties
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 4/4 properties
// Phase 1: matrix 10149 rows 5331 cols
[2024-05-20 18:02:12] [INFO ] Computed 141 invariants in 80 ms
[2024-05-20 18:02:12] [INFO ] State equation strengthened by 9830 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5156/5243 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5243 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5243 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 18/5261 variables, 18/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5261 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 69/5330 variables, 69/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5330 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 10149/15479 variables, 5330/5471 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15479 variables, 9830/15301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15479 variables, 0/15301 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 1/15480 variables, 1/15302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/15480 variables, 0/15302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/15480 variables, 0/15302 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15480/15480 variables, and 15302 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9264 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 5331/5331 constraints, ReadFeed: 9830/9830 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 5156/5243 variables, 53/53 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5243 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-20 18:02:28] [INFO ] Deduced a trap composed of 2 places in 6218 ms of which 45 ms to minimize.
[2024-05-20 18:02:34] [INFO ] Deduced a trap composed of 2 places in 6378 ms of which 44 ms to minimize.
[2024-05-20 18:02:36] [INFO ] Deduced a trap composed of 81 places in 2070 ms of which 19 ms to minimize.
[2024-05-20 18:02:39] [INFO ] Deduced a trap composed of 75 places in 2173 ms of which 17 ms to minimize.
[2024-05-20 18:02:41] [INFO ] Deduced a trap composed of 77 places in 1919 ms of which 18 ms to minimize.
[2024-05-20 18:02:43] [INFO ] Deduced a trap composed of 76 places in 2299 ms of which 21 ms to minimize.
[2024-05-20 18:02:45] [INFO ] Deduced a trap composed of 73 places in 2050 ms of which 20 ms to minimize.
[2024-05-20 18:02:47] [INFO ] Deduced a trap composed of 80 places in 1895 ms of which 17 ms to minimize.
[2024-05-20 18:02:49] [INFO ] Deduced a trap composed of 83 places in 1901 ms of which 17 ms to minimize.
[2024-05-20 18:02:51] [INFO ] Deduced a trap composed of 79 places in 1988 ms of which 18 ms to minimize.
[2024-05-20 18:02:53] [INFO ] Deduced a trap composed of 73 places in 1759 ms of which 17 ms to minimize.
[2024-05-20 18:02:55] [INFO ] Deduced a trap composed of 76 places in 1926 ms of which 17 ms to minimize.
[2024-05-20 18:02:57] [INFO ] Deduced a trap composed of 75 places in 1826 ms of which 18 ms to minimize.
[2024-05-20 18:02:59] [INFO ] Deduced a trap composed of 76 places in 2315 ms of which 20 ms to minimize.
[2024-05-20 18:03:01] [INFO ] Deduced a trap composed of 73 places in 1994 ms of which 19 ms to minimize.
[2024-05-20 18:03:03] [INFO ] Deduced a trap composed of 83 places in 2034 ms of which 19 ms to minimize.
[2024-05-20 18:03:06] [INFO ] Deduced a trap composed of 73 places in 2112 ms of which 20 ms to minimize.
[2024-05-20 18:03:08] [INFO ] Deduced a trap composed of 73 places in 1912 ms of which 18 ms to minimize.
SMT process timed out in 56190ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 87 out of 5331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5331/5331 places, 10149/10149 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 5331 transition count 10147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 5329 transition count 10147
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 9 place count 5324 transition count 10137
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 5324 transition count 10137
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 58 place count 5302 transition count 10115
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 66 place count 5298 transition count 10116
Applied a total of 66 rules in 3227 ms. Remains 5298 /5331 variables (removed 33) and now considering 10116/10149 (removed 33) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3228 ms. Remains : 5298/5331 places, 10116/10149 transitions.
RANDOM walk for 40000 steps (78 resets) in 1480 ms. (27 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-070-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 3/3 properties
// Phase 1: matrix 10116 rows 5298 cols
[2024-05-20 18:03:12] [INFO ] Computed 141 invariants in 75 ms
[2024-05-20 18:03:12] [INFO ] State equation strengthened by 9860 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5146/5205 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5205 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5205 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/5228 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5228 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 69/5297 variables, 69/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5297 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10116/15413 variables, 5297/5438 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15413 variables, 9860/15298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15413 variables, 0/15298 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/15414 variables, 1/15299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/15414 variables, 0/15299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/15414 variables, 0/15299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15414/15414 variables, and 15299 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8491 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 5298/5298 constraints, ReadFeed: 9860/9860 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5146/5205 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5205 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:03:27] [INFO ] Deduced a trap composed of 2 places in 5797 ms of which 28 ms to minimize.
[2024-05-20 18:03:28] [INFO ] Deduced a trap composed of 75 places in 884 ms of which 13 ms to minimize.
[2024-05-20 18:03:28] [INFO ] Deduced a trap composed of 73 places in 832 ms of which 12 ms to minimize.
[2024-05-20 18:03:29] [INFO ] Deduced a trap composed of 76 places in 732 ms of which 10 ms to minimize.
[2024-05-20 18:03:30] [INFO ] Deduced a trap composed of 73 places in 691 ms of which 9 ms to minimize.
[2024-05-20 18:03:31] [INFO ] Deduced a trap composed of 73 places in 626 ms of which 10 ms to minimize.
[2024-05-20 18:03:31] [INFO ] Deduced a trap composed of 73 places in 653 ms of which 10 ms to minimize.
[2024-05-20 18:03:32] [INFO ] Deduced a trap composed of 73 places in 568 ms of which 9 ms to minimize.
[2024-05-20 18:03:33] [INFO ] Deduced a trap composed of 76 places in 538 ms of which 8 ms to minimize.
[2024-05-20 18:03:33] [INFO ] Deduced a trap composed of 73 places in 487 ms of which 8 ms to minimize.
[2024-05-20 18:03:34] [INFO ] Deduced a trap composed of 73 places in 560 ms of which 8 ms to minimize.
[2024-05-20 18:03:34] [INFO ] Deduced a trap composed of 73 places in 522 ms of which 8 ms to minimize.
[2024-05-20 18:03:35] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 7 ms to minimize.
[2024-05-20 18:03:35] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 7 ms to minimize.
[2024-05-20 18:03:36] [INFO ] Deduced a trap composed of 73 places in 477 ms of which 9 ms to minimize.
[2024-05-20 18:03:37] [INFO ] Deduced a trap composed of 73 places in 589 ms of which 14 ms to minimize.
[2024-05-20 18:03:37] [INFO ] Deduced a trap composed of 76 places in 508 ms of which 8 ms to minimize.
[2024-05-20 18:03:38] [INFO ] Deduced a trap composed of 75 places in 507 ms of which 8 ms to minimize.
[2024-05-20 18:03:38] [INFO ] Deduced a trap composed of 76 places in 370 ms of which 6 ms to minimize.
[2024-05-20 18:03:39] [INFO ] Deduced a trap composed of 73 places in 382 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5205 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:03:39] [INFO ] Deduced a trap composed of 73 places in 568 ms of which 10 ms to minimize.
[2024-05-20 18:03:40] [INFO ] Deduced a trap composed of 73 places in 545 ms of which 8 ms to minimize.
[2024-05-20 18:03:41] [INFO ] Deduced a trap composed of 75 places in 631 ms of which 9 ms to minimize.
[2024-05-20 18:03:41] [INFO ] Deduced a trap composed of 73 places in 493 ms of which 8 ms to minimize.
[2024-05-20 18:03:42] [INFO ] Deduced a trap composed of 73 places in 405 ms of which 7 ms to minimize.
[2024-05-20 18:03:42] [INFO ] Deduced a trap composed of 75 places in 482 ms of which 8 ms to minimize.
[2024-05-20 18:03:43] [INFO ] Deduced a trap composed of 75 places in 523 ms of which 7 ms to minimize.
[2024-05-20 18:03:43] [INFO ] Deduced a trap composed of 73 places in 504 ms of which 11 ms to minimize.
[2024-05-20 18:03:44] [INFO ] Deduced a trap composed of 73 places in 553 ms of which 7 ms to minimize.
[2024-05-20 18:03:45] [INFO ] Deduced a trap composed of 73 places in 582 ms of which 8 ms to minimize.
[2024-05-20 18:03:45] [INFO ] Deduced a trap composed of 73 places in 599 ms of which 8 ms to minimize.
[2024-05-20 18:03:46] [INFO ] Deduced a trap composed of 75 places in 627 ms of which 10 ms to minimize.
[2024-05-20 18:03:47] [INFO ] Deduced a trap composed of 73 places in 590 ms of which 8 ms to minimize.
[2024-05-20 18:03:47] [INFO ] Deduced a trap composed of 73 places in 537 ms of which 8 ms to minimize.
[2024-05-20 18:03:48] [INFO ] Deduced a trap composed of 73 places in 496 ms of which 7 ms to minimize.
[2024-05-20 18:03:48] [INFO ] Deduced a trap composed of 73 places in 535 ms of which 10 ms to minimize.
[2024-05-20 18:03:49] [INFO ] Deduced a trap composed of 73 places in 499 ms of which 14 ms to minimize.
[2024-05-20 18:03:50] [INFO ] Deduced a trap composed of 73 places in 542 ms of which 8 ms to minimize.
[2024-05-20 18:03:50] [INFO ] Deduced a trap composed of 73 places in 462 ms of which 7 ms to minimize.
[2024-05-20 18:03:51] [INFO ] Deduced a trap composed of 76 places in 401 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/5205 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:03:51] [INFO ] Deduced a trap composed of 76 places in 452 ms of which 7 ms to minimize.
[2024-05-20 18:03:52] [INFO ] Deduced a trap composed of 73 places in 364 ms of which 6 ms to minimize.
[2024-05-20 18:03:52] [INFO ] Deduced a trap composed of 76 places in 373 ms of which 7 ms to minimize.
[2024-05-20 18:03:53] [INFO ] Deduced a trap composed of 76 places in 372 ms of which 6 ms to minimize.
[2024-05-20 18:03:53] [INFO ] Deduced a trap composed of 73 places in 337 ms of which 7 ms to minimize.
[2024-05-20 18:03:53] [INFO ] Deduced a trap composed of 73 places in 340 ms of which 6 ms to minimize.
[2024-05-20 18:03:54] [INFO ] Deduced a trap composed of 73 places in 314 ms of which 5 ms to minimize.
[2024-05-20 18:03:54] [INFO ] Deduced a trap composed of 73 places in 312 ms of which 5 ms to minimize.
[2024-05-20 18:03:55] [INFO ] Deduced a trap composed of 76 places in 401 ms of which 7 ms to minimize.
[2024-05-20 18:03:55] [INFO ] Deduced a trap composed of 75 places in 413 ms of which 7 ms to minimize.
[2024-05-20 18:03:56] [INFO ] Deduced a trap composed of 76 places in 398 ms of which 6 ms to minimize.
[2024-05-20 18:03:56] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 6 ms to minimize.
[2024-05-20 18:03:56] [INFO ] Deduced a trap composed of 73 places in 349 ms of which 7 ms to minimize.
[2024-05-20 18:03:57] [INFO ] Deduced a trap composed of 73 places in 424 ms of which 7 ms to minimize.
[2024-05-20 18:03:57] [INFO ] Deduced a trap composed of 73 places in 415 ms of which 7 ms to minimize.
[2024-05-20 18:03:58] [INFO ] Deduced a trap composed of 73 places in 369 ms of which 7 ms to minimize.
[2024-05-20 18:03:58] [INFO ] Deduced a trap composed of 75 places in 384 ms of which 6 ms to minimize.
[2024-05-20 18:03:59] [INFO ] Deduced a trap composed of 73 places in 368 ms of which 6 ms to minimize.
[2024-05-20 18:03:59] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 6 ms to minimize.
[2024-05-20 18:04:00] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/5205 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:04:00] [INFO ] Deduced a trap composed of 73 places in 617 ms of which 9 ms to minimize.
[2024-05-20 18:04:01] [INFO ] Deduced a trap composed of 73 places in 627 ms of which 9 ms to minimize.
[2024-05-20 18:04:02] [INFO ] Deduced a trap composed of 73 places in 568 ms of which 9 ms to minimize.
[2024-05-20 18:04:02] [INFO ] Deduced a trap composed of 73 places in 518 ms of which 9 ms to minimize.
[2024-05-20 18:04:03] [INFO ] Deduced a trap composed of 73 places in 477 ms of which 8 ms to minimize.
[2024-05-20 18:04:03] [INFO ] Deduced a trap composed of 73 places in 528 ms of which 8 ms to minimize.
[2024-05-20 18:04:04] [INFO ] Deduced a trap composed of 73 places in 555 ms of which 8 ms to minimize.
[2024-05-20 18:04:05] [INFO ] Deduced a trap composed of 73 places in 485 ms of which 8 ms to minimize.
[2024-05-20 18:04:05] [INFO ] Deduced a trap composed of 73 places in 497 ms of which 8 ms to minimize.
[2024-05-20 18:04:06] [INFO ] Deduced a trap composed of 73 places in 440 ms of which 7 ms to minimize.
[2024-05-20 18:04:06] [INFO ] Deduced a trap composed of 73 places in 459 ms of which 8 ms to minimize.
[2024-05-20 18:04:07] [INFO ] Deduced a trap composed of 73 places in 380 ms of which 7 ms to minimize.
[2024-05-20 18:04:07] [INFO ] Deduced a trap composed of 73 places in 363 ms of which 7 ms to minimize.
[2024-05-20 18:04:07] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 9 ms to minimize.
[2024-05-20 18:04:08] [INFO ] Deduced a trap composed of 73 places in 317 ms of which 6 ms to minimize.
[2024-05-20 18:04:08] [INFO ] Deduced a trap composed of 73 places in 320 ms of which 6 ms to minimize.
[2024-05-20 18:04:09] [INFO ] Deduced a trap composed of 73 places in 498 ms of which 7 ms to minimize.
[2024-05-20 18:04:09] [INFO ] Deduced a trap composed of 73 places in 478 ms of which 8 ms to minimize.
[2024-05-20 18:04:10] [INFO ] Deduced a trap composed of 73 places in 438 ms of which 7 ms to minimize.
[2024-05-20 18:04:10] [INFO ] Deduced a trap composed of 73 places in 387 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/5205 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:04:11] [INFO ] Deduced a trap composed of 73 places in 594 ms of which 9 ms to minimize.
[2024-05-20 18:04:12] [INFO ] Deduced a trap composed of 73 places in 532 ms of which 8 ms to minimize.
[2024-05-20 18:04:12] [INFO ] Deduced a trap composed of 73 places in 486 ms of which 7 ms to minimize.
[2024-05-20 18:04:13] [INFO ] Deduced a trap composed of 73 places in 442 ms of which 8 ms to minimize.
[2024-05-20 18:04:13] [INFO ] Deduced a trap composed of 75 places in 534 ms of which 8 ms to minimize.
[2024-05-20 18:04:14] [INFO ] Deduced a trap composed of 73 places in 465 ms of which 7 ms to minimize.
[2024-05-20 18:04:14] [INFO ] Deduced a trap composed of 73 places in 489 ms of which 10 ms to minimize.
[2024-05-20 18:04:15] [INFO ] Deduced a trap composed of 73 places in 426 ms of which 7 ms to minimize.
[2024-05-20 18:04:15] [INFO ] Deduced a trap composed of 76 places in 558 ms of which 8 ms to minimize.
[2024-05-20 18:04:16] [INFO ] Deduced a trap composed of 73 places in 629 ms of which 8 ms to minimize.
[2024-05-20 18:04:17] [INFO ] Deduced a trap composed of 75 places in 610 ms of which 8 ms to minimize.
[2024-05-20 18:04:17] [INFO ] Deduced a trap composed of 76 places in 530 ms of which 8 ms to minimize.
[2024-05-20 18:04:18] [INFO ] Deduced a trap composed of 76 places in 534 ms of which 8 ms to minimize.
[2024-05-20 18:04:19] [INFO ] Deduced a trap composed of 73 places in 485 ms of which 8 ms to minimize.
[2024-05-20 18:04:19] [INFO ] Deduced a trap composed of 73 places in 498 ms of which 11 ms to minimize.
[2024-05-20 18:04:20] [INFO ] Deduced a trap composed of 73 places in 522 ms of which 8 ms to minimize.
[2024-05-20 18:04:20] [INFO ] Deduced a trap composed of 73 places in 500 ms of which 11 ms to minimize.
[2024-05-20 18:04:21] [INFO ] Deduced a trap composed of 76 places in 428 ms of which 7 ms to minimize.
[2024-05-20 18:04:21] [INFO ] Deduced a trap composed of 73 places in 465 ms of which 9 ms to minimize.
[2024-05-20 18:04:22] [INFO ] Deduced a trap composed of 73 places in 431 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5205 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:04:23] [INFO ] Deduced a trap composed of 73 places in 565 ms of which 8 ms to minimize.
[2024-05-20 18:04:23] [INFO ] Deduced a trap composed of 73 places in 463 ms of which 7 ms to minimize.
[2024-05-20 18:04:24] [INFO ] Deduced a trap composed of 76 places in 331 ms of which 6 ms to minimize.
[2024-05-20 18:04:24] [INFO ] Deduced a trap composed of 73 places in 563 ms of which 8 ms to minimize.
[2024-05-20 18:04:25] [INFO ] Deduced a trap composed of 73 places in 522 ms of which 8 ms to minimize.
[2024-05-20 18:04:25] [INFO ] Deduced a trap composed of 73 places in 489 ms of which 7 ms to minimize.
[2024-05-20 18:04:26] [INFO ] Deduced a trap composed of 73 places in 366 ms of which 6 ms to minimize.
[2024-05-20 18:04:26] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 6 ms to minimize.
[2024-05-20 18:04:27] [INFO ] Deduced a trap composed of 73 places in 287 ms of which 5 ms to minimize.
[2024-05-20 18:04:27] [INFO ] Deduced a trap composed of 73 places in 264 ms of which 5 ms to minimize.
[2024-05-20 18:04:28] [INFO ] Deduced a trap composed of 73 places in 615 ms of which 8 ms to minimize.
[2024-05-20 18:04:28] [INFO ] Deduced a trap composed of 79 places in 573 ms of which 8 ms to minimize.
[2024-05-20 18:04:29] [INFO ] Deduced a trap composed of 73 places in 467 ms of which 8 ms to minimize.
[2024-05-20 18:04:29] [INFO ] Deduced a trap composed of 73 places in 426 ms of which 6 ms to minimize.
[2024-05-20 18:04:30] [INFO ] Deduced a trap composed of 73 places in 545 ms of which 9 ms to minimize.
[2024-05-20 18:04:30] [INFO ] Deduced a trap composed of 76 places in 426 ms of which 7 ms to minimize.
[2024-05-20 18:04:31] [INFO ] Deduced a trap composed of 73 places in 388 ms of which 7 ms to minimize.
[2024-05-20 18:04:31] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 6 ms to minimize.
[2024-05-20 18:04:32] [INFO ] Deduced a trap composed of 73 places in 438 ms of which 7 ms to minimize.
[2024-05-20 18:04:32] [INFO ] Deduced a trap composed of 73 places in 396 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/5205 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:04:33] [INFO ] Deduced a trap composed of 73 places in 462 ms of which 7 ms to minimize.
[2024-05-20 18:04:33] [INFO ] Deduced a trap composed of 73 places in 379 ms of which 6 ms to minimize.
[2024-05-20 18:04:34] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 6 ms to minimize.
[2024-05-20 18:04:34] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 7 ms to minimize.
[2024-05-20 18:04:34] [INFO ] Deduced a trap composed of 73 places in 318 ms of which 5 ms to minimize.
[2024-05-20 18:04:35] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 7 ms to minimize.
[2024-05-20 18:04:36] [INFO ] Deduced a trap composed of 73 places in 436 ms of which 7 ms to minimize.
SMT process timed out in 84087ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 5298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5298/5298 places, 10116/10116 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 26 place count 5285 transition count 10103
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 27 place count 5285 transition count 10102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 28 place count 5284 transition count 10102
Applied a total of 28 rules in 2729 ms. Remains 5284 /5298 variables (removed 14) and now considering 10102/10116 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2729 ms. Remains : 5284/5298 places, 10102/10116 transitions.
RANDOM walk for 40000 steps (80 resets) in 1186 ms. (33 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 71429 steps, run timeout after 3001 ms. (steps per millisecond=23 ) properties seen :0 out of 3
Probabilistic random walk after 71429 steps, saw 61248 distinct states, run finished after 3015 ms. (steps per millisecond=23 ) properties seen :0
// Phase 1: matrix 10102 rows 5284 cols
[2024-05-20 18:04:42] [INFO ] Computed 141 invariants in 59 ms
[2024-05-20 18:04:42] [INFO ] State equation strengthened by 9872 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5132/5191 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5191 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5191 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/5214 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5214 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 69/5283 variables, 69/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/5283 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 10102/15385 variables, 5283/5424 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/15385 variables, 9872/15296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15385 variables, 0/15296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/15386 variables, 1/15297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/15386 variables, 0/15297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/15386 variables, 0/15297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15386/15386 variables, and 15297 constraints, problems are : Problem set: 0 solved, 3 unsolved in 8150 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 5284/5284 constraints, ReadFeed: 9872/9872 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5132/5191 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5191 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:04:57] [INFO ] Deduced a trap composed of 2 places in 6483 ms of which 31 ms to minimize.
[2024-05-20 18:05:04] [INFO ] Deduced a trap composed of 2 places in 6563 ms of which 29 ms to minimize.
[2024-05-20 18:05:05] [INFO ] Deduced a trap composed of 75 places in 1248 ms of which 14 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 72
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :72 after 73
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :73 after 75
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :75 after 78
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :78 after 84
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :84 after 95
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :95 after 117
[2024-05-20 18:05:07] [INFO ] Deduced a trap composed of 73 places in 1300 ms of which 14 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :117 after 143
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :143 after 154
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :154 after 166
[2024-05-20 18:05:08] [INFO ] Deduced a trap composed of 73 places in 1175 ms of which 12 ms to minimize.
[2024-05-20 18:05:09] [INFO ] Deduced a trap composed of 75 places in 1124 ms of which 12 ms to minimize.
[2024-05-20 18:05:10] [INFO ] Deduced a trap composed of 73 places in 1023 ms of which 12 ms to minimize.
[2024-05-20 18:05:11] [INFO ] Deduced a trap composed of 75 places in 941 ms of which 11 ms to minimize.
[2024-05-20 18:05:12] [INFO ] Deduced a trap composed of 73 places in 788 ms of which 10 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :166 after 190
[2024-05-20 18:05:13] [INFO ] Deduced a trap composed of 73 places in 714 ms of which 10 ms to minimize.
[2024-05-20 18:05:13] [INFO ] Deduced a trap composed of 76 places in 575 ms of which 9 ms to minimize.
[2024-05-20 18:05:14] [INFO ] Deduced a trap composed of 76 places in 544 ms of which 9 ms to minimize.
[2024-05-20 18:05:15] [INFO ] Deduced a trap composed of 73 places in 816 ms of which 11 ms to minimize.
[2024-05-20 18:05:16] [INFO ] Deduced a trap composed of 73 places in 657 ms of which 10 ms to minimize.
[2024-05-20 18:05:17] [INFO ] Deduced a trap composed of 75 places in 810 ms of which 11 ms to minimize.
[2024-05-20 18:05:17] [INFO ] Deduced a trap composed of 75 places in 738 ms of which 10 ms to minimize.
[2024-05-20 18:05:18] [INFO ] Deduced a trap composed of 75 places in 696 ms of which 10 ms to minimize.
[2024-05-20 18:05:19] [INFO ] Deduced a trap composed of 73 places in 598 ms of which 9 ms to minimize.
[2024-05-20 18:05:20] [INFO ] Deduced a trap composed of 73 places in 734 ms of which 10 ms to minimize.
[2024-05-20 18:05:20] [INFO ] Deduced a trap composed of 73 places in 547 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5191 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:05:21] [INFO ] Deduced a trap composed of 73 places in 1166 ms of which 12 ms to minimize.
[2024-05-20 18:05:23] [INFO ] Deduced a trap composed of 73 places in 1076 ms of which 26 ms to minimize.
[2024-05-20 18:05:24] [INFO ] Deduced a trap composed of 75 places in 962 ms of which 11 ms to minimize.
[2024-05-20 18:05:25] [INFO ] Deduced a trap composed of 75 places in 900 ms of which 10 ms to minimize.
[2024-05-20 18:05:26] [INFO ] Deduced a trap composed of 73 places in 1126 ms of which 12 ms to minimize.
[2024-05-20 18:05:27] [INFO ] Deduced a trap composed of 73 places in 875 ms of which 11 ms to minimize.
[2024-05-20 18:05:28] [INFO ] Deduced a trap composed of 73 places in 906 ms of which 10 ms to minimize.
[2024-05-20 18:05:29] [INFO ] Deduced a trap composed of 76 places in 970 ms of which 12 ms to minimize.
[2024-05-20 18:05:30] [INFO ] Deduced a trap composed of 75 places in 897 ms of which 11 ms to minimize.
[2024-05-20 18:05:31] [INFO ] Deduced a trap composed of 75 places in 715 ms of which 10 ms to minimize.
[2024-05-20 18:05:32] [INFO ] Deduced a trap composed of 73 places in 898 ms of which 11 ms to minimize.
[2024-05-20 18:05:32] [INFO ] Deduced a trap composed of 73 places in 825 ms of which 10 ms to minimize.
[2024-05-20 18:05:33] [INFO ] Deduced a trap composed of 75 places in 813 ms of which 10 ms to minimize.
[2024-05-20 18:05:34] [INFO ] Deduced a trap composed of 73 places in 656 ms of which 9 ms to minimize.
[2024-05-20 18:05:35] [INFO ] Deduced a trap composed of 75 places in 829 ms of which 10 ms to minimize.
[2024-05-20 18:05:36] [INFO ] Deduced a trap composed of 75 places in 671 ms of which 10 ms to minimize.
[2024-05-20 18:05:36] [INFO ] Deduced a trap composed of 75 places in 591 ms of which 9 ms to minimize.
[2024-05-20 18:05:37] [INFO ] Deduced a trap composed of 75 places in 558 ms of which 9 ms to minimize.
[2024-05-20 18:05:38] [INFO ] Deduced a trap composed of 73 places in 600 ms of which 9 ms to minimize.
[2024-05-20 18:05:38] [INFO ] Deduced a trap composed of 73 places in 605 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/5191 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:05:39] [INFO ] Deduced a trap composed of 75 places in 795 ms of which 11 ms to minimize.
[2024-05-20 18:05:40] [INFO ] Deduced a trap composed of 73 places in 641 ms of which 9 ms to minimize.
[2024-05-20 18:05:41] [INFO ] Deduced a trap composed of 75 places in 591 ms of which 8 ms to minimize.
[2024-05-20 18:05:41] [INFO ] Deduced a trap composed of 75 places in 629 ms of which 9 ms to minimize.
[2024-05-20 18:05:42] [INFO ] Deduced a trap composed of 75 places in 528 ms of which 9 ms to minimize.
[2024-05-20 18:05:43] [INFO ] Deduced a trap composed of 73 places in 560 ms of which 8 ms to minimize.
[2024-05-20 18:05:43] [INFO ] Deduced a trap composed of 75 places in 607 ms of which 9 ms to minimize.
[2024-05-20 18:05:44] [INFO ] Deduced a trap composed of 73 places in 548 ms of which 9 ms to minimize.
[2024-05-20 18:05:44] [INFO ] Deduced a trap composed of 75 places in 501 ms of which 8 ms to minimize.
[2024-05-20 18:05:45] [INFO ] Deduced a trap composed of 75 places in 533 ms of which 9 ms to minimize.
[2024-05-20 18:05:46] [INFO ] Deduced a trap composed of 75 places in 493 ms of which 8 ms to minimize.
[2024-05-20 18:05:46] [INFO ] Deduced a trap composed of 75 places in 525 ms of which 9 ms to minimize.
[2024-05-20 18:05:47] [INFO ] Deduced a trap composed of 73 places in 572 ms of which 9 ms to minimize.
[2024-05-20 18:05:47] [INFO ] Deduced a trap composed of 75 places in 515 ms of which 8 ms to minimize.
[2024-05-20 18:05:48] [INFO ] Deduced a trap composed of 73 places in 515 ms of which 9 ms to minimize.
[2024-05-20 18:05:49] [INFO ] Deduced a trap composed of 75 places in 539 ms of which 8 ms to minimize.
[2024-05-20 18:05:49] [INFO ] Deduced a trap composed of 75 places in 461 ms of which 7 ms to minimize.
[2024-05-20 18:05:50] [INFO ] Deduced a trap composed of 75 places in 478 ms of which 8 ms to minimize.
[2024-05-20 18:05:50] [INFO ] Deduced a trap composed of 75 places in 422 ms of which 7 ms to minimize.
[2024-05-20 18:05:51] [INFO ] Deduced a trap composed of 75 places in 450 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/5191 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:05:51] [INFO ] Deduced a trap composed of 73 places in 575 ms of which 9 ms to minimize.
[2024-05-20 18:05:52] [INFO ] Deduced a trap composed of 73 places in 497 ms of which 8 ms to minimize.
[2024-05-20 18:05:53] [INFO ] Deduced a trap composed of 73 places in 522 ms of which 9 ms to minimize.
[2024-05-20 18:05:53] [INFO ] Deduced a trap composed of 75 places in 489 ms of which 8 ms to minimize.
[2024-05-20 18:05:54] [INFO ] Deduced a trap composed of 76 places in 493 ms of which 8 ms to minimize.
[2024-05-20 18:05:54] [INFO ] Deduced a trap composed of 75 places in 456 ms of which 8 ms to minimize.
[2024-05-20 18:05:55] [INFO ] Deduced a trap composed of 75 places in 481 ms of which 8 ms to minimize.
[2024-05-20 18:05:55] [INFO ] Deduced a trap composed of 73 places in 466 ms of which 7 ms to minimize.
[2024-05-20 18:05:56] [INFO ] Deduced a trap composed of 75 places in 484 ms of which 8 ms to minimize.
[2024-05-20 18:05:57] [INFO ] Deduced a trap composed of 76 places in 448 ms of which 7 ms to minimize.
[2024-05-20 18:05:57] [INFO ] Deduced a trap composed of 73 places in 531 ms of which 9 ms to minimize.
[2024-05-20 18:05:58] [INFO ] Deduced a trap composed of 73 places in 453 ms of which 8 ms to minimize.
[2024-05-20 18:05:59] [INFO ] Deduced a trap composed of 75 places in 622 ms of which 10 ms to minimize.
[2024-05-20 18:05:59] [INFO ] Deduced a trap composed of 75 places in 843 ms of which 11 ms to minimize.
[2024-05-20 18:06:00] [INFO ] Deduced a trap composed of 73 places in 860 ms of which 11 ms to minimize.
[2024-05-20 18:06:01] [INFO ] Deduced a trap composed of 75 places in 780 ms of which 10 ms to minimize.
[2024-05-20 18:06:02] [INFO ] Deduced a trap composed of 73 places in 884 ms of which 11 ms to minimize.
[2024-05-20 18:06:03] [INFO ] Deduced a trap composed of 75 places in 890 ms of which 12 ms to minimize.
[2024-05-20 18:06:04] [INFO ] Deduced a trap composed of 75 places in 869 ms of which 12 ms to minimize.
[2024-05-20 18:06:05] [INFO ] Deduced a trap composed of 73 places in 737 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/5191 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:06:06] [INFO ] Deduced a trap composed of 76 places in 844 ms of which 10 ms to minimize.
[2024-05-20 18:06:07] [INFO ] Deduced a trap composed of 75 places in 732 ms of which 10 ms to minimize.
[2024-05-20 18:06:08] [INFO ] Deduced a trap composed of 75 places in 784 ms of which 10 ms to minimize.
[2024-05-20 18:06:08] [INFO ] Deduced a trap composed of 75 places in 724 ms of which 11 ms to minimize.
[2024-05-20 18:06:09] [INFO ] Deduced a trap composed of 75 places in 724 ms of which 11 ms to minimize.
[2024-05-20 18:06:10] [INFO ] Deduced a trap composed of 75 places in 733 ms of which 12 ms to minimize.
[2024-05-20 18:06:11] [INFO ] Deduced a trap composed of 73 places in 564 ms of which 8 ms to minimize.
[2024-05-20 18:06:11] [INFO ] Deduced a trap composed of 73 places in 507 ms of which 9 ms to minimize.
[2024-05-20 18:06:12] [INFO ] Deduced a trap composed of 75 places in 573 ms of which 9 ms to minimize.
[2024-05-20 18:06:12] [INFO ] Deduced a trap composed of 73 places in 524 ms of which 8 ms to minimize.
[2024-05-20 18:06:13] [INFO ] Deduced a trap composed of 75 places in 585 ms of which 9 ms to minimize.
[2024-05-20 18:06:14] [INFO ] Deduced a trap composed of 75 places in 478 ms of which 8 ms to minimize.
[2024-05-20 18:06:14] [INFO ] Deduced a trap composed of 75 places in 542 ms of which 8 ms to minimize.
[2024-05-20 18:06:15] [INFO ] Deduced a trap composed of 75 places in 444 ms of which 7 ms to minimize.
[2024-05-20 18:06:15] [INFO ] Deduced a trap composed of 76 places in 494 ms of which 8 ms to minimize.
[2024-05-20 18:06:16] [INFO ] Deduced a trap composed of 75 places in 472 ms of which 8 ms to minimize.
[2024-05-20 18:06:16] [INFO ] Deduced a trap composed of 75 places in 425 ms of which 7 ms to minimize.
[2024-05-20 18:06:17] [INFO ] Deduced a trap composed of 75 places in 453 ms of which 8 ms to minimize.
[2024-05-20 18:06:17] [INFO ] Deduced a trap composed of 75 places in 439 ms of which 8 ms to minimize.
[2024-05-20 18:06:18] [INFO ] Deduced a trap composed of 75 places in 444 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5191 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:06:19] [INFO ] Deduced a trap composed of 75 places in 695 ms of which 10 ms to minimize.
[2024-05-20 18:06:19] [INFO ] Deduced a trap composed of 75 places in 623 ms of which 9 ms to minimize.
[2024-05-20 18:06:20] [INFO ] Deduced a trap composed of 75 places in 557 ms of which 11 ms to minimize.
[2024-05-20 18:06:21] [INFO ] Deduced a trap composed of 75 places in 645 ms of which 8 ms to minimize.
SMT process timed out in 98936ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 5284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5284/5284 places, 10102/10102 transitions.
Applied a total of 0 rules in 882 ms. Remains 5284 /5284 variables (removed 0) and now considering 10102/10102 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 883 ms. Remains : 5284/5284 places, 10102/10102 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5284/5284 places, 10102/10102 transitions.
Applied a total of 0 rules in 876 ms. Remains 5284 /5284 variables (removed 0) and now considering 10102/10102 (removed 0) transitions.
[2024-05-20 18:06:23] [INFO ] Invariant cache hit.
[2024-05-20 18:06:27] [INFO ] Implicit Places using invariants in 4504 ms returned [5, 11, 17, 21, 25, 31, 35, 39, 43, 49, 55, 61, 67, 71, 75, 79, 83, 89, 95, 99, 105, 111, 117, 121, 125, 131, 137, 143, 147, 153, 157, 161, 167, 173, 177, 183, 187, 193, 197, 203, 207, 213, 219, 223, 229, 235, 239, 245, 251, 257, 263, 269, 273, 277, 283, 287, 293, 299, 303, 307, 318, 324, 328, 334, 340, 346, 350, 354, 360]
Discarding 69 places :
Implicit Place search using SMT only with invariants took 4520 ms to find 69 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 5215/5284 places, 10102/10102 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 5215 transition count 10079
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 5192 transition count 10079
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 2 with 100 rules applied. Total rules applied 146 place count 5142 transition count 10029
Applied a total of 146 rules in 2200 ms. Remains 5142 /5215 variables (removed 73) and now considering 10029/10102 (removed 73) transitions.
// Phase 1: matrix 10029 rows 5142 cols
[2024-05-20 18:06:29] [INFO ] Computed 72 invariants in 257 ms
[2024-05-20 18:06:33] [INFO ] Implicit Places using invariants in 4193 ms returned []
Implicit Place search using SMT only with invariants took 4196 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 5142/5284 places, 10029/10102 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 11795 ms. Remains : 5142/5284 places, 10029/10102 transitions.
RANDOM walk for 40000 steps (80 resets) in 994 ms. (40 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 106391 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 3
Probabilistic random walk after 106391 steps, saw 94467 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-20 18:06:37] [INFO ] Invariant cache hit.
[2024-05-20 18:06:37] [INFO ] State equation strengthened by 9767 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5059/5118 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5118 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5118 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 23/5141 variables, 23/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/5141 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 10029/15170 variables, 5141/5213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/15170 variables, 9767/14980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/15170 variables, 0/14980 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/15171 variables, 1/14981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/15171 variables, 0/14981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/15171 variables, 0/14981 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15171/15171 variables, and 14981 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7259 ms.
Refiners :[Positive P Invariants (semi-flows): 71/71 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 5142/5142 constraints, ReadFeed: 9767/9767 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 5059/5118 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5118 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:06:51] [INFO ] Deduced a trap composed of 2 places in 6119 ms of which 28 ms to minimize.
[2024-05-20 18:06:52] [INFO ] Deduced a trap composed of 73 places in 856 ms of which 11 ms to minimize.
[2024-05-20 18:06:53] [INFO ] Deduced a trap composed of 73 places in 798 ms of which 11 ms to minimize.
[2024-05-20 18:06:54] [INFO ] Deduced a trap composed of 73 places in 684 ms of which 9 ms to minimize.
[2024-05-20 18:06:54] [INFO ] Deduced a trap composed of 73 places in 625 ms of which 10 ms to minimize.
[2024-05-20 18:06:55] [INFO ] Deduced a trap composed of 73 places in 603 ms of which 16 ms to minimize.
[2024-05-20 18:06:56] [INFO ] Deduced a trap composed of 73 places in 684 ms of which 10 ms to minimize.
[2024-05-20 18:06:56] [INFO ] Deduced a trap composed of 73 places in 692 ms of which 9 ms to minimize.
SDD proceeding with computation,11 properties remain. new max is 8192
[2024-05-20 18:06:57] [INFO ] Deduced a trap composed of 73 places in 667 ms of which 10 ms to minimize.
SDD size :5111 after 5177
[2024-05-20 18:06:58] [INFO ] Deduced a trap composed of 73 places in 675 ms of which 10 ms to minimize.
[2024-05-20 18:06:59] [INFO ] Deduced a trap composed of 73 places in 617 ms of which 9 ms to minimize.
[2024-05-20 18:06:59] [INFO ] Deduced a trap composed of 73 places in 582 ms of which 9 ms to minimize.
[2024-05-20 18:07:00] [INFO ] Deduced a trap composed of 73 places in 549 ms of which 8 ms to minimize.
[2024-05-20 18:07:00] [INFO ] Deduced a trap composed of 73 places in 508 ms of which 8 ms to minimize.
[2024-05-20 18:07:01] [INFO ] Deduced a trap composed of 73 places in 524 ms of which 8 ms to minimize.
[2024-05-20 18:07:02] [INFO ] Deduced a trap composed of 73 places in 509 ms of which 9 ms to minimize.
[2024-05-20 18:07:02] [INFO ] Deduced a trap composed of 73 places in 401 ms of which 7 ms to minimize.
[2024-05-20 18:07:03] [INFO ] Deduced a trap composed of 73 places in 535 ms of which 8 ms to minimize.
[2024-05-20 18:07:03] [INFO ] Deduced a trap composed of 73 places in 467 ms of which 7 ms to minimize.
[2024-05-20 18:07:04] [INFO ] Deduced a trap composed of 73 places in 380 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/5118 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:07:05] [INFO ] Deduced a trap composed of 73 places in 884 ms of which 12 ms to minimize.
[2024-05-20 18:07:06] [INFO ] Deduced a trap composed of 73 places in 773 ms of which 11 ms to minimize.
[2024-05-20 18:07:06] [INFO ] Deduced a trap composed of 73 places in 890 ms of which 12 ms to minimize.
[2024-05-20 18:07:07] [INFO ] Deduced a trap composed of 73 places in 807 ms of which 11 ms to minimize.
[2024-05-20 18:07:08] [INFO ] Deduced a trap composed of 73 places in 842 ms of which 11 ms to minimize.
[2024-05-20 18:07:09] [INFO ] Deduced a trap composed of 73 places in 758 ms of which 10 ms to minimize.
[2024-05-20 18:07:10] [INFO ] Deduced a trap composed of 73 places in 705 ms of which 9 ms to minimize.
[2024-05-20 18:07:11] [INFO ] Deduced a trap composed of 73 places in 612 ms of which 9 ms to minimize.
[2024-05-20 18:07:11] [INFO ] Deduced a trap composed of 73 places in 601 ms of which 8 ms to minimize.
[2024-05-20 18:07:12] [INFO ] Deduced a trap composed of 73 places in 629 ms of which 9 ms to minimize.
[2024-05-20 18:07:13] [INFO ] Deduced a trap composed of 73 places in 634 ms of which 9 ms to minimize.
[2024-05-20 18:07:13] [INFO ] Deduced a trap composed of 75 places in 592 ms of which 9 ms to minimize.
[2024-05-20 18:07:14] [INFO ] Deduced a trap composed of 77 places in 574 ms of which 9 ms to minimize.
[2024-05-20 18:07:15] [INFO ] Deduced a trap composed of 76 places in 577 ms of which 9 ms to minimize.
[2024-05-20 18:07:15] [INFO ] Deduced a trap composed of 73 places in 565 ms of which 8 ms to minimize.
[2024-05-20 18:07:16] [INFO ] Deduced a trap composed of 73 places in 909 ms of which 11 ms to minimize.
[2024-05-20 18:07:17] [INFO ] Deduced a trap composed of 73 places in 897 ms of which 11 ms to minimize.
[2024-05-20 18:07:18] [INFO ] Deduced a trap composed of 73 places in 814 ms of which 10 ms to minimize.
[2024-05-20 18:07:19] [INFO ] Deduced a trap composed of 75 places in 696 ms of which 9 ms to minimize.
[2024-05-20 18:07:20] [INFO ] Deduced a trap composed of 73 places in 813 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/5118 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:07:21] [INFO ] Deduced a trap composed of 75 places in 754 ms of which 10 ms to minimize.
[2024-05-20 18:07:21] [INFO ] Deduced a trap composed of 73 places in 709 ms of which 10 ms to minimize.
[2024-05-20 18:07:22] [INFO ] Deduced a trap composed of 73 places in 608 ms of which 9 ms to minimize.
[2024-05-20 18:07:23] [INFO ] Deduced a trap composed of 73 places in 602 ms of which 9 ms to minimize.
[2024-05-20 18:07:23] [INFO ] Deduced a trap composed of 73 places in 608 ms of which 9 ms to minimize.
[2024-05-20 18:07:24] [INFO ] Deduced a trap composed of 73 places in 590 ms of which 10 ms to minimize.
[2024-05-20 18:07:25] [INFO ] Deduced a trap composed of 73 places in 606 ms of which 9 ms to minimize.
[2024-05-20 18:07:25] [INFO ] Deduced a trap composed of 73 places in 543 ms of which 8 ms to minimize.
[2024-05-20 18:07:26] [INFO ] Deduced a trap composed of 73 places in 529 ms of which 7 ms to minimize.
[2024-05-20 18:07:26] [INFO ] Deduced a trap composed of 73 places in 429 ms of which 8 ms to minimize.
[2024-05-20 18:07:27] [INFO ] Deduced a trap composed of 73 places in 445 ms of which 8 ms to minimize.
[2024-05-20 18:07:27] [INFO ] Deduced a trap composed of 73 places in 416 ms of which 7 ms to minimize.
[2024-05-20 18:07:28] [INFO ] Deduced a trap composed of 73 places in 441 ms of which 7 ms to minimize.
[2024-05-20 18:07:29] [INFO ] Deduced a trap composed of 73 places in 478 ms of which 8 ms to minimize.
[2024-05-20 18:07:29] [INFO ] Deduced a trap composed of 73 places in 511 ms of which 8 ms to minimize.
[2024-05-20 18:07:30] [INFO ] Deduced a trap composed of 74 places in 529 ms of which 8 ms to minimize.
[2024-05-20 18:07:30] [INFO ] Deduced a trap composed of 73 places in 478 ms of which 8 ms to minimize.
[2024-05-20 18:07:31] [INFO ] Deduced a trap composed of 73 places in 481 ms of which 8 ms to minimize.
[2024-05-20 18:07:31] [INFO ] Deduced a trap composed of 73 places in 381 ms of which 8 ms to minimize.
[2024-05-20 18:07:32] [INFO ] Deduced a trap composed of 73 places in 498 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/5118 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:07:33] [INFO ] Deduced a trap composed of 73 places in 620 ms of which 9 ms to minimize.
[2024-05-20 18:07:33] [INFO ] Deduced a trap composed of 73 places in 545 ms of which 9 ms to minimize.
[2024-05-20 18:07:34] [INFO ] Deduced a trap composed of 73 places in 509 ms of which 8 ms to minimize.
[2024-05-20 18:07:35] [INFO ] Deduced a trap composed of 73 places in 665 ms of which 9 ms to minimize.
[2024-05-20 18:07:35] [INFO ] Deduced a trap composed of 73 places in 541 ms of which 9 ms to minimize.
[2024-05-20 18:07:36] [INFO ] Deduced a trap composed of 73 places in 600 ms of which 9 ms to minimize.
[2024-05-20 18:07:37] [INFO ] Deduced a trap composed of 73 places in 619 ms of which 12 ms to minimize.
[2024-05-20 18:07:37] [INFO ] Deduced a trap composed of 73 places in 575 ms of which 8 ms to minimize.
[2024-05-20 18:07:38] [INFO ] Deduced a trap composed of 74 places in 615 ms of which 9 ms to minimize.
[2024-05-20 18:07:39] [INFO ] Deduced a trap composed of 73 places in 564 ms of which 8 ms to minimize.
[2024-05-20 18:07:39] [INFO ] Deduced a trap composed of 73 places in 466 ms of which 8 ms to minimize.
[2024-05-20 18:07:40] [INFO ] Deduced a trap composed of 73 places in 457 ms of which 8 ms to minimize.
[2024-05-20 18:07:40] [INFO ] Deduced a trap composed of 73 places in 515 ms of which 8 ms to minimize.
[2024-05-20 18:07:41] [INFO ] Deduced a trap composed of 73 places in 418 ms of which 8 ms to minimize.
[2024-05-20 18:07:41] [INFO ] Deduced a trap composed of 73 places in 440 ms of which 7 ms to minimize.
[2024-05-20 18:07:42] [INFO ] Deduced a trap composed of 73 places in 380 ms of which 6 ms to minimize.
[2024-05-20 18:07:42] [INFO ] Deduced a trap composed of 73 places in 411 ms of which 7 ms to minimize.
[2024-05-20 18:07:43] [INFO ] Deduced a trap composed of 73 places in 429 ms of which 7 ms to minimize.
[2024-05-20 18:07:43] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 7 ms to minimize.
[2024-05-20 18:07:44] [INFO ] Deduced a trap composed of 74 places in 323 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/5118 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:07:44] [INFO ] Deduced a trap composed of 73 places in 516 ms of which 9 ms to minimize.
[2024-05-20 18:07:45] [INFO ] Deduced a trap composed of 73 places in 766 ms of which 11 ms to minimize.
[2024-05-20 18:07:46] [INFO ] Deduced a trap composed of 73 places in 524 ms of which 8 ms to minimize.
[2024-05-20 18:07:46] [INFO ] Deduced a trap composed of 73 places in 529 ms of which 8 ms to minimize.
[2024-05-20 18:07:47] [INFO ] Deduced a trap composed of 76 places in 496 ms of which 8 ms to minimize.
[2024-05-20 18:07:48] [INFO ] Deduced a trap composed of 73 places in 494 ms of which 8 ms to minimize.
[2024-05-20 18:07:48] [INFO ] Deduced a trap composed of 73 places in 463 ms of which 8 ms to minimize.
[2024-05-20 18:07:49] [INFO ] Deduced a trap composed of 76 places in 475 ms of which 8 ms to minimize.
[2024-05-20 18:07:49] [INFO ] Deduced a trap composed of 73 places in 469 ms of which 8 ms to minimize.
[2024-05-20 18:07:50] [INFO ] Deduced a trap composed of 75 places in 441 ms of which 8 ms to minimize.
[2024-05-20 18:07:50] [INFO ] Deduced a trap composed of 73 places in 439 ms of which 8 ms to minimize.
[2024-05-20 18:07:51] [INFO ] Deduced a trap composed of 77 places in 614 ms of which 9 ms to minimize.
[2024-05-20 18:07:52] [INFO ] Deduced a trap composed of 73 places in 682 ms of which 10 ms to minimize.
[2024-05-20 18:07:52] [INFO ] Deduced a trap composed of 73 places in 565 ms of which 9 ms to minimize.
[2024-05-20 18:07:53] [INFO ] Deduced a trap composed of 74 places in 530 ms of which 8 ms to minimize.
[2024-05-20 18:07:54] [INFO ] Deduced a trap composed of 73 places in 642 ms of which 10 ms to minimize.
[2024-05-20 18:07:54] [INFO ] Deduced a trap composed of 73 places in 475 ms of which 8 ms to minimize.
[2024-05-20 18:07:55] [INFO ] Deduced a trap composed of 74 places in 453 ms of which 7 ms to minimize.
[2024-05-20 18:07:55] [INFO ] Deduced a trap composed of 74 places in 484 ms of which 8 ms to minimize.
[2024-05-20 18:07:56] [INFO ] Deduced a trap composed of 73 places in 439 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/5118 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:07:56] [INFO ] Deduced a trap composed of 73 places in 432 ms of which 8 ms to minimize.
[2024-05-20 18:07:57] [INFO ] Deduced a trap composed of 73 places in 468 ms of which 8 ms to minimize.
[2024-05-20 18:07:57] [INFO ] Deduced a trap composed of 73 places in 438 ms of which 7 ms to minimize.
[2024-05-20 18:07:58] [INFO ] Deduced a trap composed of 73 places in 437 ms of which 7 ms to minimize.
[2024-05-20 18:07:58] [INFO ] Deduced a trap composed of 73 places in 394 ms of which 7 ms to minimize.
[2024-05-20 18:07:59] [INFO ] Deduced a trap composed of 73 places in 399 ms of which 7 ms to minimize.
[2024-05-20 18:07:59] [INFO ] Deduced a trap composed of 73 places in 500 ms of which 8 ms to minimize.
[2024-05-20 18:08:00] [INFO ] Deduced a trap composed of 73 places in 518 ms of which 8 ms to minimize.
[2024-05-20 18:08:01] [INFO ] Deduced a trap composed of 73 places in 470 ms of which 8 ms to minimize.
[2024-05-20 18:08:01] [INFO ] Deduced a trap composed of 73 places in 484 ms of which 7 ms to minimize.
[2024-05-20 18:08:02] [INFO ] Deduced a trap composed of 73 places in 443 ms of which 7 ms to minimize.
[2024-05-20 18:08:02] [INFO ] Deduced a trap composed of 73 places in 440 ms of which 7 ms to minimize.
[2024-05-20 18:08:03] [INFO ] Deduced a trap composed of 73 places in 405 ms of which 7 ms to minimize.
[2024-05-20 18:08:03] [INFO ] Deduced a trap composed of 73 places in 383 ms of which 6 ms to minimize.
[2024-05-20 18:08:04] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 7 ms to minimize.
[2024-05-20 18:08:04] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 6 ms to minimize.
[2024-05-20 18:08:05] [INFO ] Deduced a trap composed of 73 places in 473 ms of which 7 ms to minimize.
[2024-05-20 18:08:05] [INFO ] Deduced a trap composed of 73 places in 391 ms of which 7 ms to minimize.
[2024-05-20 18:08:05] [INFO ] Deduced a trap composed of 73 places in 352 ms of which 7 ms to minimize.
[2024-05-20 18:08:06] [INFO ] Deduced a trap composed of 73 places in 406 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/5118 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:08:07] [INFO ] Deduced a trap composed of 73 places in 683 ms of which 10 ms to minimize.
[2024-05-20 18:08:07] [INFO ] Deduced a trap composed of 73 places in 492 ms of which 8 ms to minimize.
[2024-05-20 18:08:08] [INFO ] Deduced a trap composed of 73 places in 446 ms of which 7 ms to minimize.
[2024-05-20 18:08:08] [INFO ] Deduced a trap composed of 73 places in 395 ms of which 7 ms to minimize.
[2024-05-20 18:08:09] [INFO ] Deduced a trap composed of 73 places in 397 ms of which 7 ms to minimize.
[2024-05-20 18:08:09] [INFO ] Deduced a trap composed of 73 places in 364 ms of which 6 ms to minimize.
[2024-05-20 18:08:10] [INFO ] Deduced a trap composed of 73 places in 483 ms of which 7 ms to minimize.
[2024-05-20 18:08:10] [INFO ] Deduced a trap composed of 73 places in 436 ms of which 7 ms to minimize.
[2024-05-20 18:08:11] [INFO ] Deduced a trap composed of 73 places in 367 ms of which 7 ms to minimize.
[2024-05-20 18:08:11] [INFO ] Deduced a trap composed of 73 places in 427 ms of which 8 ms to minimize.
[2024-05-20 18:08:12] [INFO ] Deduced a trap composed of 73 places in 330 ms of which 6 ms to minimize.
[2024-05-20 18:08:12] [INFO ] Deduced a trap composed of 73 places in 435 ms of which 8 ms to minimize.
[2024-05-20 18:08:13] [INFO ] Deduced a trap composed of 73 places in 374 ms of which 7 ms to minimize.
[2024-05-20 18:08:13] [INFO ] Deduced a trap composed of 75 places in 339 ms of which 6 ms to minimize.
[2024-05-20 18:08:14] [INFO ] Deduced a trap composed of 73 places in 477 ms of which 7 ms to minimize.
[2024-05-20 18:08:14] [INFO ] Deduced a trap composed of 73 places in 399 ms of which 7 ms to minimize.
[2024-05-20 18:08:14] [INFO ] Deduced a trap composed of 73 places in 364 ms of which 6 ms to minimize.
[2024-05-20 18:08:15] [INFO ] Deduced a trap composed of 73 places in 345 ms of which 5 ms to minimize.
[2024-05-20 18:08:15] [INFO ] Deduced a trap composed of 74 places in 279 ms of which 5 ms to minimize.
[2024-05-20 18:08:16] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/5118 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:08:16] [INFO ] Deduced a trap composed of 73 places in 335 ms of which 7 ms to minimize.
[2024-05-20 18:08:17] [INFO ] Deduced a trap composed of 73 places in 373 ms of which 7 ms to minimize.
[2024-05-20 18:08:17] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 6 ms to minimize.
[2024-05-20 18:08:18] [INFO ] Deduced a trap composed of 73 places in 378 ms of which 7 ms to minimize.
[2024-05-20 18:08:18] [INFO ] Deduced a trap composed of 73 places in 308 ms of which 5 ms to minimize.
[2024-05-20 18:08:18] [INFO ] Deduced a trap composed of 73 places in 272 ms of which 5 ms to minimize.
[2024-05-20 18:08:19] [INFO ] Deduced a trap composed of 73 places in 279 ms of which 5 ms to minimize.
[2024-05-20 18:08:19] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 5 ms to minimize.
[2024-05-20 18:08:19] [INFO ] Deduced a trap composed of 73 places in 302 ms of which 6 ms to minimize.
[2024-05-20 18:08:20] [INFO ] Deduced a trap composed of 73 places in 265 ms of which 5 ms to minimize.
[2024-05-20 18:08:20] [INFO ] Deduced a trap composed of 73 places in 411 ms of which 7 ms to minimize.
[2024-05-20 18:08:21] [INFO ] Deduced a trap composed of 73 places in 371 ms of which 7 ms to minimize.
[2024-05-20 18:08:21] [INFO ] Deduced a trap composed of 73 places in 468 ms of which 7 ms to minimize.
[2024-05-20 18:08:22] [INFO ] Deduced a trap composed of 73 places in 419 ms of which 7 ms to minimize.
[2024-05-20 18:08:22] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 6 ms to minimize.
[2024-05-20 18:08:23] [INFO ] Deduced a trap composed of 73 places in 271 ms of which 6 ms to minimize.
[2024-05-20 18:08:23] [INFO ] Deduced a trap composed of 73 places in 377 ms of which 6 ms to minimize.
[2024-05-20 18:08:23] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 5 ms to minimize.
[2024-05-20 18:08:24] [INFO ] Deduced a trap composed of 73 places in 277 ms of which 5 ms to minimize.
[2024-05-20 18:08:24] [INFO ] Deduced a trap composed of 73 places in 247 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/5118 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-20 18:08:25] [INFO ] Deduced a trap composed of 73 places in 550 ms of which 8 ms to minimize.
[2024-05-20 18:08:25] [INFO ] Deduced a trap composed of 73 places in 500 ms of which 8 ms to minimize.
[2024-05-20 18:08:26] [INFO ] Deduced a trap composed of 73 places in 500 ms of which 8 ms to minimize.
[2024-05-20 18:08:26] [INFO ] Deduced a trap composed of 73 places in 399 ms of which 7 ms to minimize.
[2024-05-20 18:08:27] [INFO ] Deduced a trap composed of 73 places in 418 ms of which 8 ms to minimize.
[2024-05-20 18:08:27] [INFO ] Deduced a trap composed of 73 places in 396 ms of which 7 ms to minimize.
[2024-05-20 18:08:28] [INFO ] Deduced a trap composed of 73 places in 343 ms of which 6 ms to minimize.
[2024-05-20 18:08:28] [INFO ] Deduced a trap composed of 73 places in 297 ms of which 5 ms to minimize.
[2024-05-20 18:08:29] [INFO ] Deduced a trap composed of 73 places in 288 ms of which 5 ms to minimize.
[2024-05-20 18:08:29] [INFO ] Deduced a trap composed of 73 places in 302 ms of which 6 ms to minimize.
[2024-05-20 18:08:29] [INFO ] Deduced a trap composed of 73 places in 285 ms of which 5 ms to minimize.
SMT process timed out in 112469ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 5142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5142/5142 places, 10029/10029 transitions.
Applied a total of 0 rules in 1222 ms. Remains 5142 /5142 variables (removed 0) and now considering 10029/10029 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1222 ms. Remains : 5142/5142 places, 10029/10029 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5142/5142 places, 10029/10029 transitions.
SDD proceeding with computation,11 properties remain. new max is 16384
SDD size :5177 after 5315
Applied a total of 0 rules in 1195 ms. Remains 5142 /5142 variables (removed 0) and now considering 10029/10029 (removed 0) transitions.
[2024-05-20 18:08:32] [INFO ] Invariant cache hit.
[2024-05-20 18:08:36] [INFO ] Implicit Places using invariants in 3812 ms returned []
Implicit Place search using SMT only with invariants took 3813 ms to find 0 implicit places.
Running 9959 sub problems to find dead transitions.
[2024-05-20 18:08:36] [INFO ] Invariant cache hit.
[2024-05-20 18:08:36] [INFO ] State equation strengthened by 9767 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5141 variables, 71/71 constraints. Problems are: Problem set: 0 solved, 9959 unsolved
SMT process timed out in 44875ms, After SMT, problems are : Problem set: 0 solved, 9959 unsolved
Search for dead transitions found 0 dead transitions in 44998ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50042 ms. Remains : 5142/5142 places, 10029/10029 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 9710 edges and 5142 vertex of which 4772 / 5142 are part of one of the 68 SCC in 6 ms
Free SCC test removed 4704 places
Drop transitions (Empty/Sink Transition effects.) removed 9340 transitions
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 9376 transitions.
Graph (complete) has 892 edges and 438 vertex of which 324 are kept as prefixes of interest. Removing 114 places using SCC suffix rule.0 ms
Discarding 114 places :
Also discarding 44 output transitions
Drop transitions (Output transitions of discarded places.) removed 44 transitions
Drop transitions (Empty/Sink Transition effects.) removed 115 transitions
Reduce isomorphic transitions removed 115 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 252 rules applied. Total rules applied 254 place count 324 transition count 357
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 135 transitions
Reduce isomorphic transitions removed 135 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 273 rules applied. Total rules applied 527 place count 187 transition count 221
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 528 place count 186 transition count 221
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 528 place count 186 transition count 204
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 562 place count 169 transition count 204
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 563 place count 168 transition count 203
Iterating global reduction 3 with 1 rules applied. Total rules applied 564 place count 168 transition count 203
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 568 place count 166 transition count 201
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 570 place count 165 transition count 202
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 575 place count 165 transition count 197
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 580 place count 160 transition count 197
Partial Free-agglomeration rule applied 39 times.
Drop transitions (Partial Free agglomeration) removed 39 transitions
Iterating global reduction 4 with 39 rules applied. Total rules applied 619 place count 160 transition count 197
Discarding 37 places :
Symmetric choice reduction at 4 with 37 rule applications. Total rules 656 place count 123 transition count 160
Iterating global reduction 4 with 37 rules applied. Total rules applied 693 place count 123 transition count 160
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 701 place count 115 transition count 152
Applied a total of 701 rules in 80 ms. Remains 115 /5142 variables (removed 5027) and now considering 152/10029 (removed 9877) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 152 rows 115 cols
[2024-05-20 18:09:21] [INFO ] Computed 27 invariants in 1 ms
[2024-05-20 18:09:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-20 18:09:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 3 ms returned sat
[2024-05-20 18:09:21] [INFO ] [Nat]Absence check using 26 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 18:09:21] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-20 18:09:21] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:09:21] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2024-05-20 18:09:21] [INFO ] Flatten gal took : 4 ms
[2024-05-20 18:09:21] [INFO ] Flatten gal took : 3 ms
[2024-05-20 18:09:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18419318176951683329.gal : 1 ms
[2024-05-20 18:09:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9052399918332325818.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18419318176951683329.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9052399918332325818.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9052399918332325818.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 108
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :108 after 15552
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :15552 after 2.68739e+07
Detected timeout of ITS tools.
[2024-05-20 18:09:36] [INFO ] Flatten gal took : 3 ms
[2024-05-20 18:09:36] [INFO ] Applying decomposition
[2024-05-20 18:09:36] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2546121136739049751.txt' '-o' '/tmp/graph2546121136739049751.bin' '-w' '/tmp/graph2546121136739049751.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2546121136739049751.bin' '-l' '-1' '-v' '-w' '/tmp/graph2546121136739049751.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:09:36] [INFO ] Decomposing Gal with order
[2024-05-20 18:09:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:09:36] [INFO ] Removed a total of 4 redundant transitions.
[2024-05-20 18:09:36] [INFO ] Flatten gal took : 32 ms
[2024-05-20 18:09:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-20 18:09:36] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2791788757023789848.gal : 2 ms
[2024-05-20 18:09:36] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12501623960725677164.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2791788757023789848.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12501623960725677164.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12501623960725677164.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :6 after 54
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :54 after 3888
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :3888 after 1.34369e+07
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 30585 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2024-05-20 18:09:52] [INFO ] Flatten gal took : 529 ms
[2024-05-20 18:09:52] [INFO ] Applying decomposition
[2024-05-20 18:09:52] [INFO ] Flatten gal took : 490 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph5759196223655421927.txt' '-o' '/tmp/graph5759196223655421927.bin' '-w' '/tmp/graph5759196223655421927.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph5759196223655421927.bin' '-l' '-1' '-v' '-w' '/tmp/graph5759196223655421927.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:09:54] [INFO ] Decomposing Gal with order
[2024-05-20 18:09:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:09:57] [INFO ] Removed a total of 11931 redundant transitions.
[2024-05-20 18:09:57] [INFO ] Flatten gal took : 1345 ms
[2024-05-20 18:09:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1769 labels/synchronizations in 575 ms.
[2024-05-20 18:10:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13230985472850991914.gal : 144 ms
[2024-05-20 18:10:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10493142317366080270.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13230985472850991914.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10493142317366080270.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality10493142317366080270.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 40
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :40 after 45
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :45 after 54
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :54 after 70
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :70 after 81
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :81 after 85
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :85 after 89
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :89 after 91
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :91 after 93
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :93 after 97
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :97 after 101
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :101 after 113
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :113 after 193
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :193 after 8725
SDD proceeding with computation,3 properties remain. new max is 65536
SDD size :8725 after 12681
SDD proceeding with computation,3 properties remain. new max is 131072
SDD size :12681 after 401948
SDD proceeding with computation,3 properties remain. new max is 262144
SDD size :401948 after 565088
SDD proceeding with computation,3 properties remain. new max is 524288
SDD size :565088 after 670767
ITS-tools command line returned an error code 137
[2024-05-20 18:37:51] [INFO ] Flatten gal took : 215 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7006928080605417125
[2024-05-20 18:37:51] [INFO ] Too many transitions (10029) to apply POR reductions. Disabling POR matrices.
[2024-05-20 18:37:51] [INFO ] Applying decomposition
[2024-05-20 18:37:51] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7006928080605417125
Running compilation step : cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-20 18:37:52] [INFO ] Flatten gal took : 223 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12416857169136876080.txt' '-o' '/tmp/graph12416857169136876080.bin' '-w' '/tmp/graph12416857169136876080.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12416857169136876080.bin' '-l' '-1' '-v' '-w' '/tmp/graph12416857169136876080.weights' '-q' '0' '-e' '0.001'
[2024-05-20 18:37:52] [INFO ] Decomposing Gal with order
[2024-05-20 18:37:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 18:37:53] [INFO ] Removed a total of 9926 redundant transitions.
[2024-05-20 18:37:54] [INFO ] Flatten gal took : 1078 ms
[2024-05-20 18:37:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 9726 labels/synchronizations in 1084 ms.
[2024-05-20 18:37:55] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15683790730299582718.gal : 43 ms
[2024-05-20 18:37:55] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2438123949968648729.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15683790730299582718.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2438123949968648729.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2438123949968648729.prop.
Compilation finished in 73776 ms.
Running link step : cd /tmp/ltsmin7006928080605417125;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 114 ms.
Running LTSmin : cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT070ReachabilityCardinality202408==true'
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 255
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :255 after 389
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :389 after 662
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT070ReachabilityCardinality202408==true'
Running LTSmin : cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT070ReachabilityCardinality202409==true'
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :662 after 29344
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT070ReachabilityCardinality202409==true'
Running LTSmin : cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT070ReachabilityCardinality202313==true'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT070ReachabilityCardinality202313==true'
Retrying LTSmin with larger timeout 9600 s
Running LTSmin : cd /tmp/ltsmin7006928080605417125;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'CANConstructionPT070ReachabilityCardinality202408==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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="CANConstruction-PT-070"
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-5568"
echo " Executing tool itstools"
echo " Input is CANConstruction-PT-070, 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 r070-tall-171620505100062"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-070.tgz
mv CANConstruction-PT-070 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;