About the Execution of GreatSPN+red for BridgeAndVehicles-PT-V20P10N50
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15002.067 | 2237986.00 | 6187731.00 | 237.20 | ??FT??T??TFTFT?F | 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.r047-tajo-171620397700194.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 greatspnxred
Input is BridgeAndVehicles-PT-V20P10N50, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397700194
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02: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 8.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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 1.8M 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-V20P10N50-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716284965041
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:49:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 09:49:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:49:26] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-21 09:49:26] [INFO ] Transformed 108 places.
[2024-05-21 09:49:26] [INFO ] Transformed 2228 transitions.
[2024-05-21 09:49:26] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 59 ms.
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 106 transition count 2228
Applied a total of 2 rules in 37 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 09:49:27] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 09:49:27] [INFO ] Computed 5 invariants in 17 ms
[2024-05-21 09:49:27] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 09:49:50] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 25 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20115 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 09:50:19] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 55911ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 55968ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
[2024-05-21 09:50:23] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 09:50:23] [INFO ] Computed 5 invariants in 6 ms
[2024-05-21 09:50:23] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 09:50:23] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:50:23] [INFO ] Invariant cache hit.
[2024-05-21 09:50:23] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 09:50:23] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 15 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56312 ms. Remains : 106/108 places, 2208/2228 transitions.
Support contains 106 out of 106 places after structural reductions.
[2024-05-21 09:50:24] [INFO ] Flatten gal took : 370 ms
[2024-05-21 09:50:27] [INFO ] Flatten gal took : 450 ms
[2024-05-21 09:50:31] [INFO ] Input system was already deterministic with 2208 transitions.
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Reduction of identical properties reduced properties to check from 69 to 62
RANDOM walk for 40000 steps (228 resets) in 4001 ms. (9 steps per ms) remains 45/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 125 ms. (31 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 512 ms. (7 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4000 steps (8 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4001 steps (8 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 45/45 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 45/45 properties
[2024-05-21 09:50:33] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:50:33] [INFO ] Invariant cache hit.
[2024-05-21 09:50:33] [INFO ] State equation strengthened by 101 read => feed constraints.
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp65 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 2/2 constraints. Problems are: Problem set: 8 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/2 constraints. Problems are: Problem set: 8 solved, 37 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 2 (OVERLAPS) 7/103 variables, 3/5 constraints. Problems are: Problem set: 9 solved, 36 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 4 (OVERLAPS) 289/392 variables, 103/108 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/392 variables, 101/209 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-05-21 09:50:35] [INFO ] Deduced a trap composed of 5 places in 288 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/392 variables, 1/210 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/392 variables, 0/210 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 8 (OVERLAPS) 3/395 variables, 3/213 constraints. Problems are: Problem set: 9 solved, 36 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 0/213 constraints. Problems are: Problem set: 9 solved, 36 unsolved
[2024-05-21 09:50:39] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 1 ms to minimize.
SMT process timed out in 5667ms, After SMT, problems are : Problem set: 9 solved, 36 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 59 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 368 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 09:50:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-05-21 09:50:39] [INFO ] Computed 5 invariants in 11 ms
[2024-05-21 09:50:39] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 09:51:02] [INFO ] Deduced a trap composed of 5 places in 268 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56088ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56115ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56497 ms. Remains : 105/106 places, 2207/2208 transitions.
RANDOM walk for 40000 steps (228 resets) in 1035 ms. (38 steps per ms) remains 35/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 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 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 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 4004 steps (8 resets) in 27 ms. (143 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 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 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 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 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 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 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 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 35/35 properties
Interrupted probabilistic random walk after 133587 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :2 out of 35
Probabilistic random walk after 133587 steps, saw 37154 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :2
[2024-05-21 09:51:39] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 09:51:39] [INFO ] Invariant cache hit.
[2024-05-21 09:51:39] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 288/390 variables, 102/107 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 101/208 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 3/393 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 211 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2715 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 288/390 variables, 102/107 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 101/208 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 3/393 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 32/244 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 244 constraints, problems are : Problem set: 0 solved, 33 unsolved in 12866 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 15773ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 0 properties in 7766 ms.
Support contains 56 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2207/2207 transitions.
Applied a total of 0 rules in 243 ms. Remains 105 /105 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 105/105 places, 2207/2207 transitions.
RANDOM walk for 40000 steps (228 resets) in 800 ms. (49 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
Interrupted probabilistic random walk after 136825 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 33
Probabilistic random walk after 136825 steps, saw 37988 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-21 09:52:07] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 09:52:07] [INFO ] Invariant cache hit.
[2024-05-21 09:52:07] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 288/390 variables, 102/107 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 101/208 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (OVERLAPS) 3/393 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 0/393 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 393/393 variables, and 211 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2998 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 46/102 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 288/390 variables, 102/107 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 101/208 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/390 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 3/393 variables, 3/212 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/393 variables, 32/244 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/393 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/393 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 393/393 variables, and 244 constraints, problems are : Problem set: 0 solved, 33 unsolved in 12840 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 16114ms problems are : Problem set: 0 solved, 33 unsolved
Parikh walk visited 0 properties in 6363 ms.
Support contains 56 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2207/2207 transitions.
Applied a total of 0 rules in 268 ms. Remains 105 /105 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 268 ms. Remains : 105/105 places, 2207/2207 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2207/2207 transitions.
Applied a total of 0 rules in 152 ms. Remains 105 /105 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
[2024-05-21 09:52:30] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 09:52:30] [INFO ] Invariant cache hit.
[2024-05-21 09:52:30] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-21 09:52:30] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 09:52:30] [INFO ] Invariant cache hit.
[2024-05-21 09:52:30] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 09:52:31] [INFO ] Implicit Places using invariants and state equation in 861 ms returned [22]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1051 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 104/105 places, 2207/2207 transitions.
Applied a total of 0 rules in 159 ms. Remains 104 /104 variables (removed 0) and now considering 2207/2207 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1362 ms. Remains : 104/105 places, 2207/2207 transitions.
Successfully simplified 9 atomic propositions for a total of 15 simplifications.
[2024-05-21 09:52:31] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 09:52:31] [INFO ] Flatten gal took : 223 ms
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 09:52:34] [INFO ] Flatten gal took : 293 ms
[2024-05-21 09:52:36] [INFO ] Input system was already deterministic with 2208 transitions.
Computed a total of 49 stabilizing places and 84 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 11 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 09:52:36] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 09:52:36] [INFO ] Invariant cache hit.
[2024-05-21 09:52:36] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 09:52:58] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 55752ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 55772ms
Finished structural reductions in LTL mode , in 1 iterations and 55788 ms. Remains : 105/106 places, 2207/2208 transitions.
[2024-05-21 09:53:32] [INFO ] Flatten gal took : 98 ms
[2024-05-21 09:53:32] [INFO ] Flatten gal took : 154 ms
[2024-05-21 09:53:32] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 11 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 09:53:32] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 09:53:32] [INFO ] Invariant cache hit.
[2024-05-21 09:53:32] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 09:53:57] [INFO ] Deduced a trap composed of 5 places in 291 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 58907ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 58936ms
Finished structural reductions in LTL mode , in 1 iterations and 58953 ms. Remains : 105/106 places, 2207/2208 transitions.
[2024-05-21 09:54:31] [INFO ] Flatten gal took : 53 ms
[2024-05-21 09:54:31] [INFO ] Flatten gal took : 70 ms
[2024-05-21 09:54:31] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 427 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 09:54:32] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 09:54:32] [INFO ] Invariant cache hit.
[2024-05-21 09:54:32] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 09:54:56] [INFO ] Deduced a trap composed of 5 places in 297 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20059 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 58097ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 58118ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 58550 ms. Remains : 105/106 places, 2207/2208 transitions.
[2024-05-21 09:55:30] [INFO ] Flatten gal took : 80 ms
[2024-05-21 09:55:30] [INFO ] Flatten gal took : 92 ms
[2024-05-21 09:55:30] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-05-21 09:55:30] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 09:55:30] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 09:55:30] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-05-21 09:55:55] [INFO ] Deduced a trap composed of 5 places in 308 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 58333ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 58361ms
Finished structural reductions in LTL mode , in 1 iterations and 58375 ms. Remains : 106/106 places, 2208/2208 transitions.
[2024-05-21 09:56:29] [INFO ] Flatten gal took : 71 ms
[2024-05-21 09:56:29] [INFO ] Flatten gal took : 112 ms
[2024-05-21 09:56:29] [INFO ] Input system was already deterministic with 2208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-05-21 09:56:29] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:56:29] [INFO ] Invariant cache hit.
[2024-05-21 09:56:29] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-05-21 09:56:54] [INFO ] Deduced a trap composed of 5 places in 258 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20032 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 58550ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 58571ms
Finished structural reductions in LTL mode , in 1 iterations and 58582 ms. Remains : 106/106 places, 2208/2208 transitions.
[2024-05-21 09:57:28] [INFO ] Flatten gal took : 80 ms
[2024-05-21 09:57:28] [INFO ] Flatten gal took : 114 ms
[2024-05-21 09:57:28] [INFO ] Input system was already deterministic with 2208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 6 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-05-21 09:57:28] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:57:28] [INFO ] Invariant cache hit.
[2024-05-21 09:57:28] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-05-21 09:57:51] [INFO ] Deduced a trap composed of 5 places in 250 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 56641ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 56662ms
Finished structural reductions in LTL mode , in 1 iterations and 56673 ms. Remains : 106/106 places, 2208/2208 transitions.
[2024-05-21 09:58:25] [INFO ] Flatten gal took : 72 ms
[2024-05-21 09:58:25] [INFO ] Flatten gal took : 104 ms
[2024-05-21 09:58:25] [INFO ] Input system was already deterministic with 2208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 7 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Running 2205 sub problems to find dead transitions.
[2024-05-21 09:58:26] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:58:26] [INFO ] Invariant cache hit.
[2024-05-21 09:58:26] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-05-21 09:58:50] [INFO ] Deduced a trap composed of 5 places in 236 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/395 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 20042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2205 constraints, Known Traps: 1/1 constraints]
After SMT, in 58946ms problems are : Problem set: 0 solved, 2205 unsolved
Search for dead transitions found 0 dead transitions in 58979ms
Finished structural reductions in LTL mode , in 1 iterations and 58993 ms. Remains : 106/106 places, 2208/2208 transitions.
[2024-05-21 09:59:25] [INFO ] Flatten gal took : 161 ms
[2024-05-21 09:59:25] [INFO ] Flatten gal took : 262 ms
[2024-05-21 09:59:26] [INFO ] Input system was already deterministic with 2208 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 16 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 09:59:26] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
// Phase 1: matrix 288 rows 105 cols
[2024-05-21 09:59:26] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 09:59:26] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 09:59:51] [INFO ] Deduced a trap composed of 5 places in 314 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20038 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 58812ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 58845ms
Finished structural reductions in LTL mode , in 1 iterations and 58871 ms. Remains : 105/106 places, 2207/2208 transitions.
[2024-05-21 10:00:25] [INFO ] Flatten gal took : 65 ms
[2024-05-21 10:00:25] [INFO ] Flatten gal took : 73 ms
[2024-05-21 10:00:25] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2204
Applied a total of 9 rules in 363 ms. Remains 101 /106 variables (removed 5) and now considering 2204/2208 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 364 ms. Remains : 101/106 places, 2204/2208 transitions.
[2024-05-21 10:00:25] [INFO ] Flatten gal took : 56 ms
[2024-05-21 10:00:25] [INFO ] Flatten gal took : 69 ms
[2024-05-21 10:00:26] [INFO ] Input system was already deterministic with 2204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 6 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2204
Applied a total of 9 rules in 300 ms. Remains 101 /106 variables (removed 5) and now considering 2204/2208 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 301 ms. Remains : 101/106 places, 2204/2208 transitions.
[2024-05-21 10:00:26] [INFO ] Flatten gal took : 39 ms
[2024-05-21 10:00:26] [INFO ] Flatten gal took : 46 ms
[2024-05-21 10:00:26] [INFO ] Input system was already deterministic with 2204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 14 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 10:00:26] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 10:00:26] [INFO ] Invariant cache hit.
[2024-05-21 10:00:26] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 10:00:50] [INFO ] Deduced a trap composed of 5 places in 199 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 57993ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 58014ms
Finished structural reductions in LTL mode , in 1 iterations and 58033 ms. Remains : 105/106 places, 2207/2208 transitions.
[2024-05-21 10:01:24] [INFO ] Flatten gal took : 43 ms
[2024-05-21 10:01:24] [INFO ] Flatten gal took : 51 ms
[2024-05-21 10:01:24] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 12 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 10:01:24] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 10:01:24] [INFO ] Invariant cache hit.
[2024-05-21 10:01:24] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 10:01:47] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20028 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 57019ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 57044ms
Finished structural reductions in LTL mode , in 1 iterations and 57062 ms. Remains : 105/106 places, 2207/2208 transitions.
[2024-05-21 10:02:21] [INFO ] Flatten gal took : 43 ms
[2024-05-21 10:02:21] [INFO ] Flatten gal took : 50 ms
[2024-05-21 10:02:22] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Applied a total of 2 rules in 11 ms. Remains 105 /106 variables (removed 1) and now considering 2207/2208 (removed 1) transitions.
Running 2204 sub problems to find dead transitions.
[2024-05-21 10:02:22] [INFO ] Flow matrix only has 288 transitions (discarded 1919 similar events)
[2024-05-21 10:02:22] [INFO ] Invariant cache hit.
[2024-05-21 10:02:22] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
[2024-05-21 10:02:45] [INFO ] Deduced a trap composed of 5 places in 303 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2204/2204 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2204 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 105/393 variables, and 6 constraints, problems are : Problem set: 0 solved, 2204 unsolved in 20051 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 0/2204 constraints, Known Traps: 1/1 constraints]
After SMT, in 56889ms problems are : Problem set: 0 solved, 2204 unsolved
Search for dead transitions found 0 dead transitions in 56911ms
Finished structural reductions in LTL mode , in 1 iterations and 56928 ms. Remains : 105/106 places, 2207/2208 transitions.
[2024-05-21 10:03:19] [INFO ] Flatten gal took : 70 ms
[2024-05-21 10:03:19] [INFO ] Flatten gal took : 69 ms
[2024-05-21 10:03:19] [INFO ] Input system was already deterministic with 2207 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 2207
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 2207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 103 transition count 2206
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 101 transition count 2204
Applied a total of 9 rules in 376 ms. Remains 101 /106 variables (removed 5) and now considering 2204/2208 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 378 ms. Remains : 101/106 places, 2204/2208 transitions.
[2024-05-21 10:03:19] [INFO ] Flatten gal took : 55 ms
[2024-05-21 10:03:19] [INFO ] Flatten gal took : 55 ms
[2024-05-21 10:03:19] [INFO ] Input system was already deterministic with 2204 transitions.
[2024-05-21 10:03:20] [INFO ] Flatten gal took : 419 ms
[2024-05-21 10:03:23] [INFO ] Flatten gal took : 433 ms
[2024-05-21 10:03:26] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 153 ms.
[2024-05-21 10:03:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 2208 transitions and 17028 arcs took 27 ms.
Total runtime 840602 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BridgeAndVehicles-PT-V20P10N50
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 106
TRANSITIONS: 2208
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.115s, Sys 0.001s]
SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.010s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 765
MODEL NAME: /home/mcc/execution/416/model
106 places, 2208 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-CTLFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716287203027
--------------------
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 CTLFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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-V20P10N50"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BridgeAndVehicles-PT-V20P10N50, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620397700194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N50.tgz
mv BridgeAndVehicles-PT-V20P10N50 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;