Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399200310.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 ltsminxred
Input is BridgeAndVehicles-PT-V80P50N20, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399200310
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 21K Apr 13 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 13 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 386K Apr 13 00:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M Apr 13 00:56 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 18K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 286K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 828K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 33K Apr 13 02:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 198K Apr 13 02:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 963K Apr 13 01:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.7M Apr 13 01:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K 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 3.1M 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-V80P50N20-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717222483239

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:14:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:14:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:14:45] [INFO ] Load time of PNML (sax parser for PT used): 276 ms
[2024-06-01 06:14:45] [INFO ] Transformed 198 places.
[2024-06-01 06:14:45] [INFO ] Transformed 3728 transitions.
[2024-06-01 06:14:45] [INFO ] Parsed PT model containing 198 places and 3728 transitions and 28830 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (56 resets) in 3735 ms. (10 steps per ms) remains 11/16 properties
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (24 resets) in 394 ms. (101 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (24 resets) in 489 ms. (81 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (19 resets) in 312 ms. (127 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (20 resets) in 381 ms. (104 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40018 steps (18 resets) in 384 ms. (103 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (20 resets) in 322 ms. (123 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (16 resets) in 575 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (20 resets) in 462 ms. (86 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 284 ms. (140 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (16 resets) in 210 ms. (189 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (16 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
[2024-06-01 06:14:48] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-06-01 06:14:48] [INFO ] Computed 7 invariants in 21 ms
[2024-06-01 06:14:48] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-07 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-05 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-11 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 86/198 variables, 6/7 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/7 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 410/608 variables, 198/205 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/608 variables, 42/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 0/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/608 variables, 0/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 247 constraints, problems are : Problem set: 9 solved, 2 unsolved in 577 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/15 variables, 1/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 410/425 variables, 15/19 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 42/61 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/61 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 183/608 variables, 183/244 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 3/247 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 2/249 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/608 variables, 0/249 constraints. Problems are: Problem set: 9 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/608 variables, 0/249 constraints. Problems are: Problem set: 9 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 249 constraints, problems are : Problem set: 9 solved, 2 unsolved in 1040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 198/198 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 1914ms problems are : Problem set: 9 solved, 2 unsolved
Parikh walk visited 0 properties in 662 ms.
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Graph (complete) has 1962 edges and 198 vertex of which 196 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 9 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 195 transition count 3727
Applied a total of 3 rules in 821 ms. Remains 195 /198 variables (removed 3) and now considering 3727/3728 (removed 1) transitions.
Running 3724 sub problems to find dead transitions.
[2024-06-01 06:14:51] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 195 cols
[2024-06-01 06:14:51] [INFO ] Computed 5 invariants in 9 ms
[2024-06-01 06:14:51] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 195/604 variables, and 5 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20115 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-06-01 06:16:05] [INFO ] Deduced a trap composed of 5 places in 441 ms of which 8 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 195/604 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 20156 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/195 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 84985ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 85055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85916 ms. Remains : 195/198 places, 3727/3728 transitions.
RANDOM walk for 40000 steps (64 resets) in 1057 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (24 resets) in 373 ms. (106 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 356 ms. (112 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 172966 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 2
Probabilistic random walk after 172966 steps, saw 49742 distinct states, run finished after 3004 ms. (steps per millisecond=57 ) properties seen :0
[2024-06-01 06:16:20] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 06:16:20] [INFO ] Invariant cache hit.
[2024-06-01 06:16:20] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 347/602 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/604 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/604 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 347/602 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/602 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/602 variables, 42/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/602 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/604 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/604 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/604 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 604/604 variables, and 244 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1278 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 195/195 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1992ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1028 ms.
Support contains 3 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 585 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 586 ms. Remains : 195/195 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 533 ms. Remains 195 /195 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-06-01 06:16:24] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 06:16:24] [INFO ] Invariant cache hit.
[2024-06-01 06:16:25] [INFO ] Implicit Places using invariants in 690 ms returned []
[2024-06-01 06:16:25] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 06:16:25] [INFO ] Invariant cache hit.
[2024-06-01 06:16:25] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 06:16:26] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned [82, 167]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2163 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 193/195 places, 3727/3727 transitions.
Applied a total of 0 rules in 738 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3437 ms. Remains : 193/195 places, 3727/3727 transitions.
RANDOM walk for 40000 steps (64 resets) in 926 ms. (43 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (24 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (24 resets) in 252 ms. (158 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 126782 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 126782 steps, saw 37497 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 06:16:31] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
// Phase 1: matrix 409 rows 193 cols
[2024-06-01 06:16:31] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:16:31] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 345/600 variables, 183/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 42/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/602 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/602 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 602/602 variables, and 240 constraints, problems are : Problem set: 0 solved, 2 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 247/255 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 345/600 variables, 183/193 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/600 variables, 42/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/600 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 2/602 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/602 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 602/602 variables, and 242 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1491 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 193/193 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2000ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1722 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 558 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 560 ms. Remains : 193/193 places, 3727/3727 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 3727/3727 transitions.
Applied a total of 0 rules in 623 ms. Remains 193 /193 variables (removed 0) and now considering 3727/3727 (removed 0) transitions.
[2024-06-01 06:16:35] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 06:16:35] [INFO ] Invariant cache hit.
[2024-06-01 06:16:36] [INFO ] Implicit Places using invariants in 576 ms returned []
[2024-06-01 06:16:36] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 06:16:36] [INFO ] Invariant cache hit.
[2024-06-01 06:16:36] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 06:16:39] [INFO ] Implicit Places using invariants and state equation in 2929 ms returned []
Implicit Place search using SMT with State Equation took 3520 ms to find 0 implicit places.
[2024-06-01 06:16:39] [INFO ] Redundant transitions in 246 ms returned []
Running 3724 sub problems to find dead transitions.
[2024-06-01 06:16:39] [INFO ] Flow matrix only has 409 transitions (discarded 3318 similar events)
[2024-06-01 06:16:39] [INFO ] Invariant cache hit.
[2024-06-01 06:16:39] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
[2024-06-01 06:17:56] [INFO ] Deduced a trap composed of 5 places in 536 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3724/3724 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3724 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 3724 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 193/602 variables, and 6 constraints, problems are : Problem set: 0 solved, 3724 unsolved in 30111 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/193 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3724 constraints, Known Traps: 1/1 constraints]
After SMT, in 111340ms problems are : Problem set: 0 solved, 3724 unsolved
Search for dead transitions found 0 dead transitions in 111422ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115853 ms. Remains : 193/193 places, 3727/3727 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 3318 transitions
Reduce isomorphic transitions removed 3318 transitions.
Iterating post reduction 0 with 3318 rules applied. Total rules applied 3318 place count 193 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 3322 place count 191 transition count 407
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3324 place count 191 transition count 405
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 3326 place count 189 transition count 405
Applied a total of 3326 rules in 65 ms. Remains 189 /193 variables (removed 4) and now considering 405/3727 (removed 3322) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 405 rows 189 cols
[2024-06-01 06:18:31] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 06:18:31] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-06-01 06:18:31] [INFO ] After 410ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 06:18:31] [INFO ] [Nat]Absence check using 5 positive place invariants in 8 ms returned sat
[2024-06-01 06:18:32] [INFO ] After 489ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 06:18:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-01 06:18:32] [INFO ] After 185ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 06:18:32] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 06:18:32] [INFO ] After 1064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1597 ms.
[2024-06-01 06:18:32] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-06-01 06:18:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 193 places, 3727 transitions and 28504 arcs took 39 ms.
[2024-06-01 06:18:33] [INFO ] Flatten gal took : 454 ms
Total runtime 228510 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-04
Could not compute solution for formula : BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-06

BK_STOP 1717222714037

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_0_
rfs formula name BridgeAndVehicles-PT-V80P50N20-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/602/inv_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-V80P50N20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BridgeAndVehicles-PT-V80P50N20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399200310"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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