fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399200274
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BridgeAndVehicles-PT-V80P20N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 248374.00 0.00 0.00 [undef] Cannot compute

Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399200274.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-V80P20N10, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200274
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.3M
-rw-r--r-- 1 mcc users 23K Apr 13 01:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 13 01:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 330K Apr 13 00:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 00:59 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 13K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 334K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 13 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 93K Apr 13 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 885K Apr 13 01:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.4M Apr 13 01:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K 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 1.7M 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-V80P20N10-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P20N10-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716330342140

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-V80P20N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 22:25:43] [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:25:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:25:43] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-05-21 22:25:43] [INFO ] Transformed 188 places.
[2024-05-21 22:25:43] [INFO ] Transformed 2108 transitions.
[2024-05-21 22:25:43] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 300 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 64 ms.
Support contains 186 out of 188 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 2108
Applied a total of 2 rules in 52 ms. Remains 186 /188 variables (removed 2) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 22:25:44] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 186 cols
[2024-05-21 22:25:44] [INFO ] Computed 5 invariants in 19 ms
[2024-05-21 22:25:44] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 5 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20187 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:26:34] [INFO ] Deduced a trap composed of 5 places in 292 ms of which 12 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 55457ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 55514ms
[2024-05-21 22:26:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:39] [INFO ] Invariant cache hit.
[2024-05-21 22:26:39] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 22:26:39] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:39] [INFO ] Invariant cache hit.
[2024-05-21 22:26:40] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:26:40] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 2105 sub problems to find dead transitions.
[2024-05-21 22:26:40] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 22:26:40] [INFO ] Invariant cache hit.
[2024-05-21 22:26:40] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 22:27:04] [INFO ] Deduced a trap composed of 5 places in 331 ms of which 2 ms to minimize.
[2024-05-21 22:27:21] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 3 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1346 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/556 variables, and 7 constraints, problems are : Problem set: 19 solved, 2086 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2086 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 19 solved, 2086 unsolved
Problem TDEAD1357 is UNSAT
Problem TDEAD1368 is UNSAT
Problem TDEAD1379 is UNSAT
Problem TDEAD1390 is UNSAT
Problem TDEAD1401 is UNSAT
Problem TDEAD1412 is UNSAT
Problem TDEAD1423 is UNSAT
Problem TDEAD1434 is UNSAT
Problem TDEAD1445 is UNSAT
Problem TDEAD1456 is UNSAT
Problem TDEAD1467 is UNSAT
Problem TDEAD1478 is UNSAT
Problem TDEAD1489 is UNSAT
Problem TDEAD1500 is UNSAT
Problem TDEAD1511 is UNSAT
Problem TDEAD1522 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1544 is UNSAT
Problem TDEAD1555 is UNSAT
Problem TDEAD1566 is UNSAT
Problem TDEAD1577 is UNSAT
Problem TDEAD1588 is UNSAT
Problem TDEAD1599 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1654 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1676 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1698 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1731 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1786 is UNSAT
Problem TDEAD1797 is UNSAT
Problem TDEAD1808 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1830 is UNSAT
Problem TDEAD1841 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2017 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/556 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/186 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 74048ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 74075ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in LTL mode, iteration 1 : 186/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 15 ms. Remains 186 /186 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129964 ms. Remains : 186/188 places, 2028/2108 transitions.
Support contains 186 out of 186 places after structural reductions.
[2024-05-21 22:27:55] [INFO ] Flatten gal took : 541 ms
[2024-05-21 22:27:58] [INFO ] Flatten gal took : 511 ms
[2024-05-21 22:28:01] [INFO ] Input system was already deterministic with 2028 transitions.
Reduction of identical properties reduced properties to check from 62 to 59
RANDOM walk for 40001 steps (56 resets) in 12650 ms. (3 steps per ms) remains 35/59 properties
BEST_FIRST walk for 4003 steps (8 resets) in 883 ms. (4 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 253 ms. (15 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1382 ms. (2 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 1028 ms. (3 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4000 steps (8 resets) in 56 ms. (70 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 30/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 27/28 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
[2024-05-21 22:28:06] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 186 cols
[2024-05-21 22:28:06] [INFO ] Computed 5 invariants in 4 ms
[2024-05-21 22:28:06] [INFO ] State equation strengthened by 21 read => feed constraints.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/183 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 23 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 2 (OVERLAPS) 3/186 variables, 2/5 constraints. Problems are: Problem set: 7 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 369/555 variables, 186/191 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/555 variables, 21/212 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/555 variables, 0/212 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/555 variables, 0/212 constraints. Problems are: Problem set: 7 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 212 constraints, problems are : Problem set: 7 solved, 20 unsolved in 4792 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 186/186 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 143/180 variables, 4/4 constraints. Problems are: Problem set: 7 solved, 20 unsolved
[2024-05-21 22:28:15] [INFO ] Deduced a trap composed of 15 places in 456 ms of which 2 ms to minimize.
Problem AtomicPropp48 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 1/5 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 0/5 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 367/547 variables, 180/185 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 21/206 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/206 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 8/555 variables, 6/212 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 1/213 constraints. Problems are: Problem set: 8 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 19/232 constraints. Problems are: Problem set: 8 solved, 19 unsolved
[2024-05-21 22:28:19] [INFO ] Deduced a trap composed of 14 places in 472 ms of which 2 ms to minimize.
SMT process timed out in 12723ms, After SMT, problems are : Problem set: 8 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 186 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 186/186 places, 2028/2028 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 185 transition count 2027
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 185 transition count 2027
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 183 transition count 2026
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 181 transition count 2024
Applied a total of 9 rules in 531 ms. Remains 181 /186 variables (removed 5) and now considering 2024/2028 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 532 ms. Remains : 181/186 places, 2024/2028 transitions.
RANDOM walk for 40000 steps (80 resets) in 937 ms. (42 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 18/19 properties
Interrupted probabilistic random walk after 96716 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :1 out of 18
Probabilistic random walk after 96716 steps, saw 33504 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :1
[2024-05-21 22:28:23] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 181 cols
[2024-05-21 22:28:23] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 22:28:23] [INFO ] State equation strengthened by 21 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 149/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-21 22:28:24] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 4/546 variables, 4/207 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-05-21 22:28:26] [INFO ] Deduced a trap composed of 12 places in 392 ms of which 3 ms to minimize.
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp45 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 1/208 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/208 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 208 constraints, problems are : Problem set: 2 solved, 15 unsolved in 4871 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 151/177 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 365/542 variables, 177/183 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 21/204 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 0/204 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 4/546 variables, 4/208 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 15/223 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 223 constraints, problems are : Problem set: 2 solved, 15 unsolved in 8366 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 15/17 constraints, Known Traps: 2/2 constraints]
After SMT, in 13407ms problems are : Problem set: 2 solved, 15 unsolved
Parikh walk visited 9 properties in 30398 ms.
Support contains 17 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 141 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 181/181 places, 2024/2024 transitions.
RANDOM walk for 40000 steps (80 resets) in 623 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 518 ms. (77 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (39 resets) in 286 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (40 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 327 ms. (121 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (39 resets) in 358 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 333 ms. (119 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 160525 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :0 out of 6
Probabilistic random walk after 160525 steps, saw 55034 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
[2024-05-21 22:29:11] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:29:11] [INFO ] Invariant cache hit.
[2024-05-21 22:29:11] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 160/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/546 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 206 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1035 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 160/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 4/546 variables, 4/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/546 variables, 6/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 212 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1912 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3044ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 4321 ms.
Support contains 17 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 167 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 181/181 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 170 ms. Remains 181 /181 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 22:29:19] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:29:19] [INFO ] Invariant cache hit.
[2024-05-21 22:29:19] [INFO ] Implicit Places using invariants in 313 ms returned []
[2024-05-21 22:29:19] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:29:19] [INFO ] Invariant cache hit.
[2024-05-21 22:29:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:29:20] [INFO ] Implicit Places using invariants and state equation in 958 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1295 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 179/181 places, 2024/2024 transitions.
Applied a total of 0 rules in 118 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1583 ms. Remains : 179/181 places, 2024/2024 transitions.
RANDOM walk for 40000 steps (80 resets) in 612 ms. (65 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (40 resets) in 254 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 250 ms. (159 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (40 resets) in 255 ms. (156 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (40 resets) in 228 ms. (174 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (37 resets) in 274 ms. (145 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (39 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 117027 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 6
Probabilistic random walk after 117027 steps, saw 40836 distinct states, run finished after 3002 ms. (steps per millisecond=38 ) properties seen :0
[2024-05-21 22:29:24] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
// Phase 1: matrix 365 rows 179 cols
[2024-05-21 22:29:24] [INFO ] Computed 4 invariants in 4 ms
[2024-05-21 22:29:24] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 160/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/544 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/544 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 544/544 variables, and 204 constraints, problems are : Problem set: 0 solved, 6 unsolved in 699 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 160/177 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 365/542 variables, 177/181 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/542 variables, 21/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/542 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-21 22:29:26] [INFO ] Deduced a trap composed of 13 places in 261 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/544 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/544 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 544/544 variables, and 211 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7511 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 8282ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 3698 ms.
Support contains 17 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 151 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 179/179 places, 2024/2024 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 2024/2024 transitions.
Applied a total of 0 rules in 232 ms. Remains 179 /179 variables (removed 0) and now considering 2024/2024 (removed 0) transitions.
[2024-05-21 22:29:36] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:29:36] [INFO ] Invariant cache hit.
[2024-05-21 22:29:36] [INFO ] Implicit Places using invariants in 249 ms returned []
[2024-05-21 22:29:36] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:29:36] [INFO ] Invariant cache hit.
[2024-05-21 22:29:36] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 22:29:38] [INFO ] Implicit Places using invariants and state equation in 1204 ms returned []
Implicit Place search using SMT with State Equation took 1461 ms to find 0 implicit places.
[2024-05-21 22:29:38] [INFO ] Redundant transitions in 88 ms returned []
Running 2021 sub problems to find dead transitions.
[2024-05-21 22:29:38] [INFO ] Flow matrix only has 365 transitions (discarded 1659 similar events)
[2024-05-21 22:29:38] [INFO ] Invariant cache hit.
[2024-05-21 22:29:38] [INFO ] State equation strengthened by 21 read => feed constraints.

BK_STOP 1716330590514

--------------------
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-V80P20N10"
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-V80P20N10, 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-171620399200274"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P20N10.tgz
mv BridgeAndVehicles-PT-V80P20N10 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;