MCC'2024- Execution of r025-smll-171620166400351

About the Execution of GreatSPN+red for AutonomousCar-PT-09a

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
14627.384	226616.00	321958.00	722.50	TTFFFFTTTFTFTTTF	normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 23K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 18:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 12 18:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 12 18:03 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 781K 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-09a-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-09a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716356693801

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-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:44:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 05:44:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:44:56] [INFO ] Load time of PNML (sax parser for PT used): 327 ms
[2024-05-22 05:44:56] [INFO ] Transformed 89 places.
[2024-05-22 05:44:56] [INFO ] Transformed 1249 transitions.
[2024-05-22 05:44:56] [INFO ] Found NUPN structural information;
[2024-05-22 05:44:56] [INFO ] Parsed PT model containing 89 places and 1249 transitions and 15631 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 345 transitions
Reduce redundant transitions removed 345 transitions.
RANDOM walk for 40000 steps (1961 resets) in 6370 ms. (6 steps per ms) remains 13/16 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (84 resets) in 282 ms. (141 steps per ms) remains 11/13 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (117 resets) in 916 ms. (43 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (114 resets) in 310 ms. (128 steps per ms) remains 10/11 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (117 resets) in 290 ms. (137 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (112 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (161 resets) in 897 ms. (44 steps per ms) remains 9/10 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (106 resets) in 496 ms. (80 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (154 resets) in 469 ms. (85 steps per ms) remains 8/9 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (110 resets) in 64 ms. (615 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (119 resets) in 465 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (124 resets) in 76 ms. (519 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (113 resets) in 192 ms. (207 steps per ms) remains 8/8 properties
[2024-05-22 05:44:59] [INFO ] Flow matrix only has 903 transitions (discarded 1 similar events)
// Phase 1: matrix 903 rows 89 cols
[2024-05-22 05:45:00] [INFO ] Computed 14 invariants in 54 ms
[2024-05-22 05:45:00] [INFO ] State equation strengthened by 327 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-15 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/72 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 20/89 variables, 11/83 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 20/103 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/103 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 902/991 variables, 89/192 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/991 variables, 326/518 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 0/518 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 1/992 variables, 1/519 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/992 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/992 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 519 constraints, problems are : Problem set: 1 solved, 7 unsolved in 2244 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/69 variables, 69/69 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-13 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (INCLUDED_ONLY) 0/69 variables, 3/72 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/69 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-01 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-09a-ReachabilityFireability-2024-10 is UNSAT
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 20/89 variables, 11/83 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 20/103 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/103 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 902/991 variables, 89/192 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/991 variables, 326/518 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 3/521 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/991 variables, 0/521 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/992 variables, 1/522 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/992 variables, 0/522 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/992 variables, 0/522 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 992/992 variables, and 522 constraints, problems are : Problem set: 5 solved, 3 unsolved in 4258 ms.
Refiners :[Domain max(s): 89/89 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 89/89 constraints, ReadFeed: 327/327 constraints, PredecessorRefiner: 3/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 8188ms problems are : Problem set: 5 solved, 3 unsolved
Parikh walk visited 0 properties in 10123 ms.
Support contains 36 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 904/904 transitions.
Graph (complete) has 1045 edges and 89 vertex of which 87 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.26 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 87 transition count 894
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 81 transition count 892
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 79 transition count 892
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 19 place count 79 transition count 890
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 23 place count 77 transition count 890
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 27 place count 73 transition count 850
Iterating global reduction 3 with 4 rules applied. Total rules applied 31 place count 73 transition count 850
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 38 place count 73 transition count 843
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 99 place count 66 transition count 789
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 66 transition count 789
Applied a total of 100 rules in 377 ms. Remains 66 /89 variables (removed 23) and now considering 789/904 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 394 ms. Remains : 66/89 places, 789/904 transitions.
RANDOM walk for 40000 steps (124 resets) in 940 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (112 resets) in 287 ms. (138 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (109 resets) in 128 ms. (310 steps per ms) remains 2/3 properties
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 789 rows 66 cols
[2024-05-22 05:45:19] [INFO ] Computed 14 invariants in 18 ms
[2024-05-22 05:45:19] [INFO ] State equation strengthened by 237 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 789/855 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 237/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/855 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 855/855 variables, and 317 constraints, problems are : Problem set: 0 solved, 2 unsolved in 661 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 237/237 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/61 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/66 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 789/855 variables, 66/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/855 variables, 237/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/855 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/855 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/855 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 855/855 variables, and 319 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2827 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 66/66 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3742ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1438 ms.
Support contains 34 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 789/789 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 66 transition count 788
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 788
Applied a total of 2 rules in 96 ms. Remains 65 /66 variables (removed 1) and now considering 788/789 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 65/66 places, 788/789 transitions.
RANDOM walk for 40000 steps (93 resets) in 1392 ms. (28 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (114 resets) in 273 ms. (146 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (111 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 648767 steps, run timeout after 3001 ms. (steps per millisecond=216 ) properties seen :0 out of 2
Probabilistic random walk after 648767 steps, saw 96530 distinct states, run finished after 3018 ms. (steps per millisecond=214 ) properties seen :0
// Phase 1: matrix 788 rows 65 cols
[2024-05-22 05:45:27] [INFO ] Computed 14 invariants in 12 ms
[2024-05-22 05:45:27] [INFO ] State equation strengthened by 237 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/65 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 788/853 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/853 variables, 237/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/853 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 853/853 variables, and 316 constraints, problems are : Problem set: 0 solved, 2 unsolved in 613 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 237/237 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 5/65 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 05:45:29] [INFO ] Deduced a trap composed of 5 places in 269 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 788/853 variables, 65/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/853 variables, 237/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/853 variables, 2/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/853 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/853 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 853/853 variables, and 319 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2746 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 65/65 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 3510ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 1090 ms.
Support contains 34 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 788/788 transitions.
Applied a total of 0 rules in 49 ms. Remains 65 /65 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 65/65 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 788/788 transitions.
Applied a total of 0 rules in 49 ms. Remains 65 /65 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2024-05-22 05:45:32] [INFO ] Invariant cache hit.
[2024-05-22 05:45:32] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-22 05:45:32] [INFO ] Invariant cache hit.
[2024-05-22 05:45:33] [INFO ] State equation strengthened by 237 read => feed constraints.
[2024-05-22 05:45:33] [INFO ] Implicit Places using invariants and state equation in 475 ms returned [61, 63]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 575 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 788/788 transitions.
Applied a total of 0 rules in 55 ms. Remains 63 /63 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 682 ms. Remains : 63/65 places, 788/788 transitions.
RANDOM walk for 40000 steps (94 resets) in 2263 ms. (17 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (109 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (113 resets) in 76 ms. (519 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 687622 steps, run timeout after 3001 ms. (steps per millisecond=229 ) properties seen :0 out of 2
Probabilistic random walk after 687622 steps, saw 101833 distinct states, run finished after 3001 ms. (steps per millisecond=229 ) properties seen :0
// Phase 1: matrix 788 rows 63 cols
[2024-05-22 05:45:36] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:45:36] [INFO ] State equation strengthened by 237 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 786/846 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/846 variables, 236/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/846 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/851 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/851 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/851 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 851/851 variables, and 312 constraints, problems are : Problem set: 0 solved, 2 unsolved in 622 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 237/237 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/60 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 786/846 variables, 60/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/846 variables, 236/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/846 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 5/851 variables, 3/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/851 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/851 variables, 2/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/851 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/851 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 851/851 variables, and 314 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1899 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2643ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 650 ms.
Support contains 34 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 788/788 transitions.
Applied a total of 0 rules in 68 ms. Remains 63 /63 variables (removed 0) and now considering 788/788 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 63/63 places, 788/788 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 788/788 transitions.
Applied a total of 0 rules in 68 ms. Remains 63 /63 variables (removed 0) and now considering 788/788 (removed 0) transitions.
[2024-05-22 05:45:40] [INFO ] Invariant cache hit.
[2024-05-22 05:45:40] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-22 05:45:40] [INFO ] Invariant cache hit.
[2024-05-22 05:45:40] [INFO ] State equation strengthened by 237 read => feed constraints.
[2024-05-22 05:45:40] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-05-22 05:45:41] [INFO ] Redundant transitions in 89 ms returned []
Running 787 sub problems to find dead transitions.
[2024-05-22 05:45:41] [INFO ] Invariant cache hit.
[2024-05-22 05:45:41] [INFO ] State equation strengthened by 237 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 787 unsolved
[2024-05-22 05:46:10] [INFO ] Deduced a trap composed of 13 places in 750 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 787 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 787 unsolved
Problem TDEAD786 is UNSAT
At refinement iteration 4 (OVERLAPS) 788/851 variables, 63/76 constraints. Problems are: Problem set: 1 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/851 variables, 237/313 constraints. Problems are: Problem set: 1 solved, 786 unsolved
[2024-05-22 05:46:24] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 851/851 variables, and 314 constraints, problems are : Problem set: 1 solved, 786 unsolved in 30069 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 787/787 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/63 variables, 12/12 constraints. Problems are: Problem set: 1 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 2/14 constraints. Problems are: Problem set: 1 solved, 786 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 786 unsolved
At refinement iteration 4 (OVERLAPS) 788/851 variables, 63/77 constraints. Problems are: Problem set: 1 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/851 variables, 237/314 constraints. Problems are: Problem set: 1 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 851/851 variables, and 1100 constraints, problems are : Problem set: 1 solved, 786 unsolved in 32861 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 63/63 constraints, ReadFeed: 237/237 constraints, PredecessorRefiner: 786/787 constraints, Known Traps: 2/2 constraints]
After SMT, in 79913ms problems are : Problem set: 1 solved, 786 unsolved
Search for dead transitions found 1 dead transitions in 79937ms
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 : 63/63 places, 787/788 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 63 transition count 786
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 62 transition count 786
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 61 transition count 785
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 61 transition count 785
Applied a total of 4 rules in 69 ms. Remains 61 /63 variables (removed 2) and now considering 785/787 (removed 2) transitions.
// Phase 1: matrix 785 rows 61 cols
[2024-05-22 05:47:01] [INFO ] Computed 13 invariants in 8 ms
[2024-05-22 05:47:01] [INFO ] Implicit Places using invariants in 85 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 60/63 places, 785/788 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 784
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 784
Applied a total of 2 rules in 57 ms. Remains 59 /60 variables (removed 1) and now considering 784/785 (removed 1) transitions.
// Phase 1: matrix 784 rows 59 cols
[2024-05-22 05:47:01] [INFO ] Computed 12 invariants in 6 ms
[2024-05-22 05:47:01] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-22 05:47:01] [INFO ] Invariant cache hit.
[2024-05-22 05:47:01] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-22 05:47:01] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 59/63 places, 784/788 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 81538 ms. Remains : 59/63 places, 784/788 transitions.
RANDOM walk for 40000 steps (158 resets) in 734 ms. (54 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (107 resets) in 211 ms. (188 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 684147 steps, run timeout after 3001 ms. (steps per millisecond=227 ) properties seen :0 out of 2
Probabilistic random walk after 684147 steps, saw 100722 distinct states, run finished after 3001 ms. (steps per millisecond=227 ) properties seen :0
[2024-05-22 05:47:05] [INFO ] Invariant cache hit.
[2024-05-22 05:47:05] [INFO ] State equation strengthened by 235 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/843 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/843 variables, 235/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/843 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 843/843 variables, and 306 constraints, problems are : Problem set: 0 solved, 2 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 59/59 constraints, ReadFeed: 235/235 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/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 784/843 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/843 variables, 235/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 2/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/843 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 843/843 variables, and 308 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2416 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 59/59 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2853ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 10274 ms.
Support contains 34 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 784/784 transitions.
Applied a total of 0 rules in 58 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 59/59 places, 784/784 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 784/784 transitions.
Applied a total of 0 rules in 50 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
[2024-05-22 05:47:18] [INFO ] Invariant cache hit.
[2024-05-22 05:47:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 05:47:18] [INFO ] Invariant cache hit.
[2024-05-22 05:47:18] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-05-22 05:47:18] [INFO ] Implicit Places using invariants and state equation in 337 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2024-05-22 05:47:18] [INFO ] Redundant transitions in 13 ms returned []
Running 783 sub problems to find dead transitions.
[2024-05-22 05:47:18] [INFO ] Invariant cache hit.
[2024-05-22 05:47:18] [INFO ] State equation strengthened by 235 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (OVERLAPS) 784/843 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/843 variables, 235/306 constraints. Problems are: Problem set: 0 solved, 783 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 843/843 variables, and 306 constraints, problems are : Problem set: 0 solved, 783 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 59/59 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 783 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 3 (OVERLAPS) 784/843 variables, 59/71 constraints. Problems are: Problem set: 0 solved, 783 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/843 variables, 235/306 constraints. Problems are: Problem set: 0 solved, 783 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 843/843 variables, and 1089 constraints, problems are : Problem set: 0 solved, 783 unsolved in 32649 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, State Equation: 59/59 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 783/783 constraints, Known Traps: 0/0 constraints]
After SMT, in 76029ms problems are : Problem set: 0 solved, 783 unsolved
Search for dead transitions found 0 dead transitions in 76041ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76519 ms. Remains : 59/59 places, 784/784 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 36 ms. Remains 59 /59 variables (removed 0) and now considering 784/784 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 05:48:35] [INFO ] Invariant cache hit.
[2024-05-22 05:48:35] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 05:48:35] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2024-05-22 05:48:35] [INFO ] After 875ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-22 05:48:36] [INFO ] After 1602ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-22 05:48:37] [INFO ] After 2412ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 2549 ms.
[2024-05-22 05:48:37] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-22 05:48:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 784 transitions and 12203 arcs took 45 ms.
[2024-05-22 05:48:38] [INFO ] Flatten gal took : 399 ms
Total runtime 222590 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-09a

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: 59
TRANSITIONS: 784
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.080s, Sys 0.000s]

SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.007s, 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: 708
MODEL NAME: /home/mcc/execution/415/model
59 places, 784 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-09a-ReachabilityFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09a-ReachabilityFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716356920417

--------------------
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-09a"
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-09a, 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-171620166400351"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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