Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167500366.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutonomousCar-PT-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500366
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 17:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 12 17:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 AutonomousCar-PT-10a-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-10a-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717225499283

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:05:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 07:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:05:02] [INFO ] Load time of PNML (sax parser for PT used): 717 ms
[2024-06-01 07:05:02] [INFO ] Transformed 97 places.
[2024-06-01 07:05:02] [INFO ] Transformed 1921 transitions.
[2024-06-01 07:05:02] [INFO ] Found NUPN structural information;
[2024-06-01 07:05:02] [INFO ] Parsed PT model containing 97 places and 1921 transitions and 29152 arcs in 1130 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 423 transitions
Reduce redundant transitions removed 423 transitions.
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1801 resets) in 4315 ms. (9 steps per ms) remains 4/10 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (124 resets) in 331 ms. (120 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (129 resets) in 641 ms. (62 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (143 resets) in 885 ms. (45 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (138 resets) in 383 ms. (104 steps per ms) remains 4/4 properties
[2024-06-01 07:05:04] [INFO ] Flow matrix only has 1497 transitions (discarded 1 similar events)
// Phase 1: matrix 1497 rows 97 cols
[2024-06-01 07:05:04] [INFO ] Computed 15 invariants in 67 ms
[2024-06-01 07:05:05] [INFO ] State equation strengthened by 403 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 38/97 variables, 15/74 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 38/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1496/1593 variables, 97/209 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1593 variables, 402/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 1/1594 variables, 1/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 0/1594 variables, 0/612 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1594/1594 variables, and 612 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1503 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/59 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutonomousCar-PT-10a-ReachabilityCardinality-2024-15 is UNSAT
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 38/97 variables, 15/74 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 38/112 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:05:08] [INFO ] Deduced a trap composed of 16 places in 1656 ms of which 22 ms to minimize.
[2024-06-01 07:05:10] [INFO ] Deduced a trap composed of 7 places in 1431 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/114 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1496/1593 variables, 97/211 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1593 variables, 402/613 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1593 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/1594 variables, 1/614 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1594 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1594 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1594/1594 variables, and 614 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4836 ms.
Refiners :[Domain max(s): 97/97 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 97/97 constraints, ReadFeed: 403/403 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 6926ms problems are : Problem set: 1 solved, 3 unsolved
Parikh walk visited 0 properties in 6370 ms.
Support contains 51 out of 97 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 97/97 places, 1498/1498 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 97 transition count 1495
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 96 transition count 1495
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 94 transition count 1473
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 94 transition count 1473
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 94 transition count 1468
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 89 transition count 1468
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 19 place count 89 transition count 1468
Applied a total of 19 rules in 812 ms. Remains 89 /97 variables (removed 8) and now considering 1468/1498 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 838 ms. Remains : 89/97 places, 1468/1498 transitions.
RANDOM walk for 40000 steps (2026 resets) in 1610 ms. (24 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (145 resets) in 195 ms. (204 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (135 resets) in 266 ms. (149 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (158 resets) in 293 ms. (136 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 251106 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :0 out of 3
Probabilistic random walk after 251106 steps, saw 44296 distinct states, run finished after 3015 ms. (steps per millisecond=83 ) properties seen :0
// Phase 1: matrix 1468 rows 89 cols
[2024-06-01 07:05:22] [INFO ] Computed 15 invariants in 33 ms
[2024-06-01 07:05:22] [INFO ] State equation strengthened by 383 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/89 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1468/1557 variables, 89/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1557 variables, 383/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1557 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/1557 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1557/1557 variables, and 487 constraints, problems are : Problem set: 0 solved, 3 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 89/89 constraints, ReadFeed: 383/383 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 38/89 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 07:05:25] [INFO ] Deduced a trap composed of 15 places in 1254 ms of which 2 ms to minimize.
[2024-06-01 07:05:26] [INFO ] Deduced a trap composed of 15 places in 1371 ms of which 2 ms to minimize.
[2024-06-01 07:05:27] [INFO ] Deduced a trap composed of 16 places in 1132 ms of which 2 ms to minimize.
[2024-06-01 07:05:28] [INFO ] Deduced a trap composed of 7 places in 1073 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1468/1557 variables, 89/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1557 variables, 383/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1557 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1557 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1557/1557 variables, and 491 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6344 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 89/89 constraints, ReadFeed: 383/383 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 4/4 constraints]
After SMT, in 7533ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1444 ms.
Support contains 51 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1468/1468 transitions.
Applied a total of 0 rules in 128 ms. Remains 89 /89 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 89/89 places, 1468/1468 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 1468/1468 transitions.
Applied a total of 0 rules in 116 ms. Remains 89 /89 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
[2024-06-01 07:05:31] [INFO ] Invariant cache hit.
[2024-06-01 07:05:32] [INFO ] Implicit Places using invariants in 447 ms returned []
[2024-06-01 07:05:32] [INFO ] Invariant cache hit.
[2024-06-01 07:05:33] [INFO ] State equation strengthened by 383 read => feed constraints.
[2024-06-01 07:05:33] [INFO ] Implicit Places using invariants and state equation in 1320 ms returned [84, 87]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1790 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 87/89 places, 1468/1468 transitions.
Applied a total of 0 rules in 193 ms. Remains 87 /87 variables (removed 0) and now considering 1468/1468 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2101 ms. Remains : 87/89 places, 1468/1468 transitions.
RANDOM walk for 40000 steps (2012 resets) in 1723 ms. (23 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-10a-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (135 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (156 resets) in 320 ms. (124 steps per ms) remains 2/2 properties
// Phase 1: matrix 1468 rows 87 cols
[2024-06-01 07:05:34] [INFO ] Computed 13 invariants in 17 ms
[2024-06-01 07:05:34] [INFO ] State equation strengthened by 383 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1468/1553 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1553 variables, 383/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1553 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1555 variables, 2/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1555 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1555 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1555/1555 variables, and 483 constraints, problems are : Problem set: 0 solved, 2 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 87/87 constraints, ReadFeed: 383/383 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 36/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 07:05:36] [INFO ] Deduced a trap composed of 7 places in 1092 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 1468/1553 variables, 85/99 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1553 variables, 383/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1553 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 2/1555 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1555 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1555 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1555/1555 variables, and 484 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2083 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 87/87 constraints, ReadFeed: 383/383 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints]
After SMT, in 2929ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 723 ms.
Support contains 49 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 1468/1468 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 86 transition count 1457
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 86 transition count 1457
Applied a total of 2 rules in 128 ms. Remains 86 /87 variables (removed 1) and now considering 1457/1468 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 86/87 places, 1457/1468 transitions.
RANDOM walk for 40000 steps (1973 resets) in 2587 ms. (15 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (135 resets) in 166 ms. (239 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (156 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 347210 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 2
Probabilistic random walk after 347210 steps, saw 59620 distinct states, run finished after 3001 ms. (steps per millisecond=115 ) properties seen :0
// Phase 1: matrix 1457 rows 86 cols
[2024-06-01 07:05:42] [INFO ] Computed 13 invariants in 16 ms
[2024-06-01 07:05:42] [INFO ] State equation strengthened by 373 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/84 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1457/1541 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1541 variables, 373/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1541 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1543 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1543/1543 variables, and 472 constraints, problems are : Problem set: 0 solved, 2 unsolved in 907 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 86/86 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 35/84 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1457/1541 variables, 84/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1541 variables, 373/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1541 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/1543 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1543 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1543/1543 variables, and 472 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 86/86 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 2258ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 2070 ms.
Support contains 49 out of 86 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1457/1457 transitions.
Applied a total of 0 rules in 188 ms. Remains 86 /86 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 86/86 places, 1457/1457 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 86/86 places, 1457/1457 transitions.
Applied a total of 0 rules in 116 ms. Remains 86 /86 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
[2024-06-01 07:05:46] [INFO ] Invariant cache hit.
[2024-06-01 07:05:47] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-06-01 07:05:47] [INFO ] Invariant cache hit.
[2024-06-01 07:05:48] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-06-01 07:05:48] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
[2024-06-01 07:05:49] [INFO ] Redundant transitions in 197 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-06-01 07:05:49] [INFO ] Invariant cache hit.
[2024-06-01 07:05:49] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (OVERLAPS) 2/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-06-01 07:06:26] [INFO ] Deduced a trap composed of 24 places in 1464 ms of which 7 ms to minimize.
[2024-06-01 07:06:27] [INFO ] Deduced a trap composed of 7 places in 1106 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 85/1543 variables, and 15 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30098 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/86 constraints, ReadFeed: 0/373 constraints, PredecessorRefiner: 1456/60 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/83 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (OVERLAPS) 2/85 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 85/1543 variables, and 15 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 0/86 constraints, ReadFeed: 0/373 constraints, PredecessorRefiner: 1396/60 constraints, Known Traps: 2/2 constraints]
After SMT, in 84841ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 84882ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87238 ms. Remains : 86/86 places, 1457/1457 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 131 ms. Remains 86 /86 variables (removed 0) and now considering 1457/1457 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-06-01 07:07:14] [INFO ] Invariant cache hit.
[2024-06-01 07:07:14] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 07:07:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-06-01 07:07:15] [INFO ] After 805ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-06-01 07:07:15] [INFO ] After 880ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1194 ms.
[2024-06-01 07:07:15] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2024-06-01 07:07:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 86 places, 1457 transitions and 25639 arcs took 46 ms.
[2024-06-01 07:07:16] [INFO ] Flatten gal took : 729 ms
Total runtime 134995 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 : AutonomousCar-PT-10a-ReachabilityCardinality-2024-10
Could not compute solution for formula : AutonomousCar-PT-10a-ReachabilityCardinality-2024-13

BK_STOP 1717225636857

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ 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 AutonomousCar-PT-10a-ReachabilityCardinality-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/604/inv_0_
rfs formula name AutonomousCar-PT-10a-ReachabilityCardinality-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/604/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="AutonomousCar-PT-10a"
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 AutonomousCar-PT-10a, 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 r468-smll-171620167500366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-10a.tgz
mv AutonomousCar-PT-10a 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 ;