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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 928K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 12 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 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 517K 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-08b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2023-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716355550205

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-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:25:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 05:25:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:25:53] [INFO ] Load time of PNML (sax parser for PT used): 402 ms
[2024-05-22 05:25:53] [INFO ] Transformed 357 places.
[2024-05-22 05:25:53] [INFO ] Transformed 1128 transitions.
[2024-05-22 05:25:53] [INFO ] Found NUPN structural information;
[2024-05-22 05:25:53] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 841 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (242 resets) in 3135 ms. (12 steps per ms) remains 10/16 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (44 resets) in 596 ms. (67 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (56 resets) in 1567 ms. (25 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (55 resets) in 225 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (69 resets) in 239 ms. (166 steps per ms) remains 7/8 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (50 resets) in 496 ms. (80 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (63 resets) in 110 ms. (360 steps per ms) remains 6/7 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (73 resets) in 436 ms. (91 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (45 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
// Phase 1: matrix 1128 rows 357 cols
[2024-05-22 05:25:56] [INFO ] Computed 13 invariants in 34 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 88/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-01 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-08 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 269/357 variables, 13/101 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 269/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 1128/1485 variables, 357/727 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 727 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1905 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 71/71 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-00 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-14 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 286/357 variables, 13/84 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 286/370 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-22 05:26:00] [INFO ] Deduced a trap composed of 35 places in 744 ms of which 62 ms to minimize.
[2024-05-22 05:26:00] [INFO ] Deduced a trap composed of 16 places in 807 ms of which 8 ms to minimize.
[2024-05-22 05:26:01] [INFO ] Deduced a trap composed of 48 places in 543 ms of which 5 ms to minimize.
[2024-05-22 05:26:01] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 3 ms to minimize.
[2024-05-22 05:26:02] [INFO ] Deduced a trap composed of 35 places in 515 ms of which 4 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 46 places in 499 ms of which 4 ms to minimize.
[2024-05-22 05:26:03] [INFO ] Deduced a trap composed of 35 places in 460 ms of which 5 ms to minimize.
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 7/377 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-22 05:26:04] [INFO ] Deduced a trap composed of 38 places in 657 ms of which 6 ms to minimize.
SMT process timed out in 8037ms, After SMT, problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 29 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 279 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 7 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 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.26 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 139 rules applied. Total rules applied 141 place count 348 transition count 980
Reduce places removed 137 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 1 with 175 rules applied. Total rules applied 316 place count 211 transition count 942
Reduce places removed 21 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 24 rules applied. Total rules applied 340 place count 190 transition count 939
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 345 place count 187 transition count 937
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 346 place count 186 transition count 937
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 21 Pre rules applied. Total rules applied 346 place count 186 transition count 916
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 388 place count 165 transition count 916
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 419 place count 134 transition count 885
Iterating global reduction 5 with 31 rules applied. Total rules applied 450 place count 134 transition count 885
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Iterating post reduction 5 with 257 rules applied. Total rules applied 707 place count 134 transition count 628
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 711 place count 130 transition count 603
Iterating global reduction 6 with 4 rules applied. Total rules applied 715 place count 130 transition count 603
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 rules applied. Total rules applied 720 place count 130 transition count 598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 722 place count 128 transition count 598
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 8 with 58 rules applied. Total rules applied 780 place count 99 transition count 569
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 782 place count 97 transition count 551
Iterating global reduction 8 with 2 rules applied. Total rules applied 784 place count 97 transition count 551
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 786 place count 97 transition count 549
Free-agglomeration rule applied 18 times.
Iterating global reduction 8 with 18 rules applied. Total rules applied 804 place count 97 transition count 531
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 8 with 18 rules applied. Total rules applied 822 place count 79 transition count 531
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 9 with 7 rules applied. Total rules applied 829 place count 79 transition count 531
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 830 place count 78 transition count 530
Applied a total of 830 rules in 638 ms. Remains 78 /357 variables (removed 279) and now considering 530/1128 (removed 598) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 661 ms. Remains : 78/357 places, 530/1128 transitions.
RANDOM walk for 40000 steps (1094 resets) in 455 ms. (87 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (158 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1162306 steps, run timeout after 3001 ms. (steps per millisecond=387 ) properties seen :0 out of 1
Probabilistic random walk after 1162306 steps, saw 170556 distinct states, run finished after 3006 ms. (steps per millisecond=386 ) properties seen :0
// Phase 1: matrix 530 rows 78 cols
[2024-05-22 05:26:08] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:26:08] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/600 variables, 73/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/608 variables, 5/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/608 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/608 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 92 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/73 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:26:08] [INFO ] Deduced a trap composed of 8 places in 391 ms of which 2 ms to minimize.
[2024-05-22 05:26:09] [INFO ] Deduced a trap composed of 7 places in 377 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 527/600 variables, 73/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/608 variables, 5/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/608 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/608 variables, 1/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/608 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/608 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 95 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2238ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 192 ms.
Support contains 29 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 530/530 transitions.
Applied a total of 0 rules in 35 ms. Remains 78 /78 variables (removed 0) and now considering 530/530 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 78/78 places, 530/530 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 530/530 transitions.
Applied a total of 0 rules in 34 ms. Remains 78 /78 variables (removed 0) and now considering 530/530 (removed 0) transitions.
[2024-05-22 05:26:10] [INFO ] Invariant cache hit.
[2024-05-22 05:26:10] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-22 05:26:10] [INFO ] Invariant cache hit.
[2024-05-22 05:26:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:26:11] [INFO ] Implicit Places using invariants and state equation in 387 ms returned [73, 77]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 538 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 76/78 places, 529/530 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 76 transition count 528
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 75 transition count 528
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 3 place count 75 transition count 527
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 74 transition count 527
Applied a total of 4 rules in 76 ms. Remains 74 /76 variables (removed 2) and now considering 527/529 (removed 2) transitions.
// Phase 1: matrix 527 rows 74 cols
[2024-05-22 05:26:11] [INFO ] Computed 11 invariants in 7 ms
[2024-05-22 05:26:11] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-22 05:26:11] [INFO ] Invariant cache hit.
[2024-05-22 05:26:11] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 74/78 places, 527/530 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1130 ms. Remains : 74/78 places, 527/530 transitions.
RANDOM walk for 40000 steps (668 resets) in 3072 ms. (13 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (162 resets) in 136 ms. (292 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 896650 steps, run timeout after 3001 ms. (steps per millisecond=298 ) properties seen :0 out of 1
Probabilistic random walk after 896650 steps, saw 134202 distinct states, run finished after 3001 ms. (steps per millisecond=298 ) properties seen :0
[2024-05-22 05:26:15] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 527/599 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/601 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/601 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 601/601 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:26:16] [INFO ] Deduced a trap composed of 9 places in 351 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 527/599 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/599 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/601 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 1/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:26:17] [INFO ] Deduced a trap composed of 4 places in 147 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/601 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/601 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/601 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 601/601 variables, and 88 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1942 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 2366ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 227 ms.
Support contains 29 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 527/527 transitions.
Applied a total of 0 rules in 30 ms. Remains 74 /74 variables (removed 0) and now considering 527/527 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 74/74 places, 527/527 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 527/527 transitions.
Applied a total of 0 rules in 36 ms. Remains 74 /74 variables (removed 0) and now considering 527/527 (removed 0) transitions.
[2024-05-22 05:26:18] [INFO ] Invariant cache hit.
[2024-05-22 05:26:18] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-05-22 05:26:18] [INFO ] Invariant cache hit.
[2024-05-22 05:26:18] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
[2024-05-22 05:26:18] [INFO ] Redundant transitions in 81 ms returned []
Running 519 sub problems to find dead transitions.
[2024-05-22 05:26:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 8/74 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 519 unsolved
[2024-05-22 05:26:28] [INFO ] Deduced a trap composed of 7 places in 273 ms of which 1 ms to minimize.
[2024-05-22 05:26:31] [INFO ] Deduced a trap composed of 5 places in 389 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Problem TDEAD526 is UNSAT
At refinement iteration 5 (OVERLAPS) 527/601 variables, 74/87 constraints. Problems are: Problem set: 1 solved, 518 unsolved
[2024-05-22 05:26:39] [INFO ] Deduced a trap composed of 14 places in 269 ms of which 1 ms to minimize.
[2024-05-22 05:26:39] [INFO ] Deduced a trap composed of 14 places in 262 ms of which 1 ms to minimize.
[2024-05-22 05:26:39] [INFO ] Deduced a trap composed of 13 places in 241 ms of which 1 ms to minimize.
[2024-05-22 05:26:40] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 2 ms to minimize.
[2024-05-22 05:26:40] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 2 ms to minimize.
[2024-05-22 05:26:40] [INFO ] Deduced a trap composed of 14 places in 304 ms of which 3 ms to minimize.
[2024-05-22 05:26:41] [INFO ] Deduced a trap composed of 13 places in 287 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/601 variables, 7/94 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 601/601 variables, and 94 constraints, problems are : Problem set: 1 solved, 518 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 1 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 1/3 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 8/74 variables, 9/12 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 8/20 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 527/601 variables, 74/94 constraints. Problems are: Problem set: 1 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/601 variables, 518/612 constraints. Problems are: Problem set: 1 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 601/601 variables, and 612 constraints, problems are : Problem set: 1 solved, 518 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 74/74 constraints, PredecessorRefiner: 518/519 constraints, Known Traps: 9/9 constraints]
After SMT, in 65305ms problems are : Problem set: 1 solved, 518 unsolved
Search for dead transitions found 1 dead transitions in 65324ms
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 : 74/74 places, 526/527 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 73 transition count 525
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 73 transition count 525
Applied a total of 2 rules in 28 ms. Remains 73 /74 variables (removed 1) and now considering 525/526 (removed 1) transitions.
// Phase 1: matrix 525 rows 73 cols
[2024-05-22 05:27:24] [INFO ] Computed 12 invariants in 8 ms
[2024-05-22 05:27:24] [INFO ] Implicit Places using invariants in 124 ms returned [72]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 72/74 places, 525/527 transitions.
Applied a total of 0 rules in 19 ms. Remains 72 /72 variables (removed 0) and now considering 525/525 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 66133 ms. Remains : 72/74 places, 525/527 transitions.
RANDOM walk for 40000 steps (651 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (164 resets) in 205 ms. (194 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1051028 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 1
Probabilistic random walk after 1051028 steps, saw 157175 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
// Phase 1: matrix 525 rows 72 cols
[2024-05-22 05:27:27] [INFO ] Computed 11 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 525/597 variables, 72/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/597 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/597 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 597/597 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 315 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 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/29 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/72 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:27:28] [INFO ] Deduced a trap composed of 9 places in 305 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/72 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 525/597 variables, 72/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/597 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 597/597 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1327 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1711ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 344 ms.
Support contains 29 out of 72 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 525/525 transitions.
Applied a total of 0 rules in 32 ms. Remains 72 /72 variables (removed 0) and now considering 525/525 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 72/72 places, 525/525 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 72/72 places, 525/525 transitions.
Applied a total of 0 rules in 32 ms. Remains 72 /72 variables (removed 0) and now considering 525/525 (removed 0) transitions.
[2024-05-22 05:27:29] [INFO ] Invariant cache hit.
[2024-05-22 05:27:29] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-22 05:27:29] [INFO ] Invariant cache hit.
[2024-05-22 05:27:30] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-22 05:27:30] [INFO ] Redundant transitions in 13 ms returned []
Running 517 sub problems to find dead transitions.
[2024-05-22 05:27:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 8/72 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
[2024-05-22 05:27:40] [INFO ] Deduced a trap composed of 7 places in 420 ms of which 2 ms to minimize.
[2024-05-22 05:27:44] [INFO ] Deduced a trap composed of 5 places in 463 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 525/597 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/597 variables, and 85 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 8/72 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (OVERLAPS) 525/597 variables, 72/85 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/597 variables, 517/602 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 597/597 variables, and 602 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 72/72 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 2/2 constraints]
After SMT, in 65413ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 65423ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65953 ms. Remains : 72/72 places, 525/525 transitions.
[2024-05-22 05:28:35] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-22 05:28:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 72 places, 525 transitions and 6447 arcs took 13 ms.
[2024-05-22 05:28:36] [INFO ] Flatten gal took : 388 ms
Total runtime 163602 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-08b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 72
TRANSITIONS: 525
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.040s, Sys 0.003s]


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


----------------------------------------------------------------------
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: 704
MODEL NAME: /home/mcc/execution/411/model
72 places, 525 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.
Building monolithic NSF...
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2023-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716355717818

--------------------
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-08b"
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-08b, 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-171620166400343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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