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

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

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-07b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 04:39:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 04:39:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:39:14] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-22 04:39:14] [INFO ] Transformed 323 places.
[2024-05-22 04:39:14] [INFO ] Transformed 846 transitions.
[2024-05-22 04:39:14] [INFO ] Found NUPN structural information;
[2024-05-22 04:39:14] [INFO ] Parsed PT model containing 323 places and 846 transitions and 5865 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 37 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 (293 resets) in 2953 ms. (13 steps per ms) remains 9/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
BEST_FIRST walk for 40004 steps (55 resets) in 325 ms. (122 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (58 resets) in 269 ms. (148 steps per ms) remains 6/9 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (47 resets) in 720 ms. (55 steps per ms) remains 5/6 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (63 resets) in 739 ms. (54 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (55 resets) in 339 ms. (117 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (62 resets) in 147 ms. (270 steps per ms) remains 4/5 properties
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (62 resets) in 238 ms. (167 steps per ms) remains 4/4 properties
// Phase 1: matrix 846 rows 323 cols
[2024-05-22 04:39:16] [INFO ] Computed 12 invariants in 30 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 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) 248/323 variables, 12/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/323 variables, 248/335 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/323 variables, 0/335 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 846/1169 variables, 323/658 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1169 variables, 0/658 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-22 04:39:18] [INFO ] Deduced a trap composed of 15 places in 474 ms of which 35 ms to minimize.
[2024-05-22 04:39:18] [INFO ] Deduced a trap composed of 14 places in 419 ms of which 4 ms to minimize.
Problem AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 is UNSAT
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 0/1169 variables, 2/660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1169 variables, 0/660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1169 variables, 0/660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1169/1169 variables, and 660 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2084 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 30/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 282/312 variables, 11/41 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 282/323 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-22 04:39:19] [INFO ] Deduced a trap composed of 17 places in 331 ms of which 3 ms to minimize.
[2024-05-22 04:39:19] [INFO ] Deduced a trap composed of 42 places in 305 ms of which 3 ms to minimize.
[2024-05-22 04:39:20] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 3 ms to minimize.
[2024-05-22 04:39:20] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 3 ms to minimize.
[2024-05-22 04:39:20] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 4 ms to minimize.
[2024-05-22 04:39:20] [INFO ] Deduced a trap composed of 44 places in 319 ms of which 5 ms to minimize.
[2024-05-22 04:39:21] [INFO ] Deduced a trap composed of 35 places in 238 ms of which 3 ms to minimize.
[2024-05-22 04:39:21] [INFO ] Deduced a trap composed of 42 places in 239 ms of which 3 ms to minimize.
[2024-05-22 04:39:21] [INFO ] Deduced a trap composed of 35 places in 229 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
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 9/332 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 0/332 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/323 variables, 1/333 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 11/344 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 2/346 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 0/346 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 846/1169 variables, 323/669 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1169 variables, 1/670 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-05-22 04:39:22] [INFO ] Deduced a trap composed of 32 places in 341 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1169 variables, 1/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1169 variables, 0/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1169 variables, 0/671 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1169/1169 variables, and 671 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3806 ms.
Refiners :[Domain max(s): 323/323 constraints, Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 323/323 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 12/12 constraints]
After SMT, in 6166ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 88 ms.
Support contains 17 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 846/846 transitions.
Graph (trivial) has 277 edges and 323 vertex of which 4 / 323 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 1181 edges and 321 vertex of which 314 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.9 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 122 transitions
Trivial Post-agglo rules discarded 122 transitions
Performed 122 trivial Post agglomeration. Transition count delta: 122
Iterating post reduction 0 with 123 rules applied. Total rules applied 125 place count 314 transition count 714
Reduce places removed 122 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 145 rules applied. Total rules applied 270 place count 192 transition count 691
Reduce places removed 13 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 22 rules applied. Total rules applied 292 place count 179 transition count 682
Reduce places removed 9 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 3 with 13 rules applied. Total rules applied 305 place count 170 transition count 678
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 307 place count 168 transition count 678
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 307 place count 168 transition count 670
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 323 place count 160 transition count 670
Discarding 27 places :
Symmetric choice reduction at 5 with 27 rule applications. Total rules 350 place count 133 transition count 643
Iterating global reduction 5 with 27 rules applied. Total rules applied 377 place count 133 transition count 643
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 379 place count 133 transition count 641
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 379 place count 133 transition count 638
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 385 place count 130 transition count 638
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 392 place count 123 transition count 553
Iterating global reduction 6 with 7 rules applied. Total rules applied 399 place count 123 transition count 553
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 405 place count 123 transition count 547
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 407 place count 121 transition count 547
Performed 35 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 70 rules applied. Total rules applied 477 place count 86 transition count 511
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 483 place count 80 transition count 421
Iterating global reduction 8 with 6 rules applied. Total rules applied 489 place count 80 transition count 421
Drop transitions (Redundant composition of simpler transitions.) removed 115 transitions
Redundant transition composition rules discarded 115 transitions
Iterating global reduction 8 with 115 rules applied. Total rules applied 604 place count 80 transition count 306
Free-agglomeration rule applied 7 times.
Iterating global reduction 8 with 7 rules applied. Total rules applied 611 place count 80 transition count 299
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 618 place count 73 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 619 place count 73 transition count 298
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 620 place count 73 transition count 298
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 621 place count 72 transition count 297
Applied a total of 621 rules in 329 ms. Remains 72 /323 variables (removed 251) and now considering 297/846 (removed 549) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 344 ms. Remains : 72/323 places, 297/846 transitions.
RANDOM walk for 40000 steps (1615 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (192 resets) in 117 ms. (339 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1588231 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :0 out of 1
Probabilistic random walk after 1588231 steps, saw 234956 distinct states, run finished after 3011 ms. (steps per millisecond=527 ) properties seen :0
// Phase 1: matrix 297 rows 72 cols
[2024-05-22 04:39:26] [INFO ] Computed 11 invariants in 3 ms
[2024-05-22 04:39:26] [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) 43/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 297/357 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/369 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/369 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 369/369 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 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) 43/60 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 297/357 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/369 variables, 12/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:39:26] [INFO ] Deduced a trap composed of 4 places in 166 ms of which 2 ms to minimize.
[2024-05-22 04:39:27] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 2/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/369 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 369/369 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 654 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 863ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 17 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 297/297 transitions.
Applied a total of 0 rules in 17 ms. Remains 72 /72 variables (removed 0) and now considering 297/297 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 72/72 places, 297/297 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 297/297 transitions.
Applied a total of 0 rules in 18 ms. Remains 72 /72 variables (removed 0) and now considering 297/297 (removed 0) transitions.
[2024-05-22 04:39:27] [INFO ] Invariant cache hit.
[2024-05-22 04:39:27] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-22 04:39:27] [INFO ] Invariant cache hit.
[2024-05-22 04:39:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 04:39:27] [INFO ] Implicit Places using invariants and state equation in 240 ms returned [64, 71]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 405 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 70/72 places, 297/297 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 296
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 296
Applied a total of 2 rules in 15 ms. Remains 69 /70 variables (removed 1) and now considering 296/297 (removed 1) transitions.
// Phase 1: matrix 296 rows 69 cols
[2024-05-22 04:39:27] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 04:39:27] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-22 04:39:27] [INFO ] Invariant cache hit.
[2024-05-22 04:39:28] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 69/72 places, 296/297 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 780 ms. Remains : 69/72 places, 296/297 transitions.
RANDOM walk for 40000 steps (1574 resets) in 1561 ms. (25 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (185 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1863079 steps, run timeout after 3001 ms. (steps per millisecond=620 ) properties seen :0 out of 1
Probabilistic random walk after 1863079 steps, saw 270138 distinct states, run finished after 3001 ms. (steps per millisecond=620 ) properties seen :0
[2024-05-22 04:39:31] [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) 296/350 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/365 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 78 constraints, problems are : Problem set: 0 solved, 1 unsolved in 167 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) 296/350 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 15/365 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:39:32] [INFO ] Deduced a trap composed of 4 places in 176 ms of which 1 ms to minimize.
[2024-05-22 04:39:32] [INFO ] Deduced a trap composed of 3 places in 166 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 2/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/365 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 81 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 823ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 17 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 296/296 transitions.
Applied a total of 0 rules in 15 ms. Remains 69 /69 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 69/69 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 296/296 transitions.
Applied a total of 0 rules in 11 ms. Remains 69 /69 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2024-05-22 04:39:32] [INFO ] Invariant cache hit.
[2024-05-22 04:39:32] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-22 04:39:32] [INFO ] Invariant cache hit.
[2024-05-22 04:39:32] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 364 ms to find 0 implicit places.
[2024-05-22 04:39:32] [INFO ] Redundant transitions in 60 ms returned []
Running 295 sub problems to find dead transitions.
[2024-05-22 04:39:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 295 unsolved
At refinement iteration 2 (OVERLAPS) 1/69 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 295 unsolved
[2024-05-22 04:39:36] [INFO ] Deduced a trap composed of 12 places in 131 ms of which 2 ms to minimize.
[2024-05-22 04:39:36] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 1 ms to minimize.
[2024-05-22 04:39:36] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 1 ms to minimize.
[2024-05-22 04:39:36] [INFO ] Deduced a trap composed of 12 places in 100 ms of which 1 ms to minimize.
[2024-05-22 04:39:37] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2024-05-22 04:39:37] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-22 04:39:38] [INFO ] Deduced a trap composed of 23 places in 151 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, 295 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 295 unsolved
Problem TDEAD260 is UNSAT
At refinement iteration 5 (OVERLAPS) 296/365 variables, 69/85 constraints. Problems are: Problem set: 1 solved, 294 unsolved
[2024-05-22 04:39:40] [INFO ] Deduced a trap composed of 4 places in 153 ms of which 2 ms to minimize.
[2024-05-22 04:39:40] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 1 ms to minimize.
[2024-05-22 04:39:40] [INFO ] Deduced a trap composed of 10 places in 148 ms of which 1 ms to minimize.
[2024-05-22 04:39:40] [INFO ] Deduced a trap composed of 5 places in 171 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 4/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 89 constraints, problems are : Problem set: 1 solved, 294 unsolved in 12070 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 295/295 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 1 solved, 294 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 3 (OVERLAPS) 1/69 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/69 variables, 9/20 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/69 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 6 (OVERLAPS) 296/365 variables, 69/89 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 294/383 constraints. Problems are: Problem set: 1 solved, 294 unsolved
[2024-05-22 04:39:57] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/365 variables, 1/384 constraints. Problems are: Problem set: 1 solved, 294 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/365 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 294 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 365/365 variables, and 384 constraints, problems are : Problem set: 1 solved, 294 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 294/295 constraints, Known Traps: 12/12 constraints]
After SMT, in 43979ms problems are : Problem set: 1 solved, 294 unsolved
Search for dead transitions found 1 dead transitions in 43987ms
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, 295/296 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 294
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 294
Applied a total of 2 rules in 23 ms. Remains 68 /69 variables (removed 1) and now considering 294/295 (removed 1) transitions.
// Phase 1: matrix 294 rows 68 cols
[2024-05-22 04:40:16] [INFO ] Computed 9 invariants in 3 ms
[2024-05-22 04:40:16] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-05-22 04:40:16] [INFO ] Invariant cache hit.
[2024-05-22 04:40:17] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 68/69 places, 294/296 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 44893 ms. Remains : 68/69 places, 294/296 transitions.
RANDOM walk for 40000 steps (1629 resets) in 383 ms. (104 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (189 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1677409 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :0 out of 1
Probabilistic random walk after 1677409 steps, saw 244690 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
[2024-05-22 04:40:20] [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) 294/348 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/362 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 77 constraints, problems are : Problem set: 0 solved, 1 unsolved in 169 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) 294/348 variables, 54/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/348 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 14/362 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:40:20] [INFO ] Deduced a trap composed of 4 places in 164 ms of which 1 ms to minimize.
[2024-05-22 04:40:21] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/362 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 362/362 variables, and 80 constraints, problems are : Problem set: 0 solved, 1 unsolved in 788 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 968ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 17 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 294/294 transitions.
Applied a total of 0 rules in 17 ms. Remains 68 /68 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 68/68 places, 294/294 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 294/294 transitions.
Applied a total of 0 rules in 16 ms. Remains 68 /68 variables (removed 0) and now considering 294/294 (removed 0) transitions.
[2024-05-22 04:40:21] [INFO ] Invariant cache hit.
[2024-05-22 04:40:21] [INFO ] Implicit Places using invariants in 275 ms returned []
[2024-05-22 04:40:21] [INFO ] Invariant cache hit.
[2024-05-22 04:40:22] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2024-05-22 04:40:22] [INFO ] Redundant transitions in 7 ms returned []
Running 293 sub problems to find dead transitions.
[2024-05-22 04:40:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (OVERLAPS) 1/68 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:40:26] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2024-05-22 04:40:26] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 2 ms to minimize.
[2024-05-22 04:40:26] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 1 ms to minimize.
[2024-05-22 04:40:26] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-05-22 04:40:26] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 6 ms to minimize.
[2024-05-22 04:40:27] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 2 ms to minimize.
[2024-05-22 04:40:28] [INFO ] Deduced a trap composed of 23 places in 196 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, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 294/362 variables, 68/84 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:40:31] [INFO ] Deduced a trap composed of 4 places in 183 ms of which 1 ms to minimize.
[2024-05-22 04:40:31] [INFO ] Deduced a trap composed of 10 places in 142 ms of which 1 ms to minimize.
[2024-05-22 04:40:31] [INFO ] Deduced a trap composed of 10 places in 206 ms of which 2 ms to minimize.
[2024-05-22 04:40:31] [INFO ] Deduced a trap composed of 4 places in 208 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 4/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 0/362 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 362/362 variables, and 88 constraints, problems are : Problem set: 0 solved, 293 unsolved in 17551 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 1/68 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/68 variables, 9/20 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/68 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 294/362 variables, 68/88 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/362 variables, 293/381 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:40:51] [INFO ] Deduced a trap composed of 19 places in 203 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/362 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 293 unsolved
[2024-05-22 04:41:00] [INFO ] Deduced a trap composed of 18 places in 114 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/362 variables, 1/383 constraints. Problems are: Problem set: 0 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/362 variables, and 383 constraints, problems are : Problem set: 0 solved, 293 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 293/293 constraints, Known Traps: 13/13 constraints]
After SMT, in 49340ms problems are : Problem set: 0 solved, 293 unsolved
Search for dead transitions found 0 dead transitions in 49351ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50006 ms. Remains : 68/68 places, 294/294 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 11 ms. Remains 68 /68 variables (removed 0) and now considering 294/294 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-22 04:41:11] [INFO ] Invariant cache hit.
[2024-05-22 04:41:11] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 04:41:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-22 04:41:11] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 04:41:11] [INFO ] Deduced a trap composed of 4 places in 154 ms of which 1 ms to minimize.
[2024-05-22 04:41:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 180 ms
TRAPS : Iteration 1
[2024-05-22 04:41:11] [INFO ] After 391ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 04:41:12] [INFO ] After 470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 557 ms.
[2024-05-22 04:41:12] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-22 04:41:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 68 places, 294 transitions and 3063 arcs took 16 ms.
[2024-05-22 04:41:12] [INFO ] Flatten gal took : 145 ms
Total runtime 118277 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-07b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 68
TRANSITIONS: 294
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.014s, Sys 0.005s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 770
MODEL NAME: /home/mcc/execution/412/model
68 places, 294 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.
Building monolithic NSF...
FORMULA AutonomousCar-PT-07b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716352873918

--------------------
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-07b"
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-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 r025-smll-171620166400326"
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 ;