MCC'2024- Execution of r472-tajo-171620399000201

About the Execution of LTSMin+red for BridgeAndVehicles-PT-V20P20N10

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
2596.212	288831.00	352065.00	145.40	TFTTF?F??TT?FT?T	normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399000201.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V20P20N10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399000201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K Apr 13 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 13 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 13 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 13 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 648K Apr 13 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 434K 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 BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717219943749

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P20N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:32:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:32:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:32:25] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 05:32:25] [INFO ] Transformed 68 places.
[2024-06-01 05:32:25] [INFO ] Transformed 548 transitions.
[2024-06-01 05:32:25] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 236 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 20 ms.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 68 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 548/548 transitions.
Applied a total of 0 rules in 16 ms. Remains 68 /68 variables (removed 0) and now considering 548/548 (removed 0) transitions.
Running 545 sub problems to find dead transitions.
[2024-06-01 05:32:25] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-06-01 05:32:25] [INFO ] Computed 7 invariants in 14 ms
[2024-06-01 05:32:25] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2024-06-01 05:32:29] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 9 ms to minimize.
[2024-06-01 05:32:30] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 1 ms to minimize.
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
[2024-06-01 05:32:31] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 1 ms to minimize.
Problem TDEAD88 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD297 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/10 constraints. Problems are: Problem set: 40 solved, 505 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 5 (OVERLAPS) 130/198 variables, 68/78 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 22/100 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/100 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/100 constraints. Problems are: Problem set: 42 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 100 constraints, problems are : Problem set: 42 solved, 503 unsolved in 12936 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 42 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 5/5 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 05:32:42] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 1/11 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 130/198 variables, 68/79 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 22/101 constraints. Problems are: Problem set: 42 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 503/604 constraints. Problems are: Problem set: 42 solved, 503 unsolved
[2024-06-01 05:32:51] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/605 constraints. Problems are: Problem set: 42 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 605 constraints, problems are : Problem set: 42 solved, 503 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 68/68 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 503/545 constraints, Known Traps: 5/5 constraints]
After SMT, in 34469ms problems are : Problem set: 42 solved, 503 unsolved
Search for dead transitions found 42 dead transitions in 34520ms
Found 42 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 42 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 42 transitions.
[2024-06-01 05:33:00] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-06-01 05:33:00] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 05:33:00] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 05:33:00] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:00] [INFO ] Invariant cache hit.
[2024-06-01 05:33:00] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:33:00] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/68 places, 506/548 transitions.
Applied a total of 0 rules in 6 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34851 ms. Remains : 68/68 places, 506/548 transitions.
Support contains 41 out of 68 places after structural reductions.
[2024-06-01 05:33:00] [INFO ] Flatten gal took : 93 ms
[2024-06-01 05:33:00] [INFO ] Flatten gal took : 48 ms
[2024-06-01 05:33:01] [INFO ] Input system was already deterministic with 506 transitions.
RANDOM walk for 40000 steps (224 resets) in 3803 ms. (10 steps per ms) remains 35/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 133 ms. (29 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 104 ms. (38 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4000 steps (8 resets) in 97 ms. (40 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 35/35 properties
[2024-06-01 05:33:02] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:02] [INFO ] Invariant cache hit.
[2024-06-01 05:33:02] [INFO ] State equation strengthened by 20 read => feed constraints.
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp49 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 17 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 17 solved, 18 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp50 is UNSAT
At refinement iteration 2 (OVERLAPS) 8/36 variables, 2/5 constraints. Problems are: Problem set: 21 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 21 solved, 14 unsolved
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp53 is UNSAT
At refinement iteration 4 (OVERLAPS) 32/68 variables, 4/9 constraints. Problems are: Problem set: 31 solved, 4 unsolved
[2024-06-01 05:33:03] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2024-06-01 05:33:03] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/11 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/79 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/99 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 0/99 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/194 variables, 0/99 constraints. Problems are: Problem set: 31 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 99 constraints, problems are : Problem set: 31 solved, 4 unsolved in 581 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 35/35 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 31 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 16/26 variables, 4/5 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 42/68 variables, 4/11 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/11 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/79 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/99 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 4/103 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/103 constraints. Problems are: Problem set: 31 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/103 constraints. Problems are: Problem set: 31 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 103 constraints, problems are : Problem set: 31 solved, 4 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/35 constraints, Known Traps: 2/2 constraints]
After SMT, in 1024ms problems are : Problem set: 31 solved, 4 unsolved
Parikh walk visited 0 properties in 994 ms.
Support contains 10 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 554 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 65 ms. Remains 67 /68 variables (removed 1) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:33:04] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 67 cols
[2024-06-01 05:33:04] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 05:33:05] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:07] [INFO ] Deduced a trap composed of 5 places in 90 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:11] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:15] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/193 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 98 constraints, problems are : Problem set: 0 solved, 503 unsolved in 16064 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 1/67 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/67 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/67 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/193 variables, 67/78 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/193 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 503/601 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:29] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/193 variables, 1/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/602 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/193 variables, and 602 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 36928ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 36953ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37020 ms. Remains : 67/68 places, 506/506 transitions.
RANDOM walk for 40000 steps (224 resets) in 577 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (83 resets) in 140 ms. (283 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 138 ms. (287 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (80 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (104 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 496469 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 4
Probabilistic random walk after 496469 steps, saw 123969 distinct states, run finished after 3006 ms. (steps per millisecond=165 ) properties seen :0
[2024-06-01 05:33:45] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:45] [INFO ] Invariant cache hit.
[2024-06-01 05:33:45] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 13/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/44 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 106/150 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 42/192 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/193 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/193 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/193 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 95 constraints, problems are : Problem set: 0 solved, 4 unsolved in 130 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 13/23 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 21/44 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 106/150 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 42/192 variables, 22/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/192 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/192 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/192 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/192 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/192 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/193 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/193 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 99 constraints, problems are : Problem set: 0 solved, 4 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 67/67 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 553ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 390 ms.
Support contains 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 25 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 67/67 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 506/506 transitions.
Applied a total of 0 rules in 23 ms. Remains 67 /67 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 05:33:46] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:46] [INFO ] Invariant cache hit.
[2024-06-01 05:33:46] [INFO ] Implicit Places using invariants in 153 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 171 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/67 places, 506/506 transitions.
Applied a total of 0 rules in 33 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 227 ms. Remains : 65/67 places, 506/506 transitions.
RANDOM walk for 40000 steps (224 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (84 resets) in 78 ms. (506 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (76 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (80 resets) in 63 ms. (625 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (104 resets) in 97 ms. (408 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 491318 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 4
Probabilistic random walk after 491318 steps, saw 122901 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-06-01 05:33:49] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 65 cols
[2024-06-01 05:33:49] [INFO ] Computed 6 invariants in 1 ms
[2024-06-01 05:33:49] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 32/42 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 106/149 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 41/190 variables, 21/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/190 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 10/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/191 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/191 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 91 constraints, problems are : Problem set: 0 solved, 4 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 32/42 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 1/43 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 106/149 variables, 43/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 10/58 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 41/190 variables, 21/80 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/190 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/190 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/190 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/190 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/191 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 95 constraints, problems are : Problem set: 0 solved, 4 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 459ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 563 ms.
Support contains 10 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 506/506 transitions.
Applied a total of 0 rules in 16 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 65/65 places, 506/506 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 506/506 transitions.
Applied a total of 0 rules in 14 ms. Remains 65 /65 variables (removed 0) and now considering 506/506 (removed 0) transitions.
[2024-06-01 05:33:50] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:50] [INFO ] Invariant cache hit.
[2024-06-01 05:33:51] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-01 05:33:51] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:51] [INFO ] Invariant cache hit.
[2024-06-01 05:33:51] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:33:51] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
[2024-06-01 05:33:51] [INFO ] Redundant transitions in 21 ms returned []
Running 503 sub problems to find dead transitions.
[2024-06-01 05:33:51] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
[2024-06-01 05:33:51] [INFO ] Invariant cache hit.
[2024-06-01 05:33:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:52] [INFO ] Deduced a trap composed of 5 places in 87 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:33:56] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/191 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:34:00] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2024-06-01 05:34:00] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 95 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14858 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (OVERLAPS) 1/65 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (OVERLAPS) 126/191 variables, 65/75 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 598 constraints, problems are : Problem set: 0 solved, 503 unsolved in 25938 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 4/4 constraints]
After SMT, in 41548ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 41556ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41832 ms. Remains : 65/65 places, 506/506 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 380 transitions
Reduce isomorphic transitions removed 380 transitions.
Iterating post reduction 0 with 380 rules applied. Total rules applied 380 place count 65 transition count 126
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 382 place count 65 transition count 124
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 384 place count 63 transition count 124
Applied a total of 384 rules in 38 ms. Remains 63 /65 variables (removed 2) and now considering 124/506 (removed 382) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 124 rows 63 cols
[2024-06-01 05:34:32] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:34:32] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-06-01 05:34:32] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-01 05:34:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:34:33] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-01 05:34:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 05:34:33] [INFO ] After 33ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-01 05:34:33] [INFO ] After 107ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-01 05:34:33] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 463 ms.
Successfully simplified 31 atomic propositions for a total of 13 simplifications.
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:34:33] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 05:34:33] [INFO ] Flatten gal took : 33 ms
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:34:33] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:34:33] [INFO ] Input system was already deterministic with 506 transitions.
Support contains 18 out of 68 places (down from 20) after GAL structural reductions.
Computed a total of 51 stabilizing places and 82 stable transitions
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 65 transition count 505
Applied a total of 3 rules in 37 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:34:33] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-06-01 05:34:33] [INFO ] Computed 7 invariants in 3 ms
[2024-06-01 05:34:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:34:35] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 502 unsolved in 8604 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/595 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:34:49] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 5 ms to minimize.
[2024-06-01 05:34:49] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 2/597 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 597 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 3/3 constraints]
After SMT, in 29408ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 29415ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 29455 ms. Remains : 65/68 places, 505/506 transitions.
[2024-06-01 05:35:02] [INFO ] Flatten gal took : 40 ms
[2024-06-01 05:35:02] [INFO ] Flatten gal took : 34 ms
[2024-06-01 05:35:02] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 65 transition count 505
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 65 transition count 505
Applied a total of 4 rules in 11 ms. Remains 65 /68 variables (removed 3) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:35:02] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 65 cols
[2024-06-01 05:35:02] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:35:03] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:35:05] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (OVERLAPS) 0/190 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 190/190 variables, and 93 constraints, problems are : Problem set: 0 solved, 502 unsolved in 9643 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 125/190 variables, 65/73 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 20/93 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 502/595 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:35:19] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 190/190 variables, and 596 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 65/65 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
After SMT, in 30597ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 30604ms
Finished structural reductions in LTL mode , in 1 iterations and 30621 ms. Remains : 65/68 places, 505/506 transitions.
[2024-06-01 05:35:33] [INFO ] Flatten gal took : 24 ms
[2024-06-01 05:35:33] [INFO ] Flatten gal took : 30 ms
[2024-06-01 05:35:33] [INFO ] Input system was already deterministic with 505 transitions.
Starting structural reductions in LTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 66 transition count 506
Applied a total of 2 rules in 4 ms. Remains 66 /68 variables (removed 2) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:35:33] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 66 cols
[2024-06-01 05:35:33] [INFO ] Computed 7 invariants in 2 ms
[2024-06-01 05:35:33] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:35] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 0/192 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 94 constraints, problems are : Problem set: 0 solved, 503 unsolved in 9408 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 126/192 variables, 66/74 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/192 variables, 20/94 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/192 variables, 503/597 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:35:50] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 1/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 192/192 variables, and 598 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 2/2 constraints]
After SMT, in 30467ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 30473ms
Finished structural reductions in LTL mode , in 1 iterations and 30478 ms. Remains : 66/68 places, 506/506 transitions.
[2024-06-01 05:36:04] [INFO ] Flatten gal took : 44 ms
[2024-06-01 05:36:04] [INFO ] Flatten gal took : 56 ms
[2024-06-01 05:36:04] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Applied a total of 0 rules in 41 ms. Remains 68 /68 variables (removed 0) and now considering 506/506 (removed 0) transitions.
Running 503 sub problems to find dead transitions.
[2024-06-01 05:36:04] [INFO ] Flow matrix only has 126 transitions (discarded 380 similar events)
// Phase 1: matrix 126 rows 68 cols
[2024-06-01 05:36:04] [INFO ] Computed 9 invariants in 2 ms
[2024-06-01 05:36:04] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:36:06] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:36:10] [INFO ] Deduced a trap composed of 6 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:36:10] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/80 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 503 unsolved
[2024-06-01 05:36:14] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-06-01 05:36:14] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 11 (OVERLAPS) 0/194 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 503 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 102 constraints, problems are : Problem set: 0 solved, 503 unsolved in 14994 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (OVERLAPS) 2/68 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 7 (OVERLAPS) 126/194 variables, 68/82 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 503/605 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 194/194 variables, and 605 constraints, problems are : Problem set: 0 solved, 503 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 68/68 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 5/5 constraints]
After SMT, in 35917ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 35922ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 35965 ms. Remains : 68/68 places, 506/506 transitions.
[2024-06-01 05:36:40] [INFO ] Flatten gal took : 23 ms
[2024-06-01 05:36:40] [INFO ] Flatten gal took : 22 ms
[2024-06-01 05:36:40] [INFO ] Input system was already deterministic with 506 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 68/68 places, 506/506 transitions.
Graph (complete) has 1139 edges and 68 vertex of which 67 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 66 transition count 505
Applied a total of 3 rules in 42 ms. Remains 66 /68 variables (removed 2) and now considering 505/506 (removed 1) transitions.
Running 502 sub problems to find dead transitions.
[2024-06-01 05:36:40] [INFO ] Flow matrix only has 125 transitions (discarded 380 similar events)
// Phase 1: matrix 125 rows 66 cols
[2024-06-01 05:36:40] [INFO ] Computed 8 invariants in 1 ms
[2024-06-01 05:36:40] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:36:42] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:36:45] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (OVERLAPS) 125/191 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 96 constraints, problems are : Problem set: 0 solved, 502 unsolved in 10980 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 502 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/65 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 4 (OVERLAPS) 1/66 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/66 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 8 (OVERLAPS) 125/191 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 502/598 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:37:03] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/599 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-06-01 05:37:06] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 1/600 constraints. Problems are: Problem set: 0 solved, 502 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 191/191 variables, and 600 constraints, problems are : Problem set: 0 solved, 502 unsolved in 20012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 66/66 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 502/502 constraints, Known Traps: 4/4 constraints]
After SMT, in 31718ms problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 31722ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 31765 ms. Remains : 66/68 places, 505/506 transitions.
[2024-06-01 05:37:12] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:37:12] [INFO ] Flatten gal took : 12 ms
[2024-06-01 05:37:12] [INFO ] Input system was already deterministic with 505 transitions.
[2024-06-01 05:37:12] [INFO ] Flatten gal took : 11 ms
[2024-06-01 05:37:12] [INFO ] Flatten gal took : 13 ms
[2024-06-01 05:37:12] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:37:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 506 transitions and 3742 arcs took 5 ms.
Total runtime 287013 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 : BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-14

BK_STOP 1717220232580

--------------------
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 BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/739/ctl_0_
ctl formula name BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/739/ctl_1_
ctl formula name BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/739/ctl_2_
ctl formula name BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/739/ctl_3_
ctl formula name BridgeAndVehicles-PT-V20P20N10-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/739/ctl_4_
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="BridgeAndVehicles-PT-V20P20N10"
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 BridgeAndVehicles-PT-V20P20N10, 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 r472-tajo-171620399000201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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