About the Execution of ITS-Tools for BridgeAndVehicles-PT-V50P50N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 208569.00 | 0.00 | 0.00 | ??????????F?F??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399100258.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 itstools
Input is BridgeAndVehicles-PT-V50P50N20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399100258
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 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 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 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 2.0M 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-V50P50N20-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716329787258
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 22:16:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:16:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:16:28] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2024-05-21 22:16:28] [INFO ] Transformed 138 places.
[2024-05-21 22:16:28] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:16:29] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 343 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 31 ms.
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 56 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:16:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:16:29] [INFO ] Computed 5 invariants in 16 ms
[2024-05-21 22:16:29] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:16:56] [INFO ] Deduced a trap composed of 5 places in 215 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20146 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 22:17:24] [INFO ] Deduced a trap composed of 25 places in 222 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 6 solved, 2339 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 56772ms problems are : Problem set: 6 solved, 2339 unsolved
Search for dead transitions found 6 dead transitions in 56834ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 6 transitions.
[2024-05-21 22:17:26] [INFO ] Flow matrix only has 290 transitions (discarded 2052 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:17:26] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 22:17:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-21 22:17:26] [INFO ] Flow matrix only has 290 transitions (discarded 2052 similar events)
[2024-05-21 22:17:26] [INFO ] Invariant cache hit.
[2024-05-21 22:17:26] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:17:26] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2342/2348 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2342/2342 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57181 ms. Remains : 136/138 places, 2342/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 22:17:27] [INFO ] Flatten gal took : 219 ms
[2024-05-21 22:17:27] [INFO ] Flatten gal took : 182 ms
[2024-05-21 22:17:28] [INFO ] Input system was already deterministic with 2342 transitions.
Reduction of identical properties reduced properties to check from 50 to 49
RANDOM walk for 40000 steps (92 resets) in 4223 ms. (9 steps per ms) remains 29/49 properties
BEST_FIRST walk for 4004 steps (8 resets) in 282 ms. (14 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 20 ms. (190 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4000 steps (8 resets) in 22 ms. (173 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 26/26 properties
[2024-05-21 22:17:29] [INFO ] Flow matrix only has 290 transitions (discarded 2052 similar events)
[2024-05-21 22:17:29] [INFO ] Invariant cache hit.
[2024-05-21 22:17:29] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/92 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 23 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 2 (OVERLAPS) 41/133 variables, 3/5 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 0/5 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 4 (OVERLAPS) 290/423 variables, 133/138 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 42/180 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/180 constraints. Problems are: Problem set: 4 solved, 22 unsolved
At refinement iteration 7 (OVERLAPS) 3/426 variables, 3/183 constraints. Problems are: Problem set: 4 solved, 22 unsolved
[2024-05-21 22:17:31] [INFO ] Deduced a trap composed of 26 places in 303 ms of which 3 ms to minimize.
[2024-05-21 22:17:32] [INFO ] Deduced a trap composed of 24 places in 294 ms of which 1 ms to minimize.
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 2/185 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/185 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/185 constraints. Problems are: Problem set: 6 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 185 constraints, problems are : Problem set: 6 solved, 20 unsolved in 4019 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 6 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 90/129 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 288/417 variables, 129/134 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 42/176 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/417 variables, 0/176 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 9/426 variables, 7/183 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 1/184 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 20/204 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 1/205 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/426 variables, 0/205 constraints. Problems are: Problem set: 6 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 205 constraints, problems are : Problem set: 6 solved, 20 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 20/26 constraints, Known Traps: 2/2 constraints]
After SMT, in 9391ms problems are : Problem set: 6 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2342/2342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2341
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2340
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 131 transition count 2338
Applied a total of 9 rules in 560 ms. Remains 131 /136 variables (removed 5) and now considering 2338/2342 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 561 ms. Remains : 131/136 places, 2338/2342 transitions.
RANDOM walk for 40000 steps (128 resets) in 971 ms. (41 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 139332 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :2 out of 20
Probabilistic random walk after 139332 steps, saw 47333 distinct states, run finished after 3004 ms. (steps per millisecond=46 ) properties seen :2
[2024-05-21 22:17:43] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
// Phase 1: matrix 286 rows 131 cols
[2024-05-21 22:17:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-21 22:17:43] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1935 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 195 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6782 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 8893ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 4503 ms.
Support contains 36 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2338/2338 transitions.
Applied a total of 0 rules in 219 ms. Remains 131 /131 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 131/131 places, 2338/2338 transitions.
RANDOM walk for 40000 steps (128 resets) in 674 ms. (59 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 168930 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 18
Probabilistic random walk after 168930 steps, saw 56056 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
[2024-05-21 22:18:00] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
[2024-05-21 22:18:00] [INFO ] Invariant cache hit.
[2024-05-21 22:18:00] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1961 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 18/195 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 195 constraints, problems are : Problem set: 0 solved, 18 unsolved in 6277 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 8432ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 1934 ms.
Support contains 36 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2338/2338 transitions.
Applied a total of 0 rules in 246 ms. Remains 131 /131 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 247 ms. Remains : 131/131 places, 2338/2338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2338/2338 transitions.
Applied a total of 0 rules in 208 ms. Remains 131 /131 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
[2024-05-21 22:18:11] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
[2024-05-21 22:18:11] [INFO ] Invariant cache hit.
[2024-05-21 22:18:11] [INFO ] Implicit Places using invariants in 211 ms returned []
[2024-05-21 22:18:11] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
[2024-05-21 22:18:11] [INFO ] Invariant cache hit.
[2024-05-21 22:18:11] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:18:12] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1344 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/131 places, 2338/2338 transitions.
Applied a total of 0 rules in 228 ms. Remains 129 /129 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1780 ms. Remains : 129/131 places, 2338/2338 transitions.
RANDOM walk for 40000 steps (128 resets) in 724 ms. (55 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4001 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 136710 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 18
Probabilistic random walk after 136710 steps, saw 46138 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-21 22:18:16] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
// Phase 1: matrix 286 rows 129 cols
[2024-05-21 22:18:16] [INFO ] Computed 4 invariants in 2 ms
[2024-05-21 22:18:16] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/415 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 175 constraints, problems are : Problem set: 0 solved, 18 unsolved in 1493 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 91/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 18/191 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/415 variables, 2/193 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 193 constraints, problems are : Problem set: 0 solved, 18 unsolved in 4787 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 6424ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 1775 ms.
Support contains 36 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2338/2338 transitions.
Applied a total of 0 rules in 210 ms. Remains 129 /129 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 129/129 places, 2338/2338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2338/2338 transitions.
Applied a total of 0 rules in 204 ms. Remains 129 /129 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
[2024-05-21 22:18:24] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
[2024-05-21 22:18:24] [INFO ] Invariant cache hit.
[2024-05-21 22:18:25] [INFO ] Implicit Places using invariants in 205 ms returned []
[2024-05-21 22:18:25] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
[2024-05-21 22:18:25] [INFO ] Invariant cache hit.
[2024-05-21 22:18:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:18:25] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 757 ms to find 0 implicit places.
[2024-05-21 22:18:25] [INFO ] Redundant transitions in 168 ms returned []
Running 2335 sub problems to find dead transitions.
[2024-05-21 22:18:25] [INFO ] Flow matrix only has 286 transitions (discarded 2052 similar events)
[2024-05-21 22:18:25] [INFO ] Invariant cache hit.
[2024-05-21 22:18:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2335 unsolved
[2024-05-21 22:19:00] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 1 ms to minimize.
Problem TDEAD363 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD552 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD636 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD678 is UNSAT
Problem TDEAD699 is UNSAT
Problem TDEAD720 is UNSAT
Problem TDEAD741 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD783 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD825 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD909 is UNSAT
Problem TDEAD930 is UNSAT
Problem TDEAD951 is UNSAT
Problem TDEAD972 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1140 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1182 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 129/415 variables, and 5 constraints, problems are : Problem set: 40 solved, 2295 unsolved in 30089 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2335/2335 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 40 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 4/4 constraints. Problems are: Problem set: 40 solved, 2295 unsolved
Problem TDEAD1203 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1266 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/129 variables, 1/5 constraints. Problems are: Problem set: 44 solved, 2291 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 129/415 variables, and 5 constraints, problems are : Problem set: 44 solved, 2291 unsolved in 30065 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/129 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2335 constraints, Known Traps: 1/1 constraints]
After SMT, in 80426ms problems are : Problem set: 44 solved, 2291 unsolved
Search for dead transitions found 44 dead transitions in 80462ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/129 places, 2294/2338 transitions.
Applied a total of 0 rules in 162 ms. Remains 129 /129 variables (removed 0) and now considering 2294/2294 (removed 0) transitions.
[2024-05-21 22:19:46] [INFO ] Redundant transitions in 76 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81931 ms. Remains : 129/129 places, 2294/2338 transitions.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:19:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-21 22:19:46] [INFO ] Flatten gal took : 135 ms
FORMULA BridgeAndVehicles-PT-V50P50N20-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 22:19:47] [INFO ] Flatten gal took : 154 ms
[2024-05-21 22:19:47] [INFO ] Input system was already deterministic with 2342 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2342/2342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2341
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2341
Applied a total of 2 rules in 48 ms. Remains 135 /136 variables (removed 1) and now considering 2341/2342 (removed 1) transitions.
Running 2338 sub problems to find dead transitions.
[2024-05-21 22:19:47] [INFO ] Flow matrix only has 289 transitions (discarded 2052 similar events)
// Phase 1: matrix 289 rows 135 cols
[2024-05-21 22:19:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 22:19:47] [INFO ] State equation strengthened by 42 read => feed constraints.
BK_STOP 1716329995827
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N20"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V50P50N20, 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 r048-tajo-171620399100258"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P50N20.tgz
mv BridgeAndVehicles-PT-V50P50N20 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 ;