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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 804K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Apr 12 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 12 17:49 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 334K 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-07b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-07b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717216575812

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-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 04:36:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 04:36:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 04:36:18] [INFO ] Load time of PNML (sax parser for PT used): 307 ms
[2024-06-01 04:36:18] [INFO ] Transformed 323 places.
[2024-06-01 04:36:18] [INFO ] Transformed 846 transitions.
[2024-06-01 04:36:18] [INFO ] Found NUPN structural information;
[2024-06-01 04:36:18] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 722 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 63 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (204 resets) in 2855 ms. (14 steps per ms) remains 8/12 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (59 resets) in 453 ms. (88 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (42 resets) in 338 ms. (118 steps per ms) remains 5/7 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (66 resets) in 281 ms. (141 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (64 resets) in 216 ms. (184 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (62 resets) in 677 ms. (59 steps per ms) remains 5/5 properties
// Phase 1: matrix 846 rows 323 cols
[2024-06-01 04:36:20] [INFO ] Computed 12 invariants in 31 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 241/323 variables, 12/94 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 241/335 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 846/1169 variables, 323/658 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1169/1169 variables, and 658 constraints, problems are : Problem set: 1 solved, 4 unsolved in 1364 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 72/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/72 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 251/323 variables, 12/84 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 251/335 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-06-01 04:36:23] [INFO ] Deduced a trap composed of 30 places in 745 ms of which 58 ms to minimize.
[2024-06-01 04:36:24] [INFO ] Deduced a trap composed of 18 places in 682 ms of which 6 ms to minimize.
[2024-06-01 04:36:24] [INFO ] Deduced a trap composed of 34 places in 633 ms of which 6 ms to minimize.
[2024-06-01 04:36:25] [INFO ] Deduced a trap composed of 38 places in 575 ms of which 6 ms to minimize.
[2024-06-01 04:36:26] [INFO ] Deduced a trap composed of 25 places in 699 ms of which 4 ms to minimize.
[2024-06-01 04:36:26] [INFO ] Deduced a trap composed of 35 places in 288 ms of which 3 ms to minimize.
[2024-06-01 04:36:26] [INFO ] Deduced a trap composed of 35 places in 346 ms of which 5 ms to minimize.
[2024-06-01 04:36:27] [INFO ] Deduced a trap composed of 35 places in 452 ms of which 6 ms to minimize.
[2024-06-01 04:36:28] [INFO ] Deduced a trap composed of 25 places in 516 ms of which 5 ms to minimize.
SMT process timed out in 7132ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 72 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 195 edges and 323 vertex of which 2 / 323 are part of one of the 1 SCC in 7 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 1183 edges and 322 vertex of which 321 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 76 place count 321 transition count 770
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 85 rules applied. Total rules applied 161 place count 247 transition count 759
Reduce places removed 6 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 2 with 25 rules applied. Total rules applied 186 place count 241 transition count 740
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 25 rules applied. Total rules applied 211 place count 222 transition count 734
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 214 place count 219 transition count 734
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 11 Pre rules applied. Total rules applied 214 place count 219 transition count 723
Deduced a syphon composed of 11 places in 4 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 236 place count 208 transition count 723
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 252 place count 192 transition count 707
Iterating global reduction 5 with 16 rules applied. Total rules applied 268 place count 192 transition count 707
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 268 place count 192 transition count 706
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 270 place count 191 transition count 706
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 273 place count 188 transition count 664
Iterating global reduction 5 with 3 rules applied. Total rules applied 276 place count 188 transition count 664
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 279 place count 188 transition count 661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 280 place count 187 transition count 661
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 2 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 326 place count 164 transition count 638
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 327 place count 163 transition count 623
Iterating global reduction 7 with 1 rules applied. Total rules applied 328 place count 163 transition count 623
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 330 place count 162 transition count 623
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 334 place count 162 transition count 619
Free-agglomeration rule applied 12 times.
Iterating global reduction 7 with 12 rules applied. Total rules applied 346 place count 162 transition count 607
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 358 place count 150 transition count 607
Applied a total of 358 rules in 529 ms. Remains 150 /323 variables (removed 173) and now considering 607/846 (removed 239) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 551 ms. Remains : 150/323 places, 607/846 transitions.
RANDOM walk for 40000 steps (411 resets) in 509 ms. (78 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (114 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (95 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (82 resets) in 186 ms. (213 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (123 resets) in 258 ms. (154 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 633157 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :1 out of 4
Probabilistic random walk after 633157 steps, saw 92163 distinct states, run finished after 3006 ms. (steps per millisecond=210 ) properties seen :1
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 607 rows 150 cols
[2024-06-01 04:36:32] [INFO ] Computed 11 invariants in 5 ms
[2024-06-01 04:36:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/143 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 605/748 variables, 143/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/748 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 7/755 variables, 6/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/755 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 2/757 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/757 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/757 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 757/757 variables, and 162 constraints, problems are : Problem set: 0 solved, 3 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 78/143 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 04:36:32] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 2 ms to minimize.
[2024-06-01 04:36:33] [INFO ] Deduced a trap composed of 13 places in 349 ms of which 2 ms to minimize.
[2024-06-01 04:36:33] [INFO ] Deduced a trap composed of 24 places in 360 ms of which 2 ms to minimize.
[2024-06-01 04:36:34] [INFO ] Deduced a trap composed of 9 places in 343 ms of which 1 ms to minimize.
[2024-06-01 04:36:34] [INFO ] Deduced a trap composed of 18 places in 236 ms of which 2 ms to minimize.
[2024-06-01 04:36:34] [INFO ] Deduced a trap composed of 11 places in 270 ms of which 2 ms to minimize.
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/143 variables, 6/17 constraints. Problems are: Problem set: 2 solved, 1 unsolved
[2024-06-01 04:36:34] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/143 variables, 1/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/143 variables, 0/18 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 605/748 variables, 143/161 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/748 variables, 1/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/748 variables, 0/162 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/755 variables, 6/168 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/755 variables, 1/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/757 variables, 1/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/757 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/757 variables, 0/170 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 757/757 variables, and 170 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2957 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 150/150 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 3517ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 17 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 607/607 transitions.
Graph (trivial) has 91 edges and 150 vertex of which 2 / 150 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 871 edges and 149 vertex of which 144 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 27 place count 144 transition count 576
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 31 rules applied. Total rules applied 58 place count 119 transition count 570
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 9 rules applied. Total rules applied 67 place count 114 transition count 566
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 112 transition count 566
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 69 place count 112 transition count 563
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 75 place count 109 transition count 563
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 82 place count 102 transition count 543
Iterating global reduction 4 with 7 rules applied. Total rules applied 89 place count 102 transition count 543
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 4 rules applied. Total rules applied 93 place count 102 transition count 539
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 94 place count 101 transition count 539
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 138 place count 79 transition count 517
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 142 place count 75 transition count 459
Iterating global reduction 6 with 4 rules applied. Total rules applied 146 place count 75 transition count 459
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 148 place count 75 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 134 transitions
Redundant transition composition rules discarded 134 transitions
Iterating global reduction 7 with 134 rules applied. Total rules applied 282 place count 75 transition count 323
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 284 place count 75 transition count 321
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 286 place count 73 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 287 place count 73 transition count 320
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 288 place count 73 transition count 320
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 289 place count 72 transition count 319
Applied a total of 289 rules in 240 ms. Remains 72 /150 variables (removed 78) and now considering 319/607 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 241 ms. Remains : 72/150 places, 319/607 transitions.
RANDOM walk for 40000 steps (1660 resets) in 428 ms. (93 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (201 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1626419 steps, run timeout after 3001 ms. (steps per millisecond=541 ) properties seen :0 out of 1
Probabilistic random walk after 1626419 steps, saw 239620 distinct states, run finished after 3001 ms. (steps per millisecond=541 ) properties seen :0
// Phase 1: matrix 319 rows 72 cols
[2024-06-01 04:36:39] [INFO ] Computed 10 invariants in 5 ms
[2024-06-01 04:36:39] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 319/375 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/391 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/391 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 391/391 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 72/72 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 319/375 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/375 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/375 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 16/391 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 04:36:39] [INFO ] Deduced a trap composed of 4 places in 252 ms of which 2 ms to minimize.
[2024-06-01 04:36:40] [INFO ] Deduced a trap composed of 3 places in 239 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/391 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 391/391 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 999 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1211ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 78 ms.
Support contains 17 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 319/319 transitions.
Applied a total of 0 rules in 26 ms. Remains 72 /72 variables (removed 0) and now considering 319/319 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 72/72 places, 319/319 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 319/319 transitions.
Applied a total of 0 rules in 22 ms. Remains 72 /72 variables (removed 0) and now considering 319/319 (removed 0) transitions.
[2024-06-01 04:36:40] [INFO ] Invariant cache hit.
[2024-06-01 04:36:40] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-01 04:36:40] [INFO ] Invariant cache hit.
[2024-06-01 04:36:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 04:36:40] [INFO ] Implicit Places using invariants and state equation in 316 ms returned [66, 71]
Discarding 2 places :
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 567 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/72 places, 318/319 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 70 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 69 transition count 317
Applied a total of 2 rules in 26 ms. Remains 69 /70 variables (removed 1) and now considering 317/318 (removed 1) transitions.
// Phase 1: matrix 317 rows 69 cols
[2024-06-01 04:36:41] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:36:41] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-01 04:36:41] [INFO ] Invariant cache hit.
[2024-06-01 04:36:41] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/72 places, 317/319 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1024 ms. Remains : 69/72 places, 317/319 transitions.
RANDOM walk for 40000 steps (1662 resets) in 756 ms. (52 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (201 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1677292 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1677292 steps, saw 245339 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
[2024-06-01 04:36:44] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/371 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/386 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 317/371 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/371 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/386 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 04:36:45] [INFO ] Deduced a trap composed of 5 places in 197 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/386 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 386/386 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 496 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 692ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 317/317 transitions.
Applied a total of 0 rules in 11 ms. Remains 69 /69 variables (removed 0) and now considering 317/317 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 69/69 places, 317/317 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 317/317 transitions.
Applied a total of 0 rules in 11 ms. Remains 69 /69 variables (removed 0) and now considering 317/317 (removed 0) transitions.
[2024-06-01 04:36:45] [INFO ] Invariant cache hit.
[2024-06-01 04:36:45] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-06-01 04:36:45] [INFO ] Invariant cache hit.
[2024-06-01 04:36:45] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
[2024-06-01 04:36:45] [INFO ] Redundant transitions in 37 ms returned []
Running 316 sub problems to find dead transitions.
[2024-06-01 04:36:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 316 unsolved
[2024-06-01 04:36:50] [INFO ] Deduced a trap composed of 12 places in 157 ms of which 2 ms to minimize.
[2024-06-01 04:36:50] [INFO ] Deduced a trap composed of 11 places in 125 ms of which 1 ms to minimize.
[2024-06-01 04:36:50] [INFO ] Deduced a trap composed of 11 places in 109 ms of which 1 ms to minimize.
[2024-06-01 04:36:50] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 1 ms to minimize.
[2024-06-01 04:36:50] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-06-01 04:36:50] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2024-06-01 04:36:51] [INFO ] Deduced a trap composed of 19 places in 146 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 316 unsolved
Problem TDEAD306 is UNSAT
At refinement iteration 5 (OVERLAPS) 317/386 variables, 69/85 constraints. Problems are: Problem set: 1 solved, 315 unsolved
[2024-06-01 04:36:54] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 1 ms to minimize.
[2024-06-01 04:36:54] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 1 ms to minimize.
[2024-06-01 04:36:54] [INFO ] Deduced a trap composed of 10 places in 140 ms of which 1 ms to minimize.
[2024-06-01 04:36:54] [INFO ] Deduced a trap composed of 5 places in 155 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 4/89 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 8 (OVERLAPS) 0/386 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 315 unsolved
No progress, stopping.
After SMT solving in domain Real declared 386/386 variables, and 89 constraints, problems are : Problem set: 1 solved, 315 unsolved in 13856 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 316/316 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 315 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 6 (OVERLAPS) 317/386 variables, 69/89 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/386 variables, 315/404 constraints. Problems are: Problem set: 1 solved, 315 unsolved
[2024-06-01 04:37:11] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 1 ms to minimize.
[2024-06-01 04:37:11] [INFO ] Deduced a trap composed of 17 places in 149 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/386 variables, 2/406 constraints. Problems are: Problem set: 1 solved, 315 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/386 variables, 0/406 constraints. Problems are: Problem set: 1 solved, 315 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 386/386 variables, and 406 constraints, problems are : Problem set: 1 solved, 315 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 315/316 constraints, Known Traps: 13/13 constraints]
After SMT, in 46122ms problems are : Problem set: 1 solved, 315 unsolved
Search for dead transitions found 1 dead transitions in 46130ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 69/69 places, 316/317 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 315
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 315
Applied a total of 2 rules in 20 ms. Remains 68 /69 variables (removed 1) and now considering 315/316 (removed 1) transitions.
// Phase 1: matrix 315 rows 68 cols
[2024-06-01 04:37:32] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 04:37:32] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-01 04:37:32] [INFO ] Invariant cache hit.
[2024-06-01 04:37:32] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 68/69 places, 315/317 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 46974 ms. Remains : 68/69 places, 315/317 transitions.
RANDOM walk for 40000 steps (1652 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (172 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1835051 steps, run timeout after 3001 ms. (steps per millisecond=611 ) properties seen :0 out of 1
Probabilistic random walk after 1835051 steps, saw 268477 distinct states, run finished after 3001 ms. (steps per millisecond=611 ) properties seen :0
[2024-06-01 04:37:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/369 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/383 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 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/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 37/54 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 315/369 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/383 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 04:37:36] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 1 ms to minimize.
[2024-06-01 04:37:36] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/383 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 383/383 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 626 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 821ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 17 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 315/315 transitions.
Applied a total of 0 rules in 10 ms. Remains 68 /68 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 68/68 places, 315/315 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 315/315 transitions.
Applied a total of 0 rules in 10 ms. Remains 68 /68 variables (removed 0) and now considering 315/315 (removed 0) transitions.
[2024-06-01 04:37:36] [INFO ] Invariant cache hit.
[2024-06-01 04:37:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-01 04:37:36] [INFO ] Invariant cache hit.
[2024-06-01 04:37:36] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
[2024-06-01 04:37:36] [INFO ] Redundant transitions in 4 ms returned []
Running 314 sub problems to find dead transitions.
[2024-06-01 04:37:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-01 04:37:40] [INFO ] Deduced a trap composed of 12 places in 145 ms of which 4 ms to minimize.
[2024-06-01 04:37:40] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-06-01 04:37:40] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2024-06-01 04:37:40] [INFO ] Deduced a trap composed of 12 places in 105 ms of which 1 ms to minimize.
[2024-06-01 04:37:40] [INFO ] Deduced a trap composed of 12 places in 99 ms of which 1 ms to minimize.
[2024-06-01 04:37:41] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 3 ms to minimize.
[2024-06-01 04:37:41] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/68 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (OVERLAPS) 315/383 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-01 04:37:44] [INFO ] Deduced a trap composed of 3 places in 165 ms of which 2 ms to minimize.
[2024-06-01 04:37:44] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 2 ms to minimize.
[2024-06-01 04:37:44] [INFO ] Deduced a trap composed of 10 places in 143 ms of which 1 ms to minimize.
[2024-06-01 04:37:44] [INFO ] Deduced a trap composed of 4 places in 177 ms of which 1 ms to minimize.
[2024-06-01 04:37:45] [INFO ] Deduced a trap composed of 9 places in 194 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 8 (OVERLAPS) 0/383 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 314 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 89 constraints, problems are : Problem set: 0 solved, 314 unsolved in 13191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 6 (OVERLAPS) 315/383 variables, 68/89 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 314/403 constraints. Problems are: Problem set: 0 solved, 314 unsolved
[2024-06-01 04:38:00] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 314 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/383 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 314 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 404 constraints, problems are : Problem set: 0 solved, 314 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 314/314 constraints, Known Traps: 13/13 constraints]
After SMT, in 45023ms problems are : Problem set: 0 solved, 314 unsolved
Search for dead transitions found 0 dead transitions in 45028ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45424 ms. Remains : 68/68 places, 315/315 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 12 ms. Remains 68 /68 variables (removed 0) and now considering 315/315 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-06-01 04:38:21] [INFO ] Invariant cache hit.
[2024-06-01 04:38:21] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 04:38:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-01 04:38:22] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 04:38:22] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 1 ms to minimize.
[2024-06-01 04:38:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
TRAPS : Iteration 1
[2024-06-01 04:38:22] [INFO ] After 443ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 04:38:22] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 609 ms.
[2024-06-01 04:38:22] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-06-01 04:38:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 315 transitions and 3231 arcs took 9 ms.
[2024-06-01 04:38:22] [INFO ] Flatten gal took : 195 ms
Total runtime 124743 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-07b-ReachabilityCardinality-2024-07

BK_STOP 1717216703237

--------------------
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-07b-ReachabilityCardinality-2024-07
rfs formula type EF
rfs formula formula --invariant=/tmp/757/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-07b"
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-07b, 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-171620167500326"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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