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.r480-tall-171624189900729.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 ltsminxred
Input is DES-PT-50a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900729
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 08:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 08:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 08:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 97K 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 DES-PT-50a-CTLCardinality-2024-00
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-01
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-02
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-03
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-04
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-05
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-06
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-07
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-08
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-09
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-10
FORMULA_NAME DES-PT-50a-CTLCardinality-2024-11
FORMULA_NAME DES-PT-50a-CTLCardinality-2023-12
FORMULA_NAME DES-PT-50a-CTLCardinality-2023-13
FORMULA_NAME DES-PT-50a-CTLCardinality-2023-14
FORMULA_NAME DES-PT-50a-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717196744841

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 23:05:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 23:05:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 23:05:46] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-31 23:05:46] [INFO ] Transformed 314 places.
[2024-05-31 23:05:46] [INFO ] Transformed 271 transitions.
[2024-05-31 23:05:46] [INFO ] Found NUPN structural information;
[2024-05-31 23:05:46] [INFO ] Parsed PT model containing 314 places and 271 transitions and 1306 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 91 out of 314 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 32 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
// Phase 1: matrix 257 rows 314 cols
[2024-05-31 23:05:46] [INFO ] Computed 59 invariants in 38 ms
[2024-05-31 23:05:47] [INFO ] Implicit Places using invariants in 488 ms returned []
[2024-05-31 23:05:47] [INFO ] Invariant cache hit.
[2024-05-31 23:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-31 23:05:47] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2024-05-31 23:05:47] [INFO ] Invariant cache hit.
[2024-05-31 23:05:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 313/313 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 12/325 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/314 variables, 34/359 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 257/571 variables, 314/687 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/571 variables, 1/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (OVERLAPS) 0/571 variables, 0/688 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 688 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30017 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/313 variables, 313/313 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/313 variables, 12/325 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/313 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 1/314 variables, 34/359 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 13/373 constraints. Problems are: Problem set: 0 solved, 256 unsolved
[2024-05-31 23:06:20] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 14 ms to minimize.
[2024-05-31 23:06:21] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 2 ms to minimize.
[2024-05-31 23:06:22] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 3/376 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 257/571 variables, 314/690 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/571 variables, 1/691 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/571 variables, 256/947 constraints. Problems are: Problem set: 0 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 571/571 variables, and 947 constraints, problems are : Problem set: 0 solved, 256 unsolved in 30020 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 3/3 constraints]
After SMT, in 60351ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 60367ms
Finished structural reductions in LTL mode , in 1 iterations and 61827 ms. Remains : 314/314 places, 257/257 transitions.
Support contains 91 out of 314 places after structural reductions.
[2024-05-31 23:06:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 23:06:48] [INFO ] Flatten gal took : 54 ms
[2024-05-31 23:06:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-31 23:06:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA DES-PT-50a-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50a-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 23:06:48] [INFO ] Flatten gal took : 25 ms
FORMULA DES-PT-50a-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 23:06:48] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 83 out of 314 places (down from 91) after GAL structural reductions.
RANDOM walk for 40000 steps (879 resets) in 2278 ms. (17 steps per ms) remains 24/55 properties
BEST_FIRST walk for 4004 steps (18 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (16 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (19 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (18 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 39 ms. (100 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (15 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (18 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (18 resets) in 30 ms. (129 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (17 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (15 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (12 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4001 steps (20 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (19 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (14 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (18 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (20 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (20 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (14 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (19 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (16 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (18 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
[2024-05-31 23:06:49] [INFO ] Invariant cache hit.
[2024-05-31 23:06:49] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 42/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 7/49 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 70/119 variables, 31/83 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 70/153 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 149/268 variables, 22/176 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/268 variables, 149/325 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 6/274 variables, 2/327 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 24 unsolved
Problem AtomicPropp9 is UNSAT
At refinement iteration 15 (OVERLAPS) 256/530 variables, 274/607 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 1/608 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/530 variables, 0/608 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 41/571 variables, 40/648 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 40/688 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 0/688 constraints. Problems are: Problem set: 1 solved, 23 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 571/571 variables, and 688 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5008 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 6/41 variables, 2/37 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 6/43 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/43 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 72/113 variables, 32/75 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 72/147 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 154/267 variables, 22/170 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/267 variables, 154/324 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/267 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 6/273 variables, 2/326 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/273 variables, 6/332 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/273 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 15 (OVERLAPS) 256/529 variables, 273/605 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 1/606 constraints. Problems are: Problem set: 1 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 15/621 constraints. Problems are: Problem set: 1 solved, 23 unsolved
[2024-05-31 23:06:58] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:06:59] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/571 variables, and 623 constraints, problems are : Problem set: 1 solved, 23 unsolved in 5006 ms.
Refiners :[Domain max(s): 273/314 constraints, Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 273/314 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/24 constraints, Known Traps: 2/2 constraints]
After SMT, in 10030ms problems are : Problem set: 1 solved, 23 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 257/257 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 314 transition count 255
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 314 transition count 255
Applied a total of 8 rules in 46 ms. Remains 314 /314 variables (removed 0) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 314/314 places, 255/257 transitions.
RANDOM walk for 40000 steps (543 resets) in 643 ms. (62 steps per ms) remains 21/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (9 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 628058 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :0 out of 21
Probabilistic random walk after 628058 steps, saw 90435 distinct states, run finished after 3007 ms. (steps per millisecond=208 ) properties seen :0
// Phase 1: matrix 255 rows 314 cols
[2024-05-31 23:07:03] [INFO ] Computed 61 invariants in 7 ms
[2024-05-31 23:07:03] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 6/38 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 78/116 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 78/152 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 158/274 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 158/335 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 255/529 variables, 274/609 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 40/569 variables, 40/654 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/569 variables, 40/694 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (OVERLAPS) 0/569 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 694 constraints, problems are : Problem set: 0 solved, 21 unsolved in 10723 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 6/38 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 78/116 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 78/152 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 158/274 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 158/335 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 255/529 variables, 274/609 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 14/628 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:07:17] [INFO ] Deduced a trap composed of 13 places in 42 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-31 23:07:18] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 3/631 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:07:25] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:07:25] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:07:25] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-05-31 23:07:25] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:07:26] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 5/636 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:07:32] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 2/638 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (OVERLAPS) 40/569 variables, 40/678 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/569 variables, 40/718 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/569 variables, 7/725 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/569 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 23 (OVERLAPS) 0/569 variables, 0/725 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 725 constraints, problems are : Problem set: 0 solved, 21 unsolved in 45006 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 10/10 constraints]
After SMT, in 55745ms problems are : Problem set: 0 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 32 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 255/255 transitions.
Applied a total of 0 rules in 26 ms. Remains 314 /314 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 314/314 places, 255/255 transitions.
RANDOM walk for 40000 steps (532 resets) in 439 ms. (90 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (11 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 14 ms. (266 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (11 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (13 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (12 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 11 ms. (333 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (11 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 723527 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 21
Probabilistic random walk after 723527 steps, saw 104017 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
[2024-05-31 23:08:02] [INFO ] Invariant cache hit.
[2024-05-31 23:08:02] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 6/38 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 78/116 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 78/152 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (OVERLAPS) 158/274 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 158/335 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (OVERLAPS) 255/529 variables, 274/609 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/529 variables, 5/614 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/529 variables, 0/614 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (OVERLAPS) 40/569 variables, 40/654 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/569 variables, 40/694 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:08:10] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/569 variables, 1/695 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 2 ms to minimize.
[2024-05-31 23:08:12] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 10 places in 58 ms of which 2 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 2 ms to minimize.
[2024-05-31 23:08:13] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/569 variables, 6/701 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/569 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (OVERLAPS) 0/569 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 569/569 variables, and 701 constraints, problems are : Problem set: 0 solved, 21 unsolved in 19902 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 6/38 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 78/116 variables, 34/74 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/116 variables, 78/152 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/116 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/116 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/116 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 158/274 variables, 24/178 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 158/336 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/274 variables, 6/342 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 255/529 variables, 274/616 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/529 variables, 5/621 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/529 variables, 14/635 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
[2024-05-31 23:08:25] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:08:26] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 0 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 0 ms to minimize.
[2024-05-31 23:08:27] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/529 variables, 7/642 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:08:31] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
[2024-05-31 23:08:32] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/529 variables, 2/644 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/529 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 20 (OVERLAPS) 40/569 variables, 40/684 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/569 variables, 40/724 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/569 variables, 7/731 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:08:46] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/569 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/569 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 21 unsolved
[2024-05-31 23:08:57] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:08:59] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
At refinement iteration 25 (OVERLAPS) 0/569 variables, 2/734 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/569 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 27 (OVERLAPS) 0/569 variables, 0/734 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 569/569 variables, and 734 constraints, problems are : Problem set: 0 solved, 21 unsolved in 50414 ms.
Refiners :[Domain max(s): 314/314 constraints, Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 314/314 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 19/19 constraints]
After SMT, in 70326ms problems are : Problem set: 0 solved, 21 unsolved
Parikh walk visited 0 properties in 4784 ms.
Support contains 32 out of 314 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 314 /314 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 314/314 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 314/314 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 314 /314 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-31 23:09:17] [INFO ] Invariant cache hit.
[2024-05-31 23:09:17] [INFO ] Implicit Places using invariants in 278 ms returned [211]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 279 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 313/314 places, 255/255 transitions.
Applied a total of 0 rules in 12 ms. Remains 313 /313 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 306 ms. Remains : 313/314 places, 255/255 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
[2024-05-31 23:09:17] [INFO ] Flatten gal took : 20 ms
[2024-05-31 23:09:17] [INFO ] Flatten gal took : 21 ms
[2024-05-31 23:09:17] [INFO ] Input system was already deterministic with 257 transitions.
Computed a total of 217 stabilizing places and 211 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 14 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 313/314 places, 256/257 transitions.
[2024-05-31 23:09:17] [INFO ] Flatten gal took : 22 ms
[2024-05-31 23:09:17] [INFO ] Flatten gal took : 21 ms
[2024-05-31 23:09:17] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 311 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 311 transition count 255
Applied a total of 3 rules in 39 ms. Remains 311 /314 variables (removed 3) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 311/314 places, 255/257 transitions.
[2024-05-31 23:09:17] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:09:17] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:09:17] [INFO ] Input system was already deterministic with 255 transitions.
RANDOM walk for 40000 steps (921 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (176 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1483323 steps, run timeout after 3001 ms. (steps per millisecond=494 ) properties seen :0 out of 1
Probabilistic random walk after 1483323 steps, saw 207115 distinct states, run finished after 3001 ms. (steps per millisecond=494 ) properties seen :0
// Phase 1: matrix 255 rows 311 cols
[2024-05-31 23:09:20] [INFO ] Computed 58 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 37/204 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/241 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 199/449 variables, 250/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/463 variables, 8/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/463 variables, 3/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 53/516 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 50/566 variables, 50/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/566 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 369 constraints, problems are : Problem set: 0 solved, 1 unsolved in 302 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 166/167 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 37/204 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/204 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/241 variables, 24/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 199/449 variables, 250/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/463 variables, 8/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/463 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/463 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 53/516 variables, 3/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 1/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/516 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 50/566 variables, 50/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/566 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 370 constraints, problems are : Problem set: 0 solved, 1 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 645ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 549 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 255/255 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 311 transition count 253
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 311 transition count 253
Applied a total of 4 rules in 24 ms. Remains 311 /311 variables (removed 0) and now considering 253/255 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 311/311 places, 253/255 transitions.
RANDOM walk for 4000000 steps (65323 resets) in 17791 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000002 steps (11932 resets) in 6059 ms. (660 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9272397 steps, run timeout after 18001 ms. (steps per millisecond=515 ) properties seen :0 out of 1
Probabilistic random walk after 9272397 steps, saw 1126803 distinct states, run finished after 18001 ms. (steps per millisecond=515 ) properties seen :0
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:09:46] [INFO ] Computed 60 invariants in 14 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/462 variables, 8/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/515 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/564 variables, 49/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/462 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 52/515 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/564 variables, 49/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:09:47] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/564 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 646ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 533 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:09:48] [INFO ] Invariant cache hit.
[2024-05-31 23:09:48] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-31 23:09:48] [INFO ] Invariant cache hit.
[2024-05-31 23:09:48] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 511 ms to find 0 implicit places.
[2024-05-31 23:09:48] [INFO ] Redundant transitions in 11 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:09:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 2 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-31 23:09:55] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:09:56] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-31 23:09:58] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:10:02] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-31 23:10:04] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:10:06] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 55 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:10:11] [INFO ] Deduced a trap composed of 65 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:10:12] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-31 23:10:12] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2024-05-31 23:10:12] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-31 23:10:12] [INFO ] Deduced a trap composed of 16 places in 54 ms of which 2 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/564 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 250/634 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:10:34] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 635 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 15/15 constraints]
After SMT, in 60197ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60736 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 400000 steps (6503 resets) in 3916 ms. (102 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-31 23:10:50] [INFO ] Invariant cache hit.
[2024-05-31 23:10:50] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:10:50] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-31 23:10:50] [INFO ] After 90ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:10:50] [INFO ] After 115ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:10:50] [INFO ] After 208ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:10:50] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:10:50] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2024-05-31 23:10:50] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:10:50] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-31 23:10:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
TRAPS : Iteration 1
[2024-05-31 23:10:50] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:10:50] [INFO ] After 317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (65602 resets) in 17799 ms. (224 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000003 steps (11776 resets) in 5956 ms. (671 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 9118947 steps, run timeout after 18001 ms. (steps per millisecond=506 ) properties seen :0 out of 1
Probabilistic random walk after 9118947 steps, saw 1110460 distinct states, run finished after 18001 ms. (steps per millisecond=506 ) properties seen :0
[2024-05-31 23:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/462 variables, 8/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/515 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/564 variables, 49/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/462 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 52/515 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/564 variables, 49/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:11:15] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/564 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 352 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 706ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 534 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:11:16] [INFO ] Invariant cache hit.
[2024-05-31 23:11:16] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-31 23:11:16] [INFO ] Invariant cache hit.
[2024-05-31 23:11:17] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-31 23:11:17] [INFO ] Redundant transitions in 4 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:11:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:11:24] [INFO ] Deduced a trap composed of 6 places in 18 ms of which 0 ms to minimize.
[2024-05-31 23:11:27] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:11:31] [INFO ] Deduced a trap composed of 57 places in 82 ms of which 2 ms to minimize.
[2024-05-31 23:11:33] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:11:35] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:11:40] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 1 ms to minimize.
[2024-05-31 23:11:40] [INFO ] Deduced a trap composed of 65 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:11:41] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 1 ms to minimize.
[2024-05-31 23:11:41] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2024-05-31 23:11:41] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-31 23:11:41] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/564 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 250/634 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 634 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60193ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60720 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 400000 steps (6513 resets) in 1800 ms. (222 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-31 23:12:17] [INFO ] Invariant cache hit.
[2024-05-31 23:12:17] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:12:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-31 23:12:17] [INFO ] After 96ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:12:18] [INFO ] After 118ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:12:18] [INFO ] After 192ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:12:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:12:18] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:12:18] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:12:18] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 1 ms to minimize.
[2024-05-31 23:12:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
TRAPS : Iteration 1
[2024-05-31 23:12:18] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:12:18] [INFO ] After 295ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (650 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (106 resets) in 95 ms. (416 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1361500 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :0 out of 1
Probabilistic random walk after 1361500 steps, saw 190657 distinct states, run finished after 3001 ms. (steps per millisecond=453 ) properties seen :0
[2024-05-31 23:12:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/462 variables, 8/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/515 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/564 variables, 49/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/462 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 52/515 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/564 variables, 49/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:12:22] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/564 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 375 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 685ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 513 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 8 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 311/311 places, 253/253 transitions.
RANDOM walk for 40000 steps (654 resets) in 190 ms. (209 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (113 resets) in 72 ms. (547 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1402729 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1402729 steps, saw 196522 distinct states, run finished after 3001 ms. (steps per millisecond=467 ) properties seen :0
[2024-05-31 23:12:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/462 variables, 8/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/462 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/463 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 52/515 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/515 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 49/564 variables, 49/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/564 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 371 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 169/170 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/209 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 32/241 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/250 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 198/448 variables, 250/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/448 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 14/462 variables, 8/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 3/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/462 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/463 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/463 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/463 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 52/515 variables, 3/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/515 variables, 1/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/515 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 49/564 variables, 49/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 23:12:26] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/564 variables, 1/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/564 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 373 constraints, problems are : Problem set: 0 solved, 1 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 670ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 511 ms.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 18 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 311/311 places, 253/253 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 311/311 places, 253/253 transitions.
Applied a total of 0 rules in 7 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
[2024-05-31 23:12:26] [INFO ] Invariant cache hit.
[2024-05-31 23:12:27] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-05-31 23:12:27] [INFO ] Invariant cache hit.
[2024-05-31 23:12:27] [INFO ] Implicit Places using invariants and state equation in 376 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
[2024-05-31 23:12:27] [INFO ] Redundant transitions in 2 ms returned []
Running 250 sub problems to find dead transitions.
[2024-05-31 23:12:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/310 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 253/563 variables, 310/370 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:34] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-31 23:12:34] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-31 23:12:34] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 3/373 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:35] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2024-05-31 23:12:37] [INFO ] Deduced a trap composed of 9 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 9 (OVERLAPS) 1/564 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:42] [INFO ] Deduced a trap composed of 57 places in 78 ms of which 2 ms to minimize.
[2024-05-31 23:12:44] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/564 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:45] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 250 unsolved
[2024-05-31 23:12:51] [INFO ] Deduced a trap composed of 55 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:12:51] [INFO ] Deduced a trap composed of 65 places in 60 ms of which 1 ms to minimize.
[2024-05-31 23:12:52] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 1 ms to minimize.
[2024-05-31 23:12:52] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:12:52] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-31 23:12:52] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/564 variables, 6/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 564/564 variables, and 385 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 250 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 2/310 variables, 8/73 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 7 (OVERLAPS) 253/563 variables, 310/384 constraints. Problems are: Problem set: 0 solved, 250 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 250/634 constraints. Problems are: Problem set: 0 solved, 250 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 563/564 variables, and 634 constraints, problems are : Problem set: 0 solved, 250 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 310/311 constraints, PredecessorRefiner: 250/250 constraints, Known Traps: 14/14 constraints]
After SMT, in 60179ms problems are : Problem set: 0 solved, 250 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60756 ms. Remains : 311/311 places, 253/253 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 15 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 253 rows 311 cols
[2024-05-31 23:13:27] [INFO ] Computed 60 invariants in 3 ms
[2024-05-31 23:13:27] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-31 23:13:27] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-31 23:13:27] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:13:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:13:27] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2024-05-31 23:13:28] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:13:28] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:13:28] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 349 ms.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 311 transition count 253
Applied a total of 1 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-31 23:13:28] [INFO ] Invariant cache hit.
[2024-05-31 23:13:28] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:13:28] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2024-05-31 23:13:28] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 23:13:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-31 23:13:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2024-05-31 23:13:28] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-31 23:13:28] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-31 23:13:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
TRAPS : Iteration 1
[2024-05-31 23:13:28] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-31 23:13:28] [INFO ] After 344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 458 ms.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 9 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 313/314 places, 256/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 16 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 15 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 3 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 314/314 places, 257/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 13 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 13 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 312 transition count 256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 311 transition count 255
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 311 transition count 255
Applied a total of 3 rules in 17 ms. Remains 311 /314 variables (removed 3) and now considering 255/257 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 311/314 places, 255/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 255 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 2 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 314/314 places, 257/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 12 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 5 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 313/314 places, 256/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 11 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 12 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 313/314 places, 256/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 12 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 313/314 places, 256/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 12 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 313/314 places, 256/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 313 transition count 256
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 313 transition count 256
Applied a total of 2 rules in 6 ms. Remains 313 /314 variables (removed 1) and now considering 256/257 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 313/314 places, 256/257 transitions.
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:28] [INFO ] Input system was already deterministic with 256 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 2 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 314/314 places, 257/257 transitions.
[2024-05-31 23:13:29] [INFO ] Flatten gal took : 9 ms
[2024-05-31 23:13:29] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:29] [INFO ] Input system was already deterministic with 257 transitions.
Starting structural reductions in LTL mode, iteration 0 : 314/314 places, 257/257 transitions.
Applied a total of 0 rules in 2 ms. Remains 314 /314 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 314/314 places, 257/257 transitions.
[2024-05-31 23:13:29] [INFO ] Flatten gal took : 9 ms
[2024-05-31 23:13:29] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:29] [INFO ] Input system was already deterministic with 257 transitions.
[2024-05-31 23:13:29] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:29] [INFO ] Flatten gal took : 10 ms
[2024-05-31 23:13:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-31 23:13:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 314 places, 257 transitions and 1242 arcs took 3 ms.
Total runtime 462970 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-00
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-01
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-02
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-04
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-05
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-06
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-07
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-08
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-09
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2024-10
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2023-12
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2023-13
Could not compute solution for formula : DES-PT-50a-CTLCardinality-2023-14

BK_STOP 1717197209563

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name DES-PT-50a-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/929/ctl_0_
ctl formula name DES-PT-50a-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/929/ctl_1_
ctl formula name DES-PT-50a-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/929/ctl_2_
ctl formula name DES-PT-50a-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/929/ctl_3_
ctl formula name DES-PT-50a-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/929/ctl_4_
ctl formula name DES-PT-50a-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/929/ctl_5_
ctl formula name DES-PT-50a-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/929/ctl_6_
ctl formula name DES-PT-50a-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/929/ctl_7_
ctl formula name DES-PT-50a-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/929/ctl_8_
ctl formula name DES-PT-50a-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/929/ctl_9_
ctl formula name DES-PT-50a-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/929/ctl_10_
ctl formula name DES-PT-50a-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/929/ctl_11_
ctl formula name DES-PT-50a-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/929/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="DES-PT-50a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DES-PT-50a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r480-tall-171624189900729"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50a.tgz
mv DES-PT-50a execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;