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

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 207181.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-171620399100260.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 LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399100260
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716330016423

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
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
LTLFireability PT
Running Version 202405141337
[2024-05-21 22:20:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:20:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:20:20] [INFO ] Load time of PNML (sax parser for PT used): 547 ms
[2024-05-21 22:20:20] [INFO ] Transformed 138 places.
[2024-05-21 22:20:21] [INFO ] Transformed 2348 transitions.
[2024-05-21 22:20:21] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 936 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 70 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 194 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:20:22] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 22:20:23] [INFO ] Computed 5 invariants in 28 ms
[2024-05-21 22:20:23] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 5 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20342 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: 0/0 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 5 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20319 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: 0/0 constraints]
After SMT, in 65384ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 65643ms
[2024-05-21 22:21:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:21:28] [INFO ] Invariant cache hit.
[2024-05-21 22:21:28] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-21 22:21:28] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:21:28] [INFO ] Invariant cache hit.
[2024-05-21 22:21:29] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:21:29] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
Running 2345 sub problems to find dead transitions.
[2024-05-21 22:21:29] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:21:29] [INFO ] Invariant cache hit.
[2024-05-21 22:21:29] [INFO ] State equation strengthened by 42 read => feed constraints.
(s62 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 0.0)
(s54 49.0)
(s55 0.0)
(s56 1.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 5 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 30095 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: 0/0 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
[2024-05-21 22:22:44] [INFO ] Deduced a trap composed of 5 places in 692 ms of which 48 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 30070 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: 1/1 constraints]
After SMT, in 84056ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 84112ms
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2348/2348 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150963 ms. Remains : 136/138 places, 2348/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-05-21 22:22:55] [INFO ] Flatten gal took : 813 ms
[2024-05-21 22:22:57] [INFO ] Flatten gal took : 707 ms
[2024-05-21 22:22:58] [INFO ] Input system was already deterministic with 2348 transitions.
Reduction of identical properties reduced properties to check from 30 to 26
RANDOM walk for 40003 steps (92 resets) in 9641 ms. (4 steps per ms) remains 3/26 properties
BEST_FIRST walk for 40001 steps (32 resets) in 803 ms. (49 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (32 resets) in 440 ms. (90 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (40 resets) in 1011 ms. (39 steps per ms) remains 3/3 properties
[2024-05-21 22:23:03] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 22:23:03] [INFO ] Invariant cache hit.
[2024-05-21 22:23:03] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp29 is UNSAT
At refinement iteration 1 (OVERLAPS) 118/129 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/417 variables, 129/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 42/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/426 variables, 7/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 121/129 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 288/417 variables, 129/133 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/417 variables, 42/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/417 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 9/426 variables, 7/182 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/426 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/426 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 185 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1754 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 3551ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 2087 ms.
Support contains 8 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 135 transition count 2347
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 135 transition count 2347
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 133 transition count 2346
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 2344
Applied a total of 9 rules in 1554 ms. Remains 131 /136 variables (removed 5) and now considering 2344/2348 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1579 ms. Remains : 131/136 places, 2344/2348 transitions.
RANDOM walk for 40000 steps (128 resets) in 1765 ms. (22 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (58 resets) in 562 ms. (71 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (61 resets) in 1012 ms. (39 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 131598 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 2
Probabilistic random walk after 131598 steps, saw 45432 distinct states, run finished after 3017 ms. (steps per millisecond=43 ) properties seen :0
[2024-05-21 22:23:14] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 131 cols
[2024-05-21 22:23:14] [INFO ] Computed 4 invariants in 18 ms
[2024-05-21 22:23:14] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/417 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 417/417 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 119/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 4/417 variables, 4/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/417 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/417 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/417 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 417/417 variables, and 179 constraints, problems are : Problem set: 0 solved, 2 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 131/131 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1946ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 962 ms.
Support contains 8 out of 131 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2344/2344 transitions.
Applied a total of 0 rules in 588 ms. Remains 131 /131 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 589 ms. Remains : 131/131 places, 2344/2344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 131/131 places, 2344/2344 transitions.
Applied a total of 0 rules in 530 ms. Remains 131 /131 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2024-05-21 22:23:18] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-21 22:23:18] [INFO ] Invariant cache hit.
[2024-05-21 22:23:19] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2024-05-21 22:23:19] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-21 22:23:19] [INFO ] Invariant cache hit.
[2024-05-21 22:23:19] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:23:21] [INFO ] Implicit Places using invariants and state equation in 1478 ms returned [52, 106]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2641 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 129/131 places, 2344/2344 transitions.
Applied a total of 0 rules in 390 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3573 ms. Remains : 129/131 places, 2344/2344 transitions.
RANDOM walk for 40000 steps (128 resets) in 1372 ms. (29 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (58 resets) in 1054 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (61 resets) in 632 ms. (63 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 163847 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :1 out of 2
Probabilistic random walk after 163847 steps, saw 54323 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :1
[2024-05-21 22:23:25] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
// Phase 1: matrix 286 rows 129 cols
[2024-05-21 22:23:25] [INFO ] Computed 4 invariants in 5 ms
[2024-05-21 22:23:25] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/415 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 571 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/415 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 652 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1330ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 28 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 373 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 380 ms. Remains : 129/129 places, 2344/2344 transitions.
RANDOM walk for 40000 steps (128 resets) in 1098 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (60 resets) in 504 ms. (79 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 264372 steps, run timeout after 3001 ms. (steps per millisecond=88 ) properties seen :0 out of 1
Probabilistic random walk after 264372 steps, saw 84030 distinct states, run finished after 3001 ms. (steps per millisecond=88 ) properties seen :0
[2024-05-21 22:23:30] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-21 22:23:30] [INFO ] Invariant cache hit.
[2024-05-21 22:23:30] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/415 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/415 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 175 constraints, problems are : Problem set: 0 solved, 1 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 123/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 286/413 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 42/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/415 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/415 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 415/415 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 572 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 129/129 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 982ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 129 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 403 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 404 ms. Remains : 129/129 places, 2344/2344 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 129/129 places, 2344/2344 transitions.
Applied a total of 0 rules in 288 ms. Remains 129 /129 variables (removed 0) and now considering 2344/2344 (removed 0) transitions.
[2024-05-21 22:23:32] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-21 22:23:32] [INFO ] Invariant cache hit.
[2024-05-21 22:23:32] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-21 22:23:32] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-21 22:23:32] [INFO ] Invariant cache hit.
[2024-05-21 22:23:33] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 22:23:34] [INFO ] Implicit Places using invariants and state equation in 1364 ms returned []
Implicit Place search using SMT with State Equation took 1938 ms to find 0 implicit places.
[2024-05-21 22:23:34] [INFO ] Redundant transitions in 147 ms returned []
Running 2341 sub problems to find dead transitions.
[2024-05-21 22:23:34] [INFO ] Flow matrix only has 286 transitions (discarded 2058 similar events)
[2024-05-21 22:23:34] [INFO ] Invariant cache hit.
[2024-05-21 22:23:34] [INFO ] State equation strengthened by 42 read => feed constraints.

BK_STOP 1716330223604

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 LTLFireability -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="LTLFireability"
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 LTLFireability"
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-171620399100260"
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 [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;