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.r025-smll-171620166300294.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 greatspnxred
Input is AutonomousCar-PT-05b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166300294
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-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 4.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 18:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 18:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 18:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 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 159K 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-05b-ReachabilityCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-12
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-13
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-14
FORMULA_NAME AutonomousCar-PT-05b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716347628901

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-05b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:13:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 03:13:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:13:52] [INFO ] Load time of PNML (sax parser for PT used): 177 ms
[2024-05-22 03:13:52] [INFO ] Transformed 255 places.
[2024-05-22 03:13:52] [INFO ] Transformed 490 transitions.
[2024-05-22 03:13:52] [INFO ] Found NUPN structural information;
[2024-05-22 03:13:52] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 407 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (110 resets) in 2070 ms. (19 steps per ms) remains 6/14 properties
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (59 resets) in 624 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (66 resets) in 325 ms. (122 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (58 resets) in 112 ms. (353 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (92 resets) in 280 ms. (142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 622 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (85 resets) in 474 ms. (84 steps per ms) remains 6/6 properties
// Phase 1: matrix 490 rows 255 cols
[2024-05-22 03:13:53] [INFO ] Computed 10 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-02 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 158/255 variables, 10/107 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 158/265 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/265 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 490/745 variables, 255/520 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/745 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/745 variables, 0/520 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 745/745 variables, and 520 constraints, problems are : Problem set: 2 solved, 4 unsolved in 918 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 51/51 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/51 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-09 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 204/255 variables, 10/61 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 204/265 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-22 03:13:55] [INFO ] Deduced a trap composed of 16 places in 348 ms of which 40 ms to minimize.
[2024-05-22 03:13:55] [INFO ] Deduced a trap composed of 7 places in 292 ms of which 5 ms to minimize.
[2024-05-22 03:13:56] [INFO ] Deduced a trap composed of 9 places in 270 ms of which 4 ms to minimize.
[2024-05-22 03:13:56] [INFO ] Deduced a trap composed of 21 places in 258 ms of which 2 ms to minimize.
[2024-05-22 03:13:56] [INFO ] Deduced a trap composed of 35 places in 153 ms of which 3 ms to minimize.
[2024-05-22 03:13:56] [INFO ] Deduced a trap composed of 12 places in 219 ms of which 2 ms to minimize.
[2024-05-22 03:13:57] [INFO ] Deduced a trap composed of 22 places in 206 ms of which 3 ms to minimize.
[2024-05-22 03:13:57] [INFO ] Deduced a trap composed of 18 places in 243 ms of which 5 ms to minimize.
[2024-05-22 03:13:57] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 9/274 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/274 constraints. Problems are: Problem set: 4 solved, 2 unsolved
Problem AutonomousCar-PT-05b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 490/745 variables, 255/529 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/745 variables, 1/530 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/745 variables, 0/530 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/745 variables, 0/530 constraints. Problems are: Problem set: 5 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 745/745 variables, and 530 constraints, problems are : Problem set: 5 solved, 1 unsolved in 3144 ms.
Refiners :[Domain max(s): 255/255 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 1/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 4293ms problems are : Problem set: 5 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 37 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 490/490 transitions.
Graph (trivial) has 181 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 759 edges and 253 vertex of which 246 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.4 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 246 transition count 416
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 73 rules applied. Total rules applied 140 place count 183 transition count 406
Reduce places removed 5 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 2 with 22 rules applied. Total rules applied 162 place count 178 transition count 389
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 3 with 17 rules applied. Total rules applied 179 place count 161 transition count 389
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 179 place count 161 transition count 383
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 191 place count 155 transition count 383
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 204 place count 142 transition count 370
Iterating global reduction 4 with 13 rules applied. Total rules applied 217 place count 142 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 142 transition count 369
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 218 place count 142 transition count 368
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 141 transition count 368
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 222 place count 139 transition count 348
Iterating global reduction 5 with 2 rules applied. Total rules applied 224 place count 139 transition count 348
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 280 place count 111 transition count 320
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 284 place count 107 transition count 276
Iterating global reduction 5 with 4 rules applied. Total rules applied 288 place count 107 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 74 transitions
Redundant transition composition rules discarded 74 transitions
Iterating global reduction 5 with 74 rules applied. Total rules applied 362 place count 107 transition count 202
Free-agglomeration rule applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 373 place count 107 transition count 191
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 384 place count 96 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 387 place count 96 transition count 188
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 389 place count 96 transition count 188
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 390 place count 96 transition count 188
Applied a total of 390 rules in 188 ms. Remains 96 /255 variables (removed 159) and now considering 188/490 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 202 ms. Remains : 96/255 places, 188/490 transitions.
RANDOM walk for 40000 steps (885 resets) in 404 ms. (98 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (129 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1921218 steps, run timeout after 3001 ms. (steps per millisecond=640 ) properties seen :0 out of 1
Probabilistic random walk after 1921218 steps, saw 276169 distinct states, run finished after 3010 ms. (steps per millisecond=638 ) properties seen :0
// Phase 1: matrix 188 rows 96 cols
[2024-05-22 03:14:01] [INFO ] Computed 10 invariants in 3 ms
[2024-05-22 03:14:01] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/96 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 188/284 variables, 96/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:01] [INFO ] Deduced a trap composed of 11 places in 143 ms of which 2 ms to minimize.
[2024-05-22 03:14:02] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2024-05-22 03:14:02] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 3/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/284 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 113 constraints, problems are : Problem set: 0 solved, 1 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 59/96 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 3/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:02] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 2 ms to minimize.
[2024-05-22 03:14:02] [INFO ] Deduced a trap composed of 8 places in 122 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:02] [INFO ] Deduced a trap composed of 8 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 188/284 variables, 96/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 4/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:03] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/284 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 118 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1688ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 53 ms.
Support contains 37 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 188/188 transitions.
Applied a total of 0 rules in 13 ms. Remains 96 /96 variables (removed 0) and now considering 188/188 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 96/96 places, 188/188 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 188/188 transitions.
Applied a total of 0 rules in 11 ms. Remains 96 /96 variables (removed 0) and now considering 188/188 (removed 0) transitions.
[2024-05-22 03:14:03] [INFO ] Invariant cache hit.
[2024-05-22 03:14:03] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-22 03:14:03] [INFO ] Invariant cache hit.
[2024-05-22 03:14:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 03:14:03] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2024-05-22 03:14:03] [INFO ] Redundant transitions in 11 ms returned []
Running 187 sub problems to find dead transitions.
[2024-05-22 03:14:03] [INFO ] Invariant cache hit.
[2024-05-22 03:14:03] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 03:14:06] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 2 ms to minimize.
[2024-05-22 03:14:06] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 1 ms to minimize.
[2024-05-22 03:14:06] [INFO ] Deduced a trap composed of 13 places in 115 ms of which 3 ms to minimize.
[2024-05-22 03:14:06] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 1 ms to minimize.
[2024-05-22 03:14:06] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 1 ms to minimize.
[2024-05-22 03:14:06] [INFO ] Deduced a trap composed of 14 places in 88 ms of which 3 ms to minimize.
[2024-05-22 03:14:06] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 1 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 1 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 2 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 2 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 3 ms to minimize.
[2024-05-22 03:14:07] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 9 ms to minimize.
[2024-05-22 03:14:08] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 187 unsolved
[2024-05-22 03:14:08] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-05-22 03:14:08] [INFO ] Deduced a trap composed of 10 places in 123 ms of which 2 ms to minimize.
[2024-05-22 03:14:08] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-22 03:14:08] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 3 ms to minimize.
[2024-05-22 03:14:08] [INFO ] Deduced a trap composed of 12 places in 45 ms of which 1 ms to minimize.
[2024-05-22 03:14:09] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 03:14:09] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-05-22 03:14:09] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 1 ms to minimize.
[2024-05-22 03:14:09] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 2 ms to minimize.
[2024-05-22 03:14:09] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 187 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 187 unsolved
Problem TDEAD114 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD185 is UNSAT
At refinement iteration 5 (OVERLAPS) 188/284 variables, 96/136 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 4/140 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 0/284 variables, 0/140 constraints. Problems are: Problem set: 3 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 284/284 variables, and 140 constraints, problems are : Problem set: 3 solved, 184 unsolved in 9599 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 187/187 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 3 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 2/96 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 30/40 constraints. Problems are: Problem set: 3 solved, 184 unsolved
[2024-05-22 03:14:15] [INFO ] Deduced a trap composed of 18 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 1/41 constraints. Problems are: Problem set: 3 solved, 184 unsolved
[2024-05-22 03:14:16] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 1/42 constraints. Problems are: Problem set: 3 solved, 184 unsolved
[2024-05-22 03:14:16] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/96 variables, 1/43 constraints. Problems are: Problem set: 3 solved, 184 unsolved
[2024-05-22 03:14:17] [INFO ] Deduced a trap composed of 20 places in 103 ms of which 4 ms to minimize.
[2024-05-22 03:14:17] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 2/45 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 8 (OVERLAPS) 188/284 variables, 96/141 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 4/145 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 184/329 constraints. Problems are: Problem set: 3 solved, 184 unsolved
[2024-05-22 03:14:21] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-05-22 03:14:22] [INFO ] Deduced a trap composed of 8 places in 77 ms of which 1 ms to minimize.
[2024-05-22 03:14:22] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 1 ms to minimize.
[2024-05-22 03:14:22] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 1 ms to minimize.
[2024-05-22 03:14:22] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 5/334 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 0/334 constraints. Problems are: Problem set: 3 solved, 184 unsolved
[2024-05-22 03:14:29] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/284 variables, 1/335 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/335 constraints. Problems are: Problem set: 3 solved, 184 unsolved
At refinement iteration 15 (OVERLAPS) 0/284 variables, 0/335 constraints. Problems are: Problem set: 3 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 284/284 variables, and 335 constraints, problems are : Problem set: 3 solved, 184 unsolved in 27195 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 96/96 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 184/187 constraints, Known Traps: 41/41 constraints]
After SMT, in 37293ms problems are : Problem set: 3 solved, 184 unsolved
Search for dead transitions found 3 dead transitions in 37301ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 96/96 places, 185/188 transitions.
Graph (complete) has 456 edges and 96 vertex of which 95 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 95 /96 variables (removed 1) and now considering 185/185 (removed 0) transitions.
// Phase 1: matrix 185 rows 95 cols
[2024-05-22 03:14:41] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 03:14:41] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-22 03:14:41] [INFO ] Invariant cache hit.
[2024-05-22 03:14:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:14:41] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 95/96 places, 185/188 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 38052 ms. Remains : 95/96 places, 185/188 transitions.
RANDOM walk for 40000 steps (897 resets) in 182 ms. (218 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (154 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2402438 steps, run timeout after 3001 ms. (steps per millisecond=800 ) properties seen :0 out of 1
Probabilistic random walk after 2402438 steps, saw 343611 distinct states, run finished after 3001 ms. (steps per millisecond=800 ) properties seen :0
[2024-05-22 03:14:44] [INFO ] Invariant cache hit.
[2024-05-22 03:14:44] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/91 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/95 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 185/280 variables, 95/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 108 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 2/2 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/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 54/91 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:44] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 4/95 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 185/280 variables, 95/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 2/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:45] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 03:14:45] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/280 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/280 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 112 constraints, problems are : Problem set: 0 solved, 1 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 939ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 39 ms.
Support contains 37 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 185/185 transitions.
Applied a total of 0 rules in 11 ms. Remains 95 /95 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 95/95 places, 185/185 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 185/185 transitions.
Applied a total of 0 rules in 11 ms. Remains 95 /95 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2024-05-22 03:14:45] [INFO ] Invariant cache hit.
[2024-05-22 03:14:45] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-22 03:14:45] [INFO ] Invariant cache hit.
[2024-05-22 03:14:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-22 03:14:45] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2024-05-22 03:14:45] [INFO ] Redundant transitions in 12 ms returned []
Running 184 sub problems to find dead transitions.
[2024-05-22 03:14:45] [INFO ] Invariant cache hit.
[2024-05-22 03:14:45] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 2 ms to minimize.
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 20 places in 127 ms of which 3 ms to minimize.
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-22 03:14:48] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 2 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 26 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-05-22 03:14:49] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 03:14:50] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:14:50] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-05-22 03:14:50] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-22 03:14:51] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 1 ms to minimize.
[2024-05-22 03:14:51] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 2 ms to minimize.
[2024-05-22 03:14:51] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 1 ms to minimize.
[2024-05-22 03:14:51] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2024-05-22 03:14:51] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 03:14:51] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 185/280 variables, 95/135 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 9 (OVERLAPS) 0/280 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 137 constraints, problems are : Problem set: 0 solved, 184 unsolved in 12346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 184 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 29/40 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 03:15:00] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-05-22 03:15:00] [INFO ] Deduced a trap composed of 20 places in 100 ms of which 1 ms to minimize.
[2024-05-22 03:15:00] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-05-22 03:15:00] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 6 (OVERLAPS) 185/280 variables, 95/139 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 2/141 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/280 variables, 184/325 constraints. Problems are: Problem set: 0 solved, 184 unsolved
[2024-05-22 03:15:04] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-22 03:15:04] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:15:04] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-05-22 03:15:04] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 1 ms to minimize.
[2024-05-22 03:15:04] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2024-05-22 03:15:05] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 2 ms to minimize.
[2024-05-22 03:15:06] [INFO ] Deduced a trap composed of 20 places in 104 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/280 variables, 7/332 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 184 unsolved
At refinement iteration 11 (OVERLAPS) 0/280 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 184 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 332 constraints, problems are : Problem set: 0 solved, 184 unsolved in 20159 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 95/95 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 184/184 constraints, Known Traps: 40/40 constraints]
After SMT, in 32905ms problems are : Problem set: 0 solved, 184 unsolved
Search for dead transitions found 0 dead transitions in 32910ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33226 ms. Remains : 95/95 places, 185/185 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 7 ms. Remains 95 /95 variables (removed 0) and now considering 185/185 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 03:15:18] [INFO ] Invariant cache hit.
[2024-05-22 03:15:18] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 03:15:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-22 03:15:18] [INFO ] [Nat]Absence check using 10 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 03:15:19] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 03:15:19] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-22 03:15:19] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2024-05-22 03:15:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
TRAPS : Iteration 1
[2024-05-22 03:15:19] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 03:15:19] [INFO ] After 427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 509 ms.
[2024-05-22 03:15:19] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-22 03:15:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 95 places, 185 transitions and 1135 arcs took 8 ms.
[2024-05-22 03:15:19] [INFO ] Flatten gal took : 101 ms
Total runtime 88038 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-05b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 95
TRANSITIONS: 185
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.008s, Sys 0.002s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 921
MODEL NAME: /home/mcc/execution/415/model
95 places, 185 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-05b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716347722189

--------------------
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

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-05b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AutonomousCar-PT-05b, 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 r025-smll-171620166300294"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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