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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 74023.00 0.00 0.00 FFFFFTFT?FT?TF?T 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-171620399200303.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-V80P50N10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399200303
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.1M
-rw-r--r-- 1 mcc users 17K Apr 13 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 298K Apr 13 01:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 13 01:00 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 14K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 399K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Apr 13 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K Apr 13 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 596K Apr 13 01:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 01:36 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-V80P50N10-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716330761720

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-21 22:32:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 22:32:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 22:32:43] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-21 22:32:43] [INFO ] Transformed 188 places.
[2024-05-21 22:32:43] [INFO ] Transformed 2108 transitions.
[2024-05-21 22:32:43] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 400 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 91 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (56 resets) in 6003 ms. (6 steps per ms) remains 11/16 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 22:32:46] [INFO ] Flatten gal took : 736 ms
[2024-05-21 22:32:46] [INFO ] Flatten gal took : 212 ms
[2024-05-21 22:32:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12528015590774248821.gal : 193 ms
[2024-05-21 22:32:47] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5207404941674109563.prop : 129 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12528015590774248821.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5207404941674109563.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5207404941674109563.prop.
BEST_FIRST walk for 33569 steps (18 resets) in 20016 ms. (1 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (24 resets) in 5961 ms. (6 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (24 resets) in 3828 ms. (10 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 450 ms. (88 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 534 ms. (74 steps per ms) remains 10/11 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (20 resets) in 557 ms. (71 steps per ms) remains 9/10 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (20 resets) in 703 ms. (56 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 1389 ms. (28 steps per ms) remains 9/9 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 2
BEST_FIRST walk for 40001 steps (20 resets) in 559 ms. (71 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (20 resets) in 359 ms. (111 steps per ms) remains 9/9 properties
[2024-05-21 22:32:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :2 after 6
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 22:32:55] [INFO ] Computed 7 invariants in 64 ms
[2024-05-21 22:32:55] [INFO ] State equation strengthened by 22 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :6 after 19
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :19 after 42
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :42 after 132
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/188 variables, 2/7 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 370/558 variables, 188/195 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 22/217 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1363 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 140/188 variables, 6/7 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-21 22:33:09] [INFO ] Deduced a trap composed of 7 places in 265 ms of which 20 ms to minimize.
[2024-05-21 22:33:09] [INFO ] Deduced a trap composed of 5 places in 184 ms of which 2 ms to minimize.
[2024-05-21 22:33:09] [INFO ] Deduced a trap composed of 14 places in 234 ms of which 2 ms to minimize.
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 3/10 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/10 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 370/558 variables, 188/198 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 22/220 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 3/223 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/558 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/558 variables, 0/223 constraints. Problems are: Problem set: 6 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 223 constraints, problems are : Problem set: 6 solved, 3 unsolved in 2919 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 16724ms problems are : Problem set: 6 solved, 3 unsolved
Parikh walk visited 0 properties in 1405 ms.
Support contains 18 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Graph (complete) has 1882 edges and 188 vertex of which 186 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 185 transition count 2107
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 185 transition count 2107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 183 transition count 2106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 182 transition count 2105
Applied a total of 8 rules in 548 ms. Remains 182 /188 variables (removed 6) and now considering 2105/2108 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 559 ms. Remains : 182/188 places, 2105/2108 transitions.
RANDOM walk for 40000 steps (76 resets) in 839 ms. (47 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (36 resets) in 666 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (40 resets) in 378 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (39 resets) in 372 ms. (107 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 156734 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 3
Probabilistic random walk after 156734 steps, saw 53659 distinct states, run finished after 3008 ms. (steps per millisecond=52 ) properties seen :0
[2024-05-21 22:33:17] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
// Phase 1: matrix 367 rows 182 cols
[2024-05-21 22:33:17] [INFO ] Computed 4 invariants in 6 ms
[2024-05-21 22:33:17] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/549 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/549 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 549/549 variables, and 208 constraints, problems are : Problem set: 0 solved, 3 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 4/549 variables, 4/208 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 3/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/549 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 549/549 variables, and 211 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1814 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 182/182 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 2288ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 2002 ms.
Support contains 18 out of 182 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 2105/2105 transitions.
Applied a total of 0 rules in 183 ms. Remains 182 /182 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 182/182 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 182/182 places, 2105/2105 transitions.
Applied a total of 0 rules in 241 ms. Remains 182 /182 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2024-05-21 22:33:22] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-21 22:33:22] [INFO ] Invariant cache hit.
[2024-05-21 22:33:22] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-21 22:33:22] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-21 22:33:22] [INFO ] Invariant cache hit.
[2024-05-21 22:33:22] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:33:23] [INFO ] Implicit Places using invariants and state equation in 980 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1218 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 180/182 places, 2105/2105 transitions.
Applied a total of 0 rules in 157 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1616 ms. Remains : 180/182 places, 2105/2105 transitions.
RANDOM walk for 40000 steps (76 resets) in 585 ms. (68 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (36 resets) in 322 ms. (123 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (39 resets) in 311 ms. (128 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (40 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 204247 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 3
Probabilistic random walk after 204247 steps, saw 69758 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-21 22:33:27] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
// Phase 1: matrix 367 rows 180 cols
[2024-05-21 22:33:27] [INFO ] Computed 4 invariants in 3 ms
[2024-05-21 22:33:27] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 2/547 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 206 constraints, problems are : Problem set: 0 solved, 3 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 160/178 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 367/545 variables, 178/182 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 22/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 2/547 variables, 2/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/547 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/547 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
SDD proceeding with computation,11 properties remain. new max is 128
After SMT solving in domain Int declared 547/547 variables, and 209 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3158 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 180/180 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
SDD size :132 after 1562
After SMT, in 3696ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 3454 ms.
Support contains 18 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2105/2105 transitions.
Applied a total of 0 rules in 146 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159 ms. Remains : 180/180 places, 2105/2105 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 2105/2105 transitions.
Applied a total of 0 rules in 143 ms. Remains 180 /180 variables (removed 0) and now considering 2105/2105 (removed 0) transitions.
[2024-05-21 22:33:34] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-21 22:33:34] [INFO ] Invariant cache hit.
[2024-05-21 22:33:35] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-05-21 22:33:35] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-21 22:33:35] [INFO ] Invariant cache hit.
[2024-05-21 22:33:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 22:33:43] [INFO ] Implicit Places using invariants and state equation in 8524 ms returned []
Implicit Place search using SMT with State Equation took 8847 ms to find 0 implicit places.
[2024-05-21 22:33:43] [INFO ] Redundant transitions in 107 ms returned []
Running 2102 sub problems to find dead transitions.
[2024-05-21 22:33:43] [INFO ] Flow matrix only has 367 transitions (discarded 1738 similar events)
[2024-05-21 22:33:43] [INFO ] Invariant cache hit.
[2024-05-21 22:33:43] [INFO ] State equation strengthened by 22 read => feed constraints.

BK_STOP 1716330835743

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -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-V80P50N10"
export BK_EXAMINATION="ReachabilityFireability"
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-V80P50N10, examination is ReachabilityFireability"
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-171620399200303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N10.tgz
mv BridgeAndVehicles-PT-V80P50N10 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;