About the Execution of GreatSPN+red for CANConstruction-PT-080
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13604.104 | 3600000.00 | 4468312.00 | 7756.00 | TTFFT?TFF?FTF?FF | 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.r069-tall-171620503700070.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 CANConstruction-PT-080, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503700070
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.9M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 20:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 26K Apr 12 20:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 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 9.5M 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 CANConstruction-PT-080-ReachabilityCardinality-2024-00
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-01
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-02
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-03
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-04
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-05
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-06
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-07
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-08
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-09
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-10
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-11
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-12
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-13
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-14
FORMULA_NAME CANConstruction-PT-080-ReachabilityCardinality-2024-15
=== Now, execution of the tool begins
BK_START 1716378966183
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:56:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 11:56:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:56:07] [INFO ] Load time of PNML (sax parser for PT used): 577 ms
[2024-05-22 11:56:08] [INFO ] Transformed 13762 places.
[2024-05-22 11:56:08] [INFO ] Transformed 26240 transitions.
[2024-05-22 11:56:08] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 802 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 59 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (26 resets) in 3351 ms. (11 steps per ms) remains 9/16 properties
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 595 ms. (67 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 994 ms. (40 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
// Phase 1: matrix 26240 rows 13762 cols
[2024-05-22 11:56:10] [INFO ] Computed 161 invariants in 355 ms
[2024-05-22 11:56:10] [INFO ] State equation strengthened by 12720 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem CANConstruction-PT-080-ReachabilityCardinality-2024-08 is UNSAT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem CANConstruction-PT-080-ReachabilityCardinality-2024-15 is UNSAT
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 13476/13676 variables, 76/76 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13676 variables, 0/76 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 5/13681 variables, 5/81 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13681 variables, 0/81 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 80/13761 variables, 80/161 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13761/40002 variables, and 161 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5059 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 0/13762 constraints, ReadFeed: 0/12720 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 13530/13664 variables, 64/64 constraints. Problems are: Problem set: 2 solved, 7 unsolved
[2024-05-22 11:56:48] [INFO ] Deduced a trap composed of 153 places in 30248 ms of which 516 ms to minimize.
SMT process timed out in 38232ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 134 out of 13762 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 544 transitions
Trivial Post-agglo rules discarded 544 transitions
Performed 544 trivial Post agglomeration. Transition count delta: 544
Iterating post reduction 0 with 544 rules applied. Total rules applied 544 place count 13762 transition count 25696
Reduce places removed 544 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 550 rules applied. Total rules applied 1094 place count 13218 transition count 25690
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 1100 place count 13212 transition count 25690
Discarding 6182 places :
Symmetric choice reduction at 3 with 6182 rule applications. Total rules 7282 place count 7030 transition count 13326
Iterating global reduction 3 with 6182 rules applied. Total rules applied 13464 place count 7030 transition count 13326
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 7 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 13622 place count 6951 transition count 13247
Free-agglomeration rule applied 78 times.
Iterating global reduction 3 with 78 rules applied. Total rules applied 13700 place count 6951 transition count 13169
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 3 with 78 rules applied. Total rules applied 13778 place count 6873 transition count 13169
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 13780 place count 6873 transition count 13167
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 13782 place count 6871 transition count 13167
Partial Free-agglomeration rule applied 81 times.
Drop transitions (Partial Free agglomeration) removed 81 transitions
Iterating global reduction 5 with 81 rules applied. Total rules applied 13863 place count 6871 transition count 13167
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 13864 place count 6871 transition count 13167
Applied a total of 13864 rules in 13014 ms. Remains 6871 /13762 variables (removed 6891) and now considering 13167/26240 (removed 13073) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13028 ms. Remains : 6871/13762 places, 13167/26240 transitions.
RANDOM walk for 40000 steps (68 resets) in 1874 ms. (21 steps per ms) remains 4/7 properties
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 4/4 properties
// Phase 1: matrix 13167 rows 6871 cols
[2024-05-22 11:57:02] [INFO ] Computed 161 invariants in 104 ms
[2024-05-22 11:57:02] [INFO ] State equation strengthened by 12835 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6678/6760 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6760 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/6790 variables, 30/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6790 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 80/6870 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6870 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 13167/20037 variables, 6870/7031 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/20037 variables, 12835/19866 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/20037 variables, 0/19866 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/20038 variables, 1/19867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/20038 variables, 0/19867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/20038 variables, 0/19867 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20038/20038 variables, and 19867 constraints, problems are : Problem set: 0 solved, 4 unsolved in 17121 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 6871/6871 constraints, ReadFeed: 12835/12835 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6678/6760 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:57:30] [INFO ] Deduced a trap composed of 2 places in 10265 ms of which 46 ms to minimize.
[2024-05-22 11:57:33] [INFO ] Deduced a trap composed of 85 places in 2575 ms of which 26 ms to minimize.
[2024-05-22 11:57:35] [INFO ] Deduced a trap composed of 83 places in 2514 ms of which 23 ms to minimize.
[2024-05-22 11:57:38] [INFO ] Deduced a trap composed of 86 places in 2537 ms of which 21 ms to minimize.
[2024-05-22 11:57:40] [INFO ] Deduced a trap composed of 86 places in 2412 ms of which 21 ms to minimize.
[2024-05-22 11:57:43] [INFO ] Deduced a trap composed of 86 places in 2225 ms of which 20 ms to minimize.
[2024-05-22 11:57:45] [INFO ] Deduced a trap composed of 86 places in 2231 ms of which 20 ms to minimize.
[2024-05-22 11:57:47] [INFO ] Deduced a trap composed of 88 places in 2123 ms of which 19 ms to minimize.
[2024-05-22 11:57:49] [INFO ] Deduced a trap composed of 83 places in 2025 ms of which 20 ms to minimize.
[2024-05-22 11:57:52] [INFO ] Deduced a trap composed of 88 places in 2030 ms of which 20 ms to minimize.
[2024-05-22 11:57:54] [INFO ] Deduced a trap composed of 83 places in 1902 ms of which 18 ms to minimize.
[2024-05-22 11:57:56] [INFO ] Deduced a trap composed of 83 places in 1860 ms of which 18 ms to minimize.
[2024-05-22 11:57:57] [INFO ] Deduced a trap composed of 86 places in 1692 ms of which 17 ms to minimize.
[2024-05-22 11:57:59] [INFO ] Deduced a trap composed of 88 places in 1930 ms of which 19 ms to minimize.
[2024-05-22 11:58:01] [INFO ] Deduced a trap composed of 88 places in 1986 ms of which 18 ms to minimize.
[2024-05-22 11:58:03] [INFO ] Deduced a trap composed of 88 places in 1903 ms of which 19 ms to minimize.
[2024-05-22 11:58:05] [INFO ] Deduced a trap composed of 86 places in 1769 ms of which 19 ms to minimize.
SMT process timed out in 63557ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 82 out of 6871 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6871/6871 places, 13167/13167 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 6871 transition count 13164
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 6868 transition count 13164
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 6866 transition count 13160
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 6866 transition count 13160
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 54 place count 6844 transition count 13138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 58 place count 6842 transition count 13138
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 6842 transition count 13137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 6841 transition count 13137
Applied a total of 60 rules in 7295 ms. Remains 6841 /6871 variables (removed 30) and now considering 13137/13167 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7295 ms. Remains : 6841/6871 places, 13137/13167 transitions.
RANDOM walk for 40000 steps (69 resets) in 1439 ms. (27 steps per ms) remains 3/4 properties
FORMULA CANConstruction-PT-080-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 3/3 properties
// Phase 1: matrix 13137 rows 6841 cols
[2024-05-22 11:58:13] [INFO ] Computed 161 invariants in 98 ms
[2024-05-22 11:58:13] [INFO ] State equation strengthened by 12863 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6648/6729 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6729 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6760 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6760 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/6840 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6840 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13137/19977 variables, 6840/7001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19977 variables, 12863/19864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19977 variables, 0/19864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/19978 variables, 1/19865 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19978 variables, 0/19865 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/19978 variables, 0/19865 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19978/19978 variables, and 19865 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12727 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 6841/6841 constraints, ReadFeed: 12863/12863 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6648/6729 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 11:58:38] [INFO ] Deduced a trap composed of 2 places in 11061 ms of which 40 ms to minimize.
[2024-05-22 11:58:49] [INFO ] Deduced a trap composed of 2 places in 10915 ms of which 41 ms to minimize.
[2024-05-22 11:59:01] [INFO ] Deduced a trap composed of 2 places in 11560 ms of which 44 ms to minimize.
[2024-05-22 11:59:11] [INFO ] Deduced a trap composed of 2 places in 10540 ms of which 39 ms to minimize.
[2024-05-22 11:59:14] [INFO ] Deduced a trap composed of 83 places in 2486 ms of which 21 ms to minimize.
[2024-05-22 11:59:16] [INFO ] Deduced a trap composed of 83 places in 2495 ms of which 21 ms to minimize.
[2024-05-22 11:59:19] [INFO ] Deduced a trap composed of 87 places in 2658 ms of which 21 ms to minimize.
[2024-05-22 11:59:22] [INFO ] Deduced a trap composed of 86 places in 2548 ms of which 21 ms to minimize.
[2024-05-22 11:59:33] [INFO ] Deduced a trap composed of 2 places in 10713 ms of which 39 ms to minimize.
[2024-05-22 11:59:35] [INFO ] Deduced a trap composed of 83 places in 2331 ms of which 19 ms to minimize.
[2024-05-22 11:59:46] [INFO ] Deduced a trap composed of 2 places in 11276 ms of which 36 ms to minimize.
SMT process timed out in 93328ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6841/6841 places, 13137/13137 transitions.
Applied a total of 0 rules in 1654 ms. Remains 6841 /6841 variables (removed 0) and now considering 13137/13137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1654 ms. Remains : 6841/6841 places, 13137/13137 transitions.
RANDOM walk for 40000 steps (70 resets) in 1912 ms. (20 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 81453 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 3
Probabilistic random walk after 81453 steps, saw 73122 distinct states, run finished after 3005 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-22 11:59:52] [INFO ] Invariant cache hit.
[2024-05-22 11:59:52] [INFO ] State equation strengthened by 12863 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6648/6729 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6729 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6760 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6760 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 80/6840 variables, 80/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6840 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 13137/19977 variables, 6840/7001 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19977 variables, 12863/19864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19977 variables, 0/19864 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/19978 variables, 1/19865 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/19978 variables, 0/19865 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/19978 variables, 0/19865 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19978/19978 variables, and 19865 constraints, problems are : Problem set: 0 solved, 3 unsolved in 12071 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 80/80 constraints, State Equation: 6841/6841 constraints, ReadFeed: 12863/12863 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6648/6729 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:00:16] [INFO ] Deduced a trap composed of 2 places in 10494 ms of which 35 ms to minimize.
[2024-05-22 12:00:26] [INFO ] Deduced a trap composed of 2 places in 10783 ms of which 35 ms to minimize.
[2024-05-22 12:00:38] [INFO ] Deduced a trap composed of 2 places in 11102 ms of which 41 ms to minimize.
[2024-05-22 12:00:40] [INFO ] Deduced a trap composed of 83 places in 2351 ms of which 18 ms to minimize.
[2024-05-22 12:00:43] [INFO ] Deduced a trap composed of 86 places in 3079 ms of which 23 ms to minimize.
[2024-05-22 12:00:46] [INFO ] Deduced a trap composed of 86 places in 2775 ms of which 28 ms to minimize.
[2024-05-22 12:00:48] [INFO ] Deduced a trap composed of 91 places in 2362 ms of which 19 ms to minimize.
[2024-05-22 12:00:51] [INFO ] Deduced a trap composed of 83 places in 2832 ms of which 23 ms to minimize.
[2024-05-22 12:00:54] [INFO ] Deduced a trap composed of 83 places in 2438 ms of which 23 ms to minimize.
[2024-05-22 12:00:57] [INFO ] Deduced a trap composed of 89 places in 2482 ms of which 21 ms to minimize.
[2024-05-22 12:00:59] [INFO ] Deduced a trap composed of 87 places in 2679 ms of which 21 ms to minimize.
[2024-05-22 12:01:02] [INFO ] Deduced a trap composed of 85 places in 2650 ms of which 21 ms to minimize.
[2024-05-22 12:01:04] [INFO ] Deduced a trap composed of 85 places in 2358 ms of which 18 ms to minimize.
[2024-05-22 12:01:07] [INFO ] Deduced a trap composed of 83 places in 2250 ms of which 20 ms to minimize.
[2024-05-22 12:01:09] [INFO ] Deduced a trap composed of 83 places in 2450 ms of which 20 ms to minimize.
[2024-05-22 12:01:12] [INFO ] Deduced a trap composed of 86 places in 2173 ms of which 19 ms to minimize.
[2024-05-22 12:01:14] [INFO ] Deduced a trap composed of 91 places in 2143 ms of which 19 ms to minimize.
[2024-05-22 12:01:16] [INFO ] Deduced a trap composed of 83 places in 2328 ms of which 18 ms to minimize.
[2024-05-22 12:01:18] [INFO ] Deduced a trap composed of 86 places in 2129 ms of which 19 ms to minimize.
[2024-05-22 12:01:21] [INFO ] Deduced a trap composed of 84 places in 1961 ms of which 18 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6729 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:01:23] [INFO ] Deduced a trap composed of 83 places in 2185 ms of which 19 ms to minimize.
[2024-05-22 12:01:26] [INFO ] Deduced a trap composed of 83 places in 2581 ms of which 21 ms to minimize.
[2024-05-22 12:01:28] [INFO ] Deduced a trap composed of 85 places in 2602 ms of which 22 ms to minimize.
[2024-05-22 12:01:31] [INFO ] Deduced a trap composed of 83 places in 2330 ms of which 20 ms to minimize.
[2024-05-22 12:01:33] [INFO ] Deduced a trap composed of 86 places in 2593 ms of which 22 ms to minimize.
[2024-05-22 12:01:36] [INFO ] Deduced a trap composed of 83 places in 2466 ms of which 21 ms to minimize.
SMT process timed out in 103912ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6841 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6841/6841 places, 13137/13137 transitions.
Applied a total of 0 rules in 1589 ms. Remains 6841 /6841 variables (removed 0) and now considering 13137/13137 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1590 ms. Remains : 6841/6841 places, 13137/13137 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6841/6841 places, 13137/13137 transitions.
Applied a total of 0 rules in 1626 ms. Remains 6841 /6841 variables (removed 0) and now considering 13137/13137 (removed 0) transitions.
[2024-05-22 12:01:39] [INFO ] Invariant cache hit.
[2024-05-22 12:01:45] [INFO ] Implicit Places using invariants in 5854 ms returned [5, 10, 14, 20, 24, 30, 34, 38, 42, 48, 54, 60, 66, 71, 75, 81, 87, 93, 99, 103, 107, 111, 115, 121, 126, 130, 134, 138, 144, 150, 156, 162, 168, 174, 180, 184, 190, 196, 200, 206, 210, 216, 220, 224, 228, 234, 240, 246, 250, 254, 258, 262, 266, 270, 274, 278, 284, 290, 296, 302, 306, 312, 318, 324, 330, 338, 344, 348, 352, 358, 362, 366, 372, 376, 380, 386, 392, 398, 404, 408]
Discarding 80 places :
Implicit Place search using SMT only with invariants took 5873 ms to find 80 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 6761/6841 places, 13137/13137 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 6761 transition count 13113
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 6737 transition count 13113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 6736 transition count 13112
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 6736 transition count 13112
Performed 55 Post agglomeration using F-continuation condition.Transition count delta: 55
Deduced a syphon composed of 55 places in 3 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 2 with 110 rules applied. Total rules applied 160 place count 6681 transition count 13057
Applied a total of 160 rules in 4992 ms. Remains 6681 /6761 variables (removed 80) and now considering 13057/13137 (removed 80) transitions.
// Phase 1: matrix 13057 rows 6681 cols
[2024-05-22 12:01:50] [INFO ] Computed 81 invariants in 367 ms
[2024-05-22 12:01:56] [INFO ] Implicit Places using invariants in 5984 ms returned []
Implicit Place search using SMT only with invariants took 6001 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 6681/6841 places, 13057/13137 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 18493 ms. Remains : 6681/6841 places, 13057/13137 transitions.
RANDOM walk for 40000 steps (71 resets) in 934 ms. (42 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 83260 steps, run timeout after 3001 ms. (steps per millisecond=27 ) properties seen :0 out of 3
Probabilistic random walk after 83260 steps, saw 73882 distinct states, run finished after 3003 ms. (steps per millisecond=27 ) properties seen :0
[2024-05-22 12:01:59] [INFO ] Invariant cache hit.
[2024-05-22 12:01:59] [INFO ] State equation strengthened by 12746 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6568/6649 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6649 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 31/6680 variables, 31/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6680 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 13057/19737 variables, 6680/6761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19737 variables, 12746/19507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/19737 variables, 0/19507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/19738 variables, 1/19508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/19738 variables, 0/19508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/19738 variables, 0/19508 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19738/19738 variables, and 19508 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11924 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 6681/6681 constraints, ReadFeed: 12746/12746 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6568/6649 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:02:23] [INFO ] Deduced a trap composed of 2 places in 10673 ms of which 39 ms to minimize.
[2024-05-22 12:02:34] [INFO ] Deduced a trap composed of 2 places in 10835 ms of which 47 ms to minimize.
[2024-05-22 12:02:45] [INFO ] Deduced a trap composed of 2 places in 10643 ms of which 34 ms to minimize.
[2024-05-22 12:02:47] [INFO ] Deduced a trap composed of 83 places in 2675 ms of which 24 ms to minimize.
[2024-05-22 12:02:50] [INFO ] Deduced a trap composed of 84 places in 2628 ms of which 20 ms to minimize.
[2024-05-22 12:02:52] [INFO ] Deduced a trap composed of 83 places in 2335 ms of which 21 ms to minimize.
[2024-05-22 12:03:03] [INFO ] Deduced a trap composed of 2 places in 10623 ms of which 44 ms to minimize.
[2024-05-22 12:03:05] [INFO ] Deduced a trap composed of 85 places in 2159 ms of which 19 ms to minimize.
[2024-05-22 12:03:08] [INFO ] Deduced a trap composed of 84 places in 2182 ms of which 20 ms to minimize.
[2024-05-22 12:03:10] [INFO ] Deduced a trap composed of 83 places in 2216 ms of which 19 ms to minimize.
[2024-05-22 12:03:12] [INFO ] Deduced a trap composed of 83 places in 2061 ms of which 20 ms to minimize.
[2024-05-22 12:03:15] [INFO ] Deduced a trap composed of 85 places in 2371 ms of which 19 ms to minimize.
[2024-05-22 12:03:17] [INFO ] Deduced a trap composed of 89 places in 2158 ms of which 18 ms to minimize.
[2024-05-22 12:03:19] [INFO ] Deduced a trap composed of 85 places in 2044 ms of which 18 ms to minimize.
[2024-05-22 12:03:21] [INFO ] Deduced a trap composed of 83 places in 2035 ms of which 17 ms to minimize.
[2024-05-22 12:03:23] [INFO ] Deduced a trap composed of 83 places in 1801 ms of which 16 ms to minimize.
[2024-05-22 12:03:25] [INFO ] Deduced a trap composed of 85 places in 1876 ms of which 19 ms to minimize.
[2024-05-22 12:03:27] [INFO ] Deduced a trap composed of 85 places in 1852 ms of which 15 ms to minimize.
[2024-05-22 12:03:29] [INFO ] Deduced a trap composed of 83 places in 1766 ms of which 18 ms to minimize.
[2024-05-22 12:03:30] [INFO ] Deduced a trap composed of 83 places in 1643 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/6649 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 12:03:33] [INFO ] Deduced a trap composed of 90 places in 2161 ms of which 20 ms to minimize.
[2024-05-22 12:03:35] [INFO ] Deduced a trap composed of 86 places in 2023 ms of which 18 ms to minimize.
[2024-05-22 12:03:37] [INFO ] Deduced a trap composed of 83 places in 2063 ms of which 18 ms to minimize.
[2024-05-22 12:03:39] [INFO ] Deduced a trap composed of 83 places in 2104 ms of which 18 ms to minimize.
[2024-05-22 12:03:41] [INFO ] Deduced a trap composed of 87 places in 1933 ms of which 18 ms to minimize.
[2024-05-22 12:03:43] [INFO ] Deduced a trap composed of 83 places in 1832 ms of which 16 ms to minimize.
[2024-05-22 12:03:45] [INFO ] Deduced a trap composed of 83 places in 1896 ms of which 17 ms to minimize.
[2024-05-22 12:03:47] [INFO ] Deduced a trap composed of 83 places in 1942 ms of which 17 ms to minimize.
[2024-05-22 12:03:49] [INFO ] Deduced a trap composed of 83 places in 1869 ms of which 18 ms to minimize.
[2024-05-22 12:03:51] [INFO ] Deduced a trap composed of 83 places in 1938 ms of which 18 ms to minimize.
[2024-05-22 12:03:53] [INFO ] Deduced a trap composed of 84 places in 1706 ms of which 17 ms to minimize.
[2024-05-22 12:03:55] [INFO ] Deduced a trap composed of 84 places in 1479 ms of which 17 ms to minimize.
[2024-05-22 12:03:56] [INFO ] Deduced a trap composed of 85 places in 1268 ms of which 14 ms to minimize.
[2024-05-22 12:03:57] [INFO ] Deduced a trap composed of 83 places in 1188 ms of which 14 ms to minimize.
SMT process timed out in 117932ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 81 out of 6681 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6681/6681 places, 13057/13057 transitions.
Applied a total of 0 rules in 1952 ms. Remains 6681 /6681 variables (removed 0) and now considering 13057/13057 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1953 ms. Remains : 6681/6681 places, 13057/13057 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6681/6681 places, 13057/13057 transitions.
Applied a total of 0 rules in 1871 ms. Remains 6681 /6681 variables (removed 0) and now considering 13057/13057 (removed 0) transitions.
[2024-05-22 12:04:01] [INFO ] Invariant cache hit.
[2024-05-22 12:04:07] [INFO ] Implicit Places using invariants in 5629 ms returned []
Implicit Place search using SMT only with invariants took 5630 ms to find 0 implicit places.
Running 12977 sub problems to find dead transitions.
[2024-05-22 12:04:07] [INFO ] Invariant cache hit.
[2024-05-22 12:04:07] [INFO ] State equation strengthened by 12746 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6680 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 12977 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 6680/19738 variables, and 81 constraints, problems are : Problem set: 0 solved, 12977 unsolved in 30206 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, State Equation: 0/6681 constraints, ReadFeed: 0/12746 constraints, PredecessorRefiner: 12977/12977 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12977 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6680 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 12977 unsolved
[2024-05-22 12:05:21] [INFO ] Deduced a trap composed of 94 places in 5220 ms of which 36 ms to minimize.
[2024-05-22 12:05:26] [INFO ] Deduced a trap composed of 84 places in 5294 ms of which 35 ms to minimize.
[2024-05-22 12:05:32] [INFO ] Deduced a trap composed of 83 places in 5098 ms of which 31 ms to minimize.
[2024-05-22 12:05:37] [INFO ] Deduced a trap composed of 83 places in 5145 ms of which 36 ms to minimize.
SMT process timed out in 89987ms, After SMT, problems are : Problem set: 0 solved, 12977 unsolved
Search for dead transitions found 0 dead transitions in 90126ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97674 ms. Remains : 6681/6681 places, 13057/13057 transitions.
[2024-05-22 12:05:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 5 ms.
[2024-05-22 12:05:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 6681 places, 13057 transitions and 51904 arcs took 53 ms.
[2024-05-22 12:05:38] [INFO ] Flatten gal took : 634 ms
Total runtime 571026 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANConstruction-PT-080
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 6681
TRANSITIONS: 13057
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.278s, Sys 0.016s]
SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.038s, Sys 0.007s]
----------------------------------------------------------------------
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: 897
MODEL NAME: /home/mcc/execution/410/model
6681 places, 13057 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.
BK_TIME_CONFINEMENT_REACHED
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="CANConstruction-PT-080"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is CANConstruction-PT-080, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503700070"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANConstruction-PT-080.tgz
mv CANConstruction-PT-080 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;