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-171620167500358.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-09b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167500358
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 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 865K 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-09b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-09b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717224322299

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-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:45:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:45:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:45:24] [INFO ] Load time of PNML (sax parser for PT used): 452 ms
[2024-06-01 06:45:24] [INFO ] Transformed 391 places.
[2024-06-01 06:45:24] [INFO ] Transformed 1554 transitions.
[2024-06-01 06:45:24] [INFO ] Found NUPN structural information;
[2024-06-01 06:45:24] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 677 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (302 resets) in 1762 ms. (22 steps per ms) remains 1/12 properties
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (45 resets) in 721 ms. (55 steps per ms) remains 1/1 properties
// Phase 1: matrix 1554 rows 391 cols
[2024-06-01 06:45:25] [INFO ] Computed 14 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 280/298 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 280/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 93/391 variables, 3/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 93/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1554/1945 variables, 391/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1945 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1945/1945 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1220 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/18 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 280/298 variables, 11/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 280/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:28] [INFO ] Deduced a trap composed of 15 places in 787 ms of which 16 ms to minimize.
[2024-06-01 06:45:28] [INFO ] Deduced a trap composed of 47 places in 666 ms of which 4 ms to minimize.
[2024-06-01 06:45:29] [INFO ] Deduced a trap composed of 30 places in 585 ms of which 3 ms to minimize.
[2024-06-01 06:45:30] [INFO ] Deduced a trap composed of 21 places in 616 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 93/391 variables, 3/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 93/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:31] [INFO ] Deduced a trap composed of 35 places in 1231 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1554/1945 variables, 391/801 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1945/1945 variables, and 802 constraints, problems are : Problem set: 0 solved, 1 unsolved in 5010 ms.
Refiners :[Domain max(s): 391/391 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 391/391 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 6525ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 391 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Graph (trivial) has 342 edges and 391 vertex of which 2 / 391 are part of one of the 1 SCC in 11 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 1701 edges and 390 vertex of which 386 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.30 ms
Discarding 4 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 146 transitions
Trivial Post-agglo rules discarded 146 transitions
Performed 146 trivial Post agglomeration. Transition count delta: 146
Iterating post reduction 0 with 147 rules applied. Total rules applied 149 place count 386 transition count 1402
Reduce places removed 146 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 182 rules applied. Total rules applied 331 place count 240 transition count 1366
Reduce places removed 21 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 31 rules applied. Total rules applied 362 place count 219 transition count 1356
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 372 place count 209 transition count 1356
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 372 place count 209 transition count 1345
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 394 place count 198 transition count 1345
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 426 place count 166 transition count 1313
Iterating global reduction 4 with 32 rules applied. Total rules applied 458 place count 166 transition count 1313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 459 place count 166 transition count 1312
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 467 place count 158 transition count 1185
Iterating global reduction 5 with 8 rules applied. Total rules applied 475 place count 158 transition count 1185
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 5 with 8 rules applied. Total rules applied 483 place count 158 transition count 1177
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 487 place count 154 transition count 1177
Performed 49 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 7 with 98 rules applied. Total rules applied 585 place count 105 transition count 1127
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 594 place count 96 transition count 956
Iterating global reduction 7 with 9 rules applied. Total rules applied 603 place count 96 transition count 956
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 607 place count 94 transition count 956
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 609 place count 94 transition count 954
Drop transitions (Redundant composition of simpler transitions.) removed 184 transitions
Redundant transition composition rules discarded 184 transitions
Iterating global reduction 8 with 184 rules applied. Total rules applied 793 place count 94 transition count 770
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 803 place count 94 transition count 760
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 813 place count 84 transition count 760
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 814 place count 83 transition count 759
Applied a total of 814 rules in 714 ms. Remains 83 /391 variables (removed 308) and now considering 759/1554 (removed 795) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 745 ms. Remains : 83/391 places, 759/1554 transitions.
RANDOM walk for 40000 steps (56 resets) in 648 ms. (61 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (119 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1091027 steps, run timeout after 3001 ms. (steps per millisecond=363 ) properties seen :0 out of 1
Probabilistic random walk after 1091027 steps, saw 140141 distinct states, run finished after 3008 ms. (steps per millisecond=362 ) properties seen :0
// Phase 1: matrix 759 rows 83 cols
[2024-06-01 06:45:36] [INFO ] Computed 14 invariants in 7 ms
[2024-06-01 06:45:36] [INFO ] State equation strengthened by 1 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 750/821 variables, 71/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/821 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 21/842 variables, 12/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/842 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/842 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 842/842 variables, and 98 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 53/71 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:37] [INFO ] Deduced a trap composed of 4 places in 408 ms of which 1 ms to minimize.
[2024-06-01 06:45:37] [INFO ] Deduced a trap composed of 7 places in 375 ms of which 2 ms to minimize.
[2024-06-01 06:45:37] [INFO ] Deduced a trap composed of 4 places in 368 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 750/821 variables, 71/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/821 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/821 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 21/842 variables, 12/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/842 variables, 3/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/842 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:38] [INFO ] Deduced a trap composed of 6 places in 513 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/842 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/842 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/842 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 842/842 variables, and 103 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2457 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 2894ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 18 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 759/759 transitions.
Applied a total of 0 rules in 41 ms. Remains 83 /83 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 83/83 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 759/759 transitions.
Applied a total of 0 rules in 40 ms. Remains 83 /83 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-06-01 06:45:39] [INFO ] Invariant cache hit.
[2024-06-01 06:45:39] [INFO ] Implicit Places using invariants in 357 ms returned []
[2024-06-01 06:45:39] [INFO ] Invariant cache hit.
[2024-06-01 06:45:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 06:45:40] [INFO ] Implicit Places using invariants and state equation in 593 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 965 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/83 places, 759/759 transitions.
Applied a total of 0 rules in 41 ms. Remains 82 /82 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1046 ms. Remains : 82/83 places, 759/759 transitions.
RANDOM walk for 40000 steps (460 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (117 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1154580 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :0 out of 1
Probabilistic random walk after 1154580 steps, saw 148042 distinct states, run finished after 3001 ms. (steps per millisecond=384 ) properties seen :0
// Phase 1: matrix 759 rows 82 cols
[2024-06-01 06:45:43] [INFO ] Computed 13 invariants in 7 ms
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 749/816 variables, 67/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/816 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/841 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/841 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/841 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 841/841 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 318 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/67 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:44] [INFO ] Deduced a trap composed of 4 places in 406 ms of which 3 ms to minimize.
[2024-06-01 06:45:44] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/67 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 749/816 variables, 67/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/816 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/841 variables, 15/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/841 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/841 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 9 places in 373 ms of which 1 ms to minimize.
[2024-06-01 06:45:45] [INFO ] Deduced a trap composed of 6 places in 357 ms of which 2 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 9 places in 363 ms of which 2 ms to minimize.
[2024-06-01 06:45:46] [INFO ] Deduced a trap composed of 6 places in 391 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/841 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/841 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/841 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 841/841 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3113 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 82/82 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 3483ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 265 ms.
Support contains 18 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 759/759 transitions.
Applied a total of 0 rules in 39 ms. Remains 82 /82 variables (removed 0) and now considering 759/759 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 82/82 places, 759/759 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 759/759 transitions.
Applied a total of 0 rules in 38 ms. Remains 82 /82 variables (removed 0) and now considering 759/759 (removed 0) transitions.
[2024-06-01 06:45:47] [INFO ] Invariant cache hit.
[2024-06-01 06:45:47] [INFO ] Implicit Places using invariants in 317 ms returned []
[2024-06-01 06:45:47] [INFO ] Invariant cache hit.
[2024-06-01 06:45:48] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
[2024-06-01 06:45:48] [INFO ] Redundant transitions in 67 ms returned [696]
Found 1 redundant transitions using SMT.
Drop transitions (Redundant Transitions using SMT with State Equation) removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
Running 754 sub problems to find dead transitions.
// Phase 1: matrix 758 rows 82 cols
[2024-06-01 06:45:48] [INFO ] Computed 13 invariants in 7 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (OVERLAPS) 4/82 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-01 06:46:09] [INFO ] Deduced a trap composed of 20 places in 529 ms of which 1 ms to minimize.
[2024-06-01 06:46:10] [INFO ] Deduced a trap composed of 4 places in 513 ms of which 2 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 12 places in 515 ms of which 2 ms to minimize.
[2024-06-01 06:46:11] [INFO ] Deduced a trap composed of 12 places in 485 ms of which 1 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 5 places in 499 ms of which 2 ms to minimize.
[2024-06-01 06:46:12] [INFO ] Deduced a trap composed of 5 places in 506 ms of which 2 ms to minimize.
[2024-06-01 06:46:13] [INFO ] Deduced a trap composed of 12 places in 433 ms of which 1 ms to minimize.
[2024-06-01 06:46:13] [INFO ] Deduced a trap composed of 5 places in 442 ms of which 1 ms to minimize.
[2024-06-01 06:46:13] [INFO ] Deduced a trap composed of 5 places in 419 ms of which 1 ms to minimize.
[2024-06-01 06:46:14] [INFO ] Deduced a trap composed of 7 places in 391 ms of which 2 ms to minimize.
[2024-06-01 06:46:14] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 2 ms to minimize.
[2024-06-01 06:46:17] [INFO ] Deduced a trap composed of 9 places in 313 ms of which 2 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 9 places in 310 ms of which 2 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 1 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 1 ms to minimize.
[2024-06-01 06:46:18] [INFO ] Deduced a trap composed of 9 places in 244 ms of which 2 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 11 places in 293 ms of which 2 ms to minimize.
[2024-06-01 06:46:19] [INFO ] Deduced a trap composed of 6 places in 351 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 12 places in 273 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 1 ms to minimize.
[2024-06-01 06:46:23] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 2 ms to minimize.
[2024-06-01 06:46:24] [INFO ] Deduced a trap composed of 14 places in 289 ms of which 1 ms to minimize.
[2024-06-01 06:46:25] [INFO ] Deduced a trap composed of 12 places in 269 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 754 unsolved
SMT process timed out in 44170ms, After SMT, problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 44186ms
Starting structural reductions in REACHABILITY mode, iteration 1 : 82/82 places, 758/759 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 81 transition count 757
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 80 transition count 758
Applied a total of 4 rules in 67 ms. Remains 80 /82 variables (removed 2) and now considering 758/758 (removed 0) transitions.
// Phase 1: matrix 758 rows 80 cols
[2024-06-01 06:46:32] [INFO ] Computed 13 invariants in 13 ms
[2024-06-01 06:46:32] [INFO ] Implicit Places using invariants in 345 ms returned []
[2024-06-01 06:46:32] [INFO ] Invariant cache hit.
[2024-06-01 06:46:33] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 06:46:33] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 80/82 places, 758/759 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46146 ms. Remains : 80/82 places, 758/759 transitions.
RANDOM walk for 40000 steps (191 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (124 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1157696 steps, run timeout after 3001 ms. (steps per millisecond=385 ) properties seen :0 out of 1
Probabilistic random walk after 1157696 steps, saw 148401 distinct states, run finished after 3001 ms. (steps per millisecond=385 ) properties seen :0
[2024-06-01 06:46:36] [INFO ] Invariant cache hit.
[2024-06-01 06:46:36] [INFO ] State equation strengthened by 3 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 749/815 variables, 66/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/838 variables, 14/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/838 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/838 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 838/838 variables, and 96 constraints, problems are : Problem set: 0 solved, 1 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/66 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 9 places in 394 ms of which 2 ms to minimize.
[2024-06-01 06:46:37] [INFO ] Deduced a trap composed of 9 places in 365 ms of which 3 ms to minimize.
[2024-06-01 06:46:38] [INFO ] Deduced a trap composed of 4 places in 390 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 749/815 variables, 66/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 3/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/815 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 23/838 variables, 14/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 3/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/838 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/838 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/838 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 838/838 variables, and 100 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1919 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 2289ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 116 ms.
Support contains 18 out of 80 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 758/758 transitions.
Applied a total of 0 rules in 44 ms. Remains 80 /80 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 80/80 places, 758/758 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 80/80 places, 758/758 transitions.
Applied a total of 0 rules in 43 ms. Remains 80 /80 variables (removed 0) and now considering 758/758 (removed 0) transitions.
[2024-06-01 06:46:39] [INFO ] Invariant cache hit.
[2024-06-01 06:46:39] [INFO ] Implicit Places using invariants in 336 ms returned []
[2024-06-01 06:46:39] [INFO ] Invariant cache hit.
[2024-06-01 06:46:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-01 06:46:39] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-06-01 06:46:40] [INFO ] Redundant transitions in 21 ms returned []
Running 754 sub problems to find dead transitions.
[2024-06-01 06:46:40] [INFO ] Invariant cache hit.
[2024-06-01 06:46:40] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (OVERLAPS) 4/80 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-01 06:47:01] [INFO ] Deduced a trap composed of 4 places in 551 ms of which 1 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 12 places in 501 ms of which 1 ms to minimize.
[2024-06-01 06:47:02] [INFO ] Deduced a trap composed of 12 places in 489 ms of which 1 ms to minimize.
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 5 places in 461 ms of which 2 ms to minimize.
[2024-06-01 06:47:03] [INFO ] Deduced a trap composed of 5 places in 438 ms of which 2 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 12 places in 420 ms of which 1 ms to minimize.
[2024-06-01 06:47:04] [INFO ] Deduced a trap composed of 5 places in 406 ms of which 1 ms to minimize.
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 5 places in 396 ms of which 1 ms to minimize.
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 7 places in 408 ms of which 1 ms to minimize.
[2024-06-01 06:47:05] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 20 places in 494 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 9 places in 311 ms of which 2 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 9 places in 314 ms of which 1 ms to minimize.
[2024-06-01 06:47:09] [INFO ] Deduced a trap composed of 9 places in 328 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 10 places in 329 ms of which 1 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 9 places in 246 ms of which 5 ms to minimize.
[2024-06-01 06:47:10] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 1 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 6 places in 359 ms of which 1 ms to minimize.
[2024-06-01 06:47:11] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 19/32 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 5 (OVERLAPS) 758/838 variables, 80/112 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/838 variables, 3/115 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 838/838 variables, and 115 constraints, problems are : Problem set: 0 solved, 754 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 754 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/76 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 3 (OVERLAPS) 4/80 variables, 4/23 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 754 unsolved
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 2 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 14 places in 282 ms of which 1 ms to minimize.
[2024-06-01 06:47:30] [INFO ] Deduced a trap composed of 12 places in 284 ms of which 2 ms to minimize.
[2024-06-01 06:47:31] [INFO ] Deduced a trap composed of 14 places in 284 ms of which 1 ms to minimize.
[2024-06-01 06:47:32] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 7 (OVERLAPS) 758/838 variables, 80/117 constraints. Problems are: Problem set: 0 solved, 754 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/838 variables, 3/120 constraints. Problems are: Problem set: 0 solved, 754 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 838/838 variables, and 874 constraints, problems are : Problem set: 0 solved, 754 unsolved in 31546 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 80/80 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 754/754 constraints, Known Traps: 24/24 constraints]
After SMT, in 76002ms problems are : Problem set: 0 solved, 754 unsolved
Search for dead transitions found 0 dead transitions in 76016ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77024 ms. Remains : 80/80 places, 758/758 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 36 ms. Remains 80 /80 variables (removed 0) and now considering 758/758 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 06:47:56] [INFO ] Invariant cache hit.
[2024-06-01 06:47:56] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 06:47:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 06:47:56] [INFO ] After 380ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 06:47:57] [INFO ] Deduced a trap composed of 6 places in 553 ms of which 2 ms to minimize.
[2024-06-01 06:47:57] [INFO ] Deduced a trap composed of 20 places in 542 ms of which 1 ms to minimize.
[2024-06-01 06:47:58] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 2 ms to minimize.
[2024-06-01 06:47:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1760 ms
TRAPS : Iteration 1
[2024-06-01 06:47:59] [INFO ] Deduced a trap composed of 9 places in 446 ms of which 1 ms to minimize.
[2024-06-01 06:47:59] [INFO ] Deduced a trap composed of 9 places in 431 ms of which 2 ms to minimize.
[2024-06-01 06:47:59] [INFO ] Deduced a trap composed of 9 places in 404 ms of which 1 ms to minimize.
[2024-06-01 06:47:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1377 ms
TRAPS : Iteration 2
[2024-06-01 06:48:00] [INFO ] After 3899ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 06:48:00] [INFO ] After 4060ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 4184 ms.
[2024-06-01 06:48:00] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-06-01 06:48:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 80 places, 758 transitions and 11835 arcs took 20 ms.
[2024-06-01 06:48:00] [INFO ] Flatten gal took : 422 ms
Total runtime 156930 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-09b-ReachabilityCardinality-2024-06

BK_STOP 1717224481303

--------------------
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//
++ perl -pe 's/.*\.//g'
++ 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-09b-ReachabilityCardinality-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/806/inv_0_
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-09b"
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-09b, 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-171620167500358"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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