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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 18:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 12 18:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 12 18:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 18:06 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 228K 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-06b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716349310936

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 03:41:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 03:41:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 03:41:53] [INFO ] Load time of PNML (sax parser for PT used): 242 ms
[2024-05-22 03:41:53] [INFO ] Transformed 289 places.
[2024-05-22 03:41:53] [INFO ] Transformed 644 transitions.
[2024-05-22 03:41:53] [INFO ] Found NUPN structural information;
[2024-05-22 03:41:53] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (30 resets) in 1820 ms. (21 steps per ms) remains 9/16 properties
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (69 resets) in 369 ms. (108 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (68 resets) in 835 ms. (47 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (86 resets) in 348 ms. (114 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (68 resets) in 678 ms. (58 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (122 resets) in 274 ms. (145 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (143 resets) in 222 ms. (179 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 464 ms. (86 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (88 resets) in 258 ms. (154 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 262 ms. (152 steps per ms) remains 8/8 properties
// Phase 1: matrix 644 rows 289 cols
[2024-05-22 03:41:55] [INFO ] Computed 11 invariants in 51 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 112/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 177/289 variables, 11/123 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 177/300 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/300 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 644/933 variables, 289/589 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 0/589 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/933 variables, 0/589 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 933/933 variables, and 589 constraints, problems are : Problem set: 3 solved, 5 unsolved in 1375 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/79 variables, 79/79 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/79 variables, 0/79 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-05 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-06b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 210/289 variables, 11/90 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 210/300 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 0/300 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 644/933 variables, 289/589 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/933 variables, 3/592 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-05-22 03:42:00] [INFO ] Deduced a trap composed of 35 places in 498 ms of which 65 ms to minimize.
[2024-05-22 03:42:00] [INFO ] Deduced a trap composed of 35 places in 363 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/933 variables, 2/594 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/933 variables, 0/594 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/933 variables, 0/594 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 933/933 variables, and 594 constraints, problems are : Problem set: 5 solved, 3 unsolved in 4395 ms.
Refiners :[Domain max(s): 289/289 constraints, Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 6624ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 4307 ms.
Support contains 58 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 644/644 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 83 place count 289 transition count 561
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 94 rules applied. Total rules applied 177 place count 206 transition count 550
Reduce places removed 5 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 15 rules applied. Total rules applied 192 place count 201 transition count 540
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 204 place count 191 transition count 538
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 204 place count 191 transition count 520
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 240 place count 173 transition count 520
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 266 place count 147 transition count 494
Iterating global reduction 4 with 26 rules applied. Total rules applied 292 place count 147 transition count 494
Ensure Unique test removed 147 transitions
Reduce isomorphic transitions removed 147 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 148 rules applied. Total rules applied 440 place count 147 transition count 346
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 441 place count 146 transition count 346
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 443 place count 144 transition count 339
Iterating global reduction 6 with 2 rules applied. Total rules applied 445 place count 144 transition count 339
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 447 place count 144 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 448 place count 143 transition count 337
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 490 place count 122 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 491 place count 122 transition count 315
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 493 place count 122 transition count 313
Free-agglomeration rule applied 11 times.
Iterating global reduction 9 with 11 rules applied. Total rules applied 504 place count 122 transition count 302
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 9 with 11 rules applied. Total rules applied 515 place count 111 transition count 302
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 517 place count 111 transition count 302
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 518 place count 110 transition count 295
Iterating global reduction 10 with 1 rules applied. Total rules applied 519 place count 110 transition count 295
Applied a total of 519 rules in 218 ms. Remains 110 /289 variables (removed 179) and now considering 295/644 (removed 349) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 110/289 places, 295/644 transitions.
RANDOM walk for 40000 steps (533 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (130 resets) in 81 ms. (487 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (76 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (157 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 999519 steps, run timeout after 3001 ms. (steps per millisecond=333 ) properties seen :0 out of 3
Probabilistic random walk after 999519 steps, saw 145090 distinct states, run finished after 3006 ms. (steps per millisecond=332 ) properties seen :0
// Phase 1: matrix 295 rows 110 cols
[2024-05-22 03:42:10] [INFO ] Computed 11 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 295/405 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/405 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 405/405 variables, and 121 constraints, problems are : Problem set: 0 solved, 3 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 52/110 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/110 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 295/405 variables, 110/121 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 03:42:11] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 1 ms to minimize.
[2024-05-22 03:42:11] [INFO ] Deduced a trap composed of 16 places in 183 ms of which 3 ms to minimize.
[2024-05-22 03:42:11] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 2 ms to minimize.
[2024-05-22 03:42:11] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/405 variables, 4/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/405 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 405/405 variables, and 128 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 110/110 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints]
After SMT, in 2333ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 971 ms.
Support contains 58 out of 110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 110 /110 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 110/110 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 110/110 places, 295/295 transitions.
Applied a total of 0 rules in 9 ms. Remains 110 /110 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-22 03:42:13] [INFO ] Invariant cache hit.
[2024-05-22 03:42:13] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 03:42:13] [INFO ] Invariant cache hit.
[2024-05-22 03:42:13] [INFO ] Implicit Places using invariants and state equation in 159 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 240 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 109/110 places, 295/295 transitions.
Applied a total of 0 rules in 11 ms. Remains 109 /109 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 261 ms. Remains : 109/110 places, 295/295 transitions.
RANDOM walk for 40000 steps (510 resets) in 296 ms. (134 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (64 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (158 resets) in 305 ms. (130 steps per ms) remains 2/2 properties
// Phase 1: matrix 295 rows 109 cols
[2024-05-22 03:42:14] [INFO ] Computed 10 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/400 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/404 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/400 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/404 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1049 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1452ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 453 ms.
Support contains 58 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 295/295 transitions.
Applied a total of 0 rules in 13 ms. Remains 109 /109 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 109/109 places, 295/295 transitions.
RANDOM walk for 40000 steps (359 resets) in 150 ms. (264 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (25 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (158 resets) in 192 ms. (207 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1113924 steps, run timeout after 3001 ms. (steps per millisecond=371 ) properties seen :0 out of 2
Probabilistic random walk after 1113924 steps, saw 160588 distinct states, run finished after 3001 ms. (steps per millisecond=371 ) properties seen :0
[2024-05-22 03:42:19] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/400 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/404 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/404 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 119 constraints, problems are : Problem set: 0 solved, 2 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/400 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/404 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 03:42:20] [INFO ] Deduced a trap composed of 16 places in 113 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 03:42:20] [INFO ] Deduced a trap composed of 9 places in 170 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/404 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/404 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 123 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1533 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1784ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 283 ms.
Support contains 58 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 295/295 transitions.
Applied a total of 0 rules in 7 ms. Remains 109 /109 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 109/109 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 295/295 transitions.
Applied a total of 0 rules in 8 ms. Remains 109 /109 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2024-05-22 03:42:21] [INFO ] Invariant cache hit.
[2024-05-22 03:42:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 03:42:21] [INFO ] Invariant cache hit.
[2024-05-22 03:42:21] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-22 03:42:21] [INFO ] Redundant transitions in 21 ms returned []
Running 294 sub problems to find dead transitions.
[2024-05-22 03:42:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 294 unsolved
[2024-05-22 03:42:25] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 2 ms to minimize.
[2024-05-22 03:42:25] [INFO ] Deduced a trap composed of 8 places in 200 ms of which 3 ms to minimize.
[2024-05-22 03:42:25] [INFO ] Deduced a trap composed of 17 places in 206 ms of which 3 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 3 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 16 places in 92 ms of which 2 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 1 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 1 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 1 ms to minimize.
[2024-05-22 03:42:26] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-05-22 03:42:27] [INFO ] Deduced a trap composed of 6 places in 134 ms of which 1 ms to minimize.
[2024-05-22 03:42:27] [INFO ] Deduced a trap composed of 14 places in 129 ms of which 2 ms to minimize.
[2024-05-22 03:42:27] [INFO ] Deduced a trap composed of 12 places in 162 ms of which 2 ms to minimize.
[2024-05-22 03:42:27] [INFO ] Deduced a trap composed of 6 places in 167 ms of which 2 ms to minimize.
[2024-05-22 03:42:27] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2024-05-22 03:42:27] [INFO ] Deduced a trap composed of 6 places in 157 ms of which 2 ms to minimize.
[2024-05-22 03:42:27] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 1 ms to minimize.
[2024-05-22 03:42:28] [INFO ] Deduced a trap composed of 21 places in 116 ms of which 2 ms to minimize.
[2024-05-22 03:42:28] [INFO ] Deduced a trap composed of 14 places in 143 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 294 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 294 unsolved
Problem TDEAD270 is UNSAT
At refinement iteration 4 (OVERLAPS) 295/404 variables, 109/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 6 (OVERLAPS) 0/404 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 139 constraints, problems are : Problem set: 1 solved, 293 unsolved in 17308 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 294/294 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 1 solved, 293 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 10/10 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 20/30 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 4 (OVERLAPS) 295/404 variables, 109/139 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 293/432 constraints. Problems are: Problem set: 1 solved, 293 unsolved
[2024-05-22 03:42:51] [INFO ] Deduced a trap composed of 7 places in 228 ms of which 2 ms to minimize.
[2024-05-22 03:42:51] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 2/434 constraints. Problems are: Problem set: 1 solved, 293 unsolved
[2024-05-22 03:42:55] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 293 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 404/404 variables, and 435 constraints, problems are : Problem set: 1 solved, 293 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 293/294 constraints, Known Traps: 23/23 constraints]
After SMT, in 48454ms problems are : Problem set: 1 solved, 293 unsolved
Search for dead transitions found 1 dead transitions in 48461ms
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 : 109/109 places, 294/295 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 108 transition count 293
Applied a total of 2 rules in 12 ms. Remains 108 /109 variables (removed 1) and now considering 293/294 (removed 1) transitions.
// Phase 1: matrix 293 rows 108 cols
[2024-05-22 03:43:10] [INFO ] Computed 10 invariants in 2 ms
[2024-05-22 03:43:10] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-22 03:43:10] [INFO ] Invariant cache hit.
[2024-05-22 03:43:10] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 108/109 places, 293/295 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48962 ms. Remains : 108/109 places, 293/295 transitions.
RANDOM walk for 40000 steps (734 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (65 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (161 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1028064 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :0 out of 2
Probabilistic random walk after 1028064 steps, saw 148801 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
[2024-05-22 03:43:13] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 293/399 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/401 variables, 2/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/401 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 118 constraints, problems are : Problem set: 0 solved, 2 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 48/106 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 293/399 variables, 106/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 2/401 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 03:43:14] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/401 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/401 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/401 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 401/401 variables, and 121 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1406ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 787 ms.
Support contains 58 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 293/293 transitions.
Applied a total of 0 rules in 13 ms. Remains 108 /108 variables (removed 0) and now considering 293/293 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 108/108 places, 293/293 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 293/293 transitions.
Applied a total of 0 rules in 7 ms. Remains 108 /108 variables (removed 0) and now considering 293/293 (removed 0) transitions.
[2024-05-22 03:43:15] [INFO ] Invariant cache hit.
[2024-05-22 03:43:15] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 03:43:15] [INFO ] Invariant cache hit.
[2024-05-22 03:43:16] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-22 03:43:16] [INFO ] Redundant transitions in 9 ms returned []
Running 292 sub problems to find dead transitions.
[2024-05-22 03:43:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 03:43:19] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 2 ms to minimize.
[2024-05-22 03:43:19] [INFO ] Deduced a trap composed of 8 places in 205 ms of which 3 ms to minimize.
[2024-05-22 03:43:19] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 8 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 9 places in 176 ms of which 3 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 16 places in 126 ms of which 2 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-22 03:43:20] [INFO ] Deduced a trap composed of 16 places in 115 ms of which 2 ms to minimize.
[2024-05-22 03:43:21] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 1 ms to minimize.
[2024-05-22 03:43:21] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2024-05-22 03:43:21] [INFO ] Deduced a trap composed of 16 places in 141 ms of which 2 ms to minimize.
[2024-05-22 03:43:21] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 2 ms to minimize.
[2024-05-22 03:43:21] [INFO ] Deduced a trap composed of 14 places in 204 ms of which 2 ms to minimize.
[2024-05-22 03:43:22] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 2 ms to minimize.
[2024-05-22 03:43:22] [INFO ] Deduced a trap composed of 6 places in 189 ms of which 2 ms to minimize.
[2024-05-22 03:43:22] [INFO ] Deduced a trap composed of 5 places in 190 ms of which 2 ms to minimize.
[2024-05-22 03:43:22] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 1 ms to minimize.
[2024-05-22 03:43:22] [INFO ] Deduced a trap composed of 8 places in 167 ms of which 2 ms to minimize.
[2024-05-22 03:43:23] [INFO ] Deduced a trap composed of 17 places in 156 ms of which 3 ms to minimize.
[2024-05-22 03:43:24] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/401 variables, 108/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 0/401 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 401/401 variables, and 138 constraints, problems are : Problem set: 0 solved, 292 unsolved in 19243 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 293/401 variables, 108/138 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/401 variables, 292/430 constraints. Problems are: Problem set: 0 solved, 292 unsolved
[2024-05-22 03:43:45] [INFO ] Deduced a trap composed of 17 places in 116 ms of which 2 ms to minimize.
[2024-05-22 03:43:50] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/401 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/401 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 401/401 variables, and 432 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 22/22 constraints]
After SMT, in 50148ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 50153ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50372 ms. Remains : 108/108 places, 293/293 transitions.
[2024-05-22 03:44:06] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 10 ms.
[2024-05-22 03:44:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 108 places, 293 transitions and 2168 arcs took 12 ms.
[2024-05-22 03:44:06] [INFO ] Flatten gal took : 167 ms
Total runtime 133390 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-06b

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: 108
TRANSITIONS: 293
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.025s, Sys 0.000s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.003s, 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: 791
MODEL NAME: /home/mcc/execution/415/model
108 places, 293 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-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-06b-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716349449779

--------------------
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 ReachabilityFireability -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-06b"
export BK_EXAMINATION="ReachabilityFireability"
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-06b, examination is ReachabilityFireability"
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-171620166300311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06b.tgz
mv AutonomousCar-PT-06b execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;