About the Execution of GreatSPN+red for CANInsertWithFailure-PT-040
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
11240.655 | 973286.00 | 2572542.00 | 1184.60 | ??T????????T???? | 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-171620503800121.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 CANInsertWithFailure-PT-040, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620503800121
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 17:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 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.8M 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 CANInsertWithFailure-PT-040-CTLCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2023-12
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2023-13
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2023-14
FORMULA_NAME CANInsertWithFailure-PT-040-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1716393681118
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:01:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 16:01:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:01:22] [INFO ] Load time of PNML (sax parser for PT used): 387 ms
[2024-05-22 16:01:22] [INFO ] Transformed 3684 places.
[2024-05-22 16:01:22] [INFO ] Transformed 9840 transitions.
[2024-05-22 16:01:22] [INFO ] Parsed PT model containing 3684 places and 9840 transitions and 26400 arcs in 530 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Support contains 136 out of 3684 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3684/3684 places, 9840/9840 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3683 transition count 9840
Applied a total of 1 rules in 496 ms. Remains 3683 /3684 variables (removed 1) and now considering 9840/9840 (removed 0) transitions.
// Phase 1: matrix 9840 rows 3683 cols
[2024-05-22 16:01:24] [INFO ] Computed 42 invariants in 511 ms
[2024-05-22 16:01:26] [INFO ] Implicit Places using invariants in 3008 ms returned []
[2024-05-22 16:01:26] [INFO ] Invariant cache hit.
[2024-05-22 16:01:29] [INFO ] State equation strengthened by 3160 read => feed constraints.
[2024-05-22 16:01:59] [INFO ] Performed 343/3683 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:02:12] [INFO ] Implicit Places using invariants and state equation in 45879 ms returned []
Implicit Place search using SMT with State Equation took 48913 ms to find 0 implicit places.
Running 9800 sub problems to find dead transitions.
[2024-05-22 16:02:12] [INFO ] Invariant cache hit.
[2024-05-22 16:02:12] [INFO ] State equation strengthened by 3160 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/3682 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 9800 unsolved
SMT process timed out in 40128ms, After SMT, problems are : Problem set: 0 solved, 9800 unsolved
Search for dead transitions found 0 dead transitions in 40237ms
Starting structural reductions in LTL mode, iteration 1 : 3683/3684 places, 9840/9840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89715 ms. Remains : 3683/3684 places, 9840/9840 transitions.
Support contains 136 out of 3683 places after structural reductions.
[2024-05-22 16:02:53] [INFO ] Flatten gal took : 397 ms
[2024-05-22 16:02:53] [INFO ] Flatten gal took : 258 ms
[2024-05-22 16:02:54] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 124 out of 3683 places (down from 136) after GAL structural reductions.
RANDOM walk for 40000 steps (38 resets) in 2173 ms. (18 steps per ms) remains 26/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 25/25 properties
[2024-05-22 16:02:55] [INFO ] Invariant cache hit.
[2024-05-22 16:02:55] [INFO ] State equation strengthened by 3160 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 25 unsolved
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp57 is UNSAT
At refinement iteration 1 (OVERLAPS) 3569/3609 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3609 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 70/3679 variables, 35/40 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3679 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 2/3681 variables, 2/42 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3681 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 22 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 13521/13523 variables, and 3723 constraints, problems are : Problem set: 3 solved, 22 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 3681/3683 constraints, ReadFeed: 0/3160 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 22 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 22 unsolved
At refinement iteration 1 (OVERLAPS) 3567/3603 variables, 2/2 constraints. Problems are: Problem set: 3 solved, 22 unsolved
[2024-05-22 16:03:00] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 19 ms to minimize.
[2024-05-22 16:03:01] [INFO ] Deduced a trap composed of 5 places in 220 ms of which 2 ms to minimize.
[2024-05-22 16:03:01] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:03:01] [INFO ] Deduced a trap composed of 5 places in 117 ms of which 2 ms to minimize.
[2024-05-22 16:03:01] [INFO ] Deduced a trap composed of 5 places in 119 ms of which 2 ms to minimize.
[2024-05-22 16:03:01] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 1 ms to minimize.
[2024-05-22 16:03:02] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 5 ms to minimize.
[2024-05-22 16:03:02] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2024-05-22 16:03:02] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-22 16:03:02] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 3 ms to minimize.
[2024-05-22 16:03:02] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-22 16:03:02] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-22 16:03:02] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-22 16:03:03] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2024-05-22 16:03:03] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 1 ms to minimize.
[2024-05-22 16:03:03] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-22 16:03:03] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 1 ms to minimize.
[2024-05-22 16:03:03] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 1 ms to minimize.
[2024-05-22 16:03:03] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 2 ms to minimize.
[2024-05-22 16:03:03] [INFO ] Deduced a trap composed of 5 places in 104 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/3603 variables, 20/22 constraints. Problems are: Problem set: 3 solved, 22 unsolved
[2024-05-22 16:03:04] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
[2024-05-22 16:03:04] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 1 ms to minimize.
[2024-05-22 16:03:04] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 1 ms to minimize.
[2024-05-22 16:03:04] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 1 ms to minimize.
[2024-05-22 16:03:04] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 1 ms to minimize.
[2024-05-22 16:03:04] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-22 16:03:05] [INFO ] Deduced a trap composed of 5 places in 98 ms of which 2 ms to minimize.
[2024-05-22 16:03:05] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 1 ms to minimize.
[2024-05-22 16:03:05] [INFO ] Deduced a trap composed of 5 places in 99 ms of which 2 ms to minimize.
SMT process timed out in 10163ms, After SMT, problems are : Problem set: 3 solved, 22 unsolved
Fused 22 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 36 out of 3683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 277 place count 3683 transition count 9563
Reduce places removed 277 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 278 rules applied. Total rules applied 555 place count 3406 transition count 9562
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 556 place count 3405 transition count 9562
Performed 1502 Post agglomeration using F-continuation condition.Transition count delta: 1502
Deduced a syphon composed of 1502 places in 5 ms
Reduce places removed 1502 places and 0 transitions.
Iterating global reduction 3 with 3004 rules applied. Total rules applied 3560 place count 1903 transition count 8060
Drop transitions (Redundant composition of simpler transitions.) removed 1425 transitions
Redundant transition composition rules discarded 1425 transitions
Iterating global reduction 3 with 1425 rules applied. Total rules applied 4985 place count 1903 transition count 6635
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 4986 place count 1903 transition count 6634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 4987 place count 1902 transition count 6634
Partial Free-agglomeration rule applied 1741 times.
Drop transitions (Partial Free agglomeration) removed 1741 transitions
Iterating global reduction 4 with 1741 rules applied. Total rules applied 6728 place count 1902 transition count 6634
Applied a total of 6728 rules in 1906 ms. Remains 1902 /3683 variables (removed 1781) and now considering 6634/9840 (removed 3206) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1907 ms. Remains : 1902/3683 places, 6634/9840 transitions.
RANDOM walk for 40000 steps (207 resets) in 1072 ms. (37 steps per ms) remains 18/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 18/18 properties
// Phase 1: matrix 6634 rows 1902 cols
[2024-05-22 16:03:07] [INFO ] Computed 42 invariants in 150 ms
[2024-05-22 16:03:07] [INFO ] State equation strengthened by 6401 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1792/1822 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1822 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 76/1898 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1898 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/1900 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1900 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 6634/8534 variables, 1900/1942 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8534 variables, 6401/8343 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8534 variables, 0/8343 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/8536 variables, 2/8345 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8536 variables, 0/8345 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/8536 variables, 0/8345 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8536/8536 variables, and 8345 constraints, problems are : Problem set: 0 solved, 18 unsolved in 19908 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1902/1902 constraints, ReadFeed: 6401/6401 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1792/1822 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:03:28] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 1 ms to minimize.
[2024-05-22 16:03:28] [INFO ] Deduced a trap composed of 2 places in 71 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1822 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1822 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 76/1898 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1898 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/1900 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:03:31] [INFO ] Deduced a trap composed of 51 places in 1459 ms of which 13 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1900 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1900 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 6634/8534 variables, 1900/1945 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/8534 variables, 6401/8346 constraints. Problems are: Problem set: 0 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 8534/8536 variables, and 8364 constraints, problems are : Problem set: 0 solved, 18 unsolved in 45065 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1900/1902 constraints, ReadFeed: 6401/6401 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 3/3 constraints]
After SMT, in 65238ms problems are : Problem set: 0 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 1902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1902/1902 places, 6634/6634 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 1898 transition count 6630
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 1898 transition count 6630
Applied a total of 10 rules in 473 ms. Remains 1898 /1902 variables (removed 4) and now considering 6630/6634 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 473 ms. Remains : 1898/1902 places, 6630/6634 transitions.
RANDOM walk for 40000 steps (204 resets) in 1159 ms. (34 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 18/18 properties
Interrupted probabilistic random walk after 87145 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :0 out of 18
Probabilistic random walk after 87145 steps, saw 26693 distinct states, run finished after 3006 ms. (steps per millisecond=28 ) properties seen :0
// Phase 1: matrix 6630 rows 1898 cols
[2024-05-22 16:04:16] [INFO ] Computed 42 invariants in 162 ms
[2024-05-22 16:04:17] [INFO ] State equation strengthened by 6411 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1788/1818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1818 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 76/1894 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1894 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/1896 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1896 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 6630/8526 variables, 1896/1938 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8526 variables, 6411/8349 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/8526 variables, 0/8349 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 2/8528 variables, 2/8351 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/8528 variables, 0/8351 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/8528 variables, 0/8351 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8528/8528 variables, and 8351 constraints, problems are : Problem set: 0 solved, 18 unsolved in 19694 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 1898/1898 constraints, ReadFeed: 6411/6411 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1788/1818 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:04:37] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 1 ms to minimize.
[2024-05-22 16:04:37] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1818 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1818 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 76/1894 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1894 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 2/1896 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:04:40] [INFO ] Deduced a trap composed of 68 places in 1559 ms of which 16 ms to minimize.
[2024-05-22 16:04:42] [INFO ] Deduced a trap composed of 63 places in 1395 ms of which 12 ms to minimize.
[2024-05-22 16:04:43] [INFO ] Deduced a trap composed of 45 places in 1324 ms of which 11 ms to minimize.
[2024-05-22 16:04:44] [INFO ] Deduced a trap composed of 46 places in 1308 ms of which 10 ms to minimize.
[2024-05-22 16:04:46] [INFO ] Deduced a trap composed of 52 places in 1314 ms of which 11 ms to minimize.
[2024-05-22 16:04:47] [INFO ] Deduced a trap composed of 47 places in 1397 ms of which 12 ms to minimize.
[2024-05-22 16:04:48] [INFO ] Deduced a trap composed of 52 places in 1288 ms of which 10 ms to minimize.
[2024-05-22 16:04:50] [INFO ] Deduced a trap composed of 47 places in 1184 ms of which 11 ms to minimize.
[2024-05-22 16:04:51] [INFO ] Deduced a trap composed of 54 places in 1263 ms of which 10 ms to minimize.
[2024-05-22 16:04:52] [INFO ] Deduced a trap composed of 52 places in 1194 ms of which 9 ms to minimize.
[2024-05-22 16:04:53] [INFO ] Deduced a trap composed of 45 places in 1065 ms of which 9 ms to minimize.
[2024-05-22 16:04:54] [INFO ] Deduced a trap composed of 48 places in 1069 ms of which 9 ms to minimize.
[2024-05-22 16:04:55] [INFO ] Deduced a trap composed of 47 places in 1024 ms of which 9 ms to minimize.
[2024-05-22 16:04:57] [INFO ] Deduced a trap composed of 49 places in 1137 ms of which 8 ms to minimize.
[2024-05-22 16:04:58] [INFO ] Deduced a trap composed of 48 places in 1151 ms of which 10 ms to minimize.
[2024-05-22 16:04:59] [INFO ] Deduced a trap composed of 91 places in 1074 ms of which 9 ms to minimize.
[2024-05-22 16:05:00] [INFO ] Deduced a trap composed of 76 places in 1071 ms of which 11 ms to minimize.
[2024-05-22 16:05:01] [INFO ] Deduced a trap composed of 53 places in 1076 ms of which 9 ms to minimize.
[2024-05-22 16:05:02] [INFO ] Deduced a trap composed of 46 places in 1012 ms of which 9 ms to minimize.
[2024-05-22 16:05:03] [INFO ] Deduced a trap composed of 51 places in 980 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1896 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:05:04] [INFO ] Deduced a trap composed of 51 places in 910 ms of which 8 ms to minimize.
[2024-05-22 16:05:05] [INFO ] Deduced a trap composed of 49 places in 895 ms of which 9 ms to minimize.
[2024-05-22 16:05:06] [INFO ] Deduced a trap composed of 48 places in 874 ms of which 8 ms to minimize.
[2024-05-22 16:05:07] [INFO ] Deduced a trap composed of 64 places in 899 ms of which 8 ms to minimize.
[2024-05-22 16:05:08] [INFO ] Deduced a trap composed of 54 places in 905 ms of which 8 ms to minimize.
[2024-05-22 16:05:09] [INFO ] Deduced a trap composed of 53 places in 877 ms of which 7 ms to minimize.
[2024-05-22 16:05:10] [INFO ] Deduced a trap composed of 48 places in 846 ms of which 8 ms to minimize.
[2024-05-22 16:05:10] [INFO ] Deduced a trap composed of 47 places in 860 ms of which 7 ms to minimize.
[2024-05-22 16:05:11] [INFO ] Deduced a trap composed of 46 places in 860 ms of which 8 ms to minimize.
[2024-05-22 16:05:12] [INFO ] Deduced a trap composed of 93 places in 895 ms of which 8 ms to minimize.
[2024-05-22 16:05:13] [INFO ] Deduced a trap composed of 82 places in 871 ms of which 8 ms to minimize.
[2024-05-22 16:05:14] [INFO ] Deduced a trap composed of 47 places in 906 ms of which 8 ms to minimize.
[2024-05-22 16:05:15] [INFO ] Deduced a trap composed of 45 places in 917 ms of which 8 ms to minimize.
[2024-05-22 16:05:16] [INFO ] Deduced a trap composed of 68 places in 825 ms of which 7 ms to minimize.
[2024-05-22 16:05:17] [INFO ] Deduced a trap composed of 67 places in 876 ms of which 8 ms to minimize.
[2024-05-22 16:05:18] [INFO ] Deduced a trap composed of 51 places in 867 ms of which 7 ms to minimize.
[2024-05-22 16:05:19] [INFO ] Deduced a trap composed of 52 places in 871 ms of which 8 ms to minimize.
[2024-05-22 16:05:20] [INFO ] Deduced a trap composed of 51 places in 872 ms of which 7 ms to minimize.
[2024-05-22 16:05:20] [INFO ] Deduced a trap composed of 71 places in 852 ms of which 7 ms to minimize.
[2024-05-22 16:05:21] [INFO ] Deduced a trap composed of 66 places in 807 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1896 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:05:22] [INFO ] Deduced a trap composed of 50 places in 875 ms of which 8 ms to minimize.
[2024-05-22 16:05:23] [INFO ] Deduced a trap composed of 50 places in 898 ms of which 8 ms to minimize.
[2024-05-22 16:05:24] [INFO ] Deduced a trap composed of 73 places in 846 ms of which 8 ms to minimize.
[2024-05-22 16:05:25] [INFO ] Deduced a trap composed of 51 places in 874 ms of which 8 ms to minimize.
[2024-05-22 16:05:26] [INFO ] Deduced a trap composed of 56 places in 806 ms of which 7 ms to minimize.
[2024-05-22 16:05:27] [INFO ] Deduced a trap composed of 55 places in 841 ms of which 8 ms to minimize.
[2024-05-22 16:05:27] [INFO ] Deduced a trap composed of 60 places in 776 ms of which 7 ms to minimize.
[2024-05-22 16:05:28] [INFO ] Deduced a trap composed of 52 places in 768 ms of which 7 ms to minimize.
[2024-05-22 16:05:29] [INFO ] Deduced a trap composed of 60 places in 755 ms of which 7 ms to minimize.
[2024-05-22 16:05:30] [INFO ] Deduced a trap composed of 59 places in 750 ms of which 7 ms to minimize.
[2024-05-22 16:05:31] [INFO ] Deduced a trap composed of 50 places in 743 ms of which 10 ms to minimize.
[2024-05-22 16:05:31] [INFO ] Deduced a trap composed of 72 places in 749 ms of which 7 ms to minimize.
[2024-05-22 16:05:32] [INFO ] Deduced a trap composed of 49 places in 735 ms of which 7 ms to minimize.
[2024-05-22 16:05:33] [INFO ] Deduced a trap composed of 53 places in 716 ms of which 7 ms to minimize.
[2024-05-22 16:05:34] [INFO ] Deduced a trap composed of 47 places in 702 ms of which 7 ms to minimize.
[2024-05-22 16:05:34] [INFO ] Deduced a trap composed of 46 places in 700 ms of which 7 ms to minimize.
[2024-05-22 16:05:35] [INFO ] Deduced a trap composed of 48 places in 683 ms of which 6 ms to minimize.
[2024-05-22 16:05:36] [INFO ] Deduced a trap composed of 64 places in 640 ms of which 6 ms to minimize.
[2024-05-22 16:05:36] [INFO ] Deduced a trap composed of 49 places in 626 ms of which 7 ms to minimize.
[2024-05-22 16:05:37] [INFO ] Deduced a trap composed of 48 places in 594 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1896 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:05:38] [INFO ] Deduced a trap composed of 52 places in 519 ms of which 6 ms to minimize.
[2024-05-22 16:05:38] [INFO ] Deduced a trap composed of 48 places in 520 ms of which 6 ms to minimize.
[2024-05-22 16:05:39] [INFO ] Deduced a trap composed of 49 places in 517 ms of which 6 ms to minimize.
[2024-05-22 16:05:39] [INFO ] Deduced a trap composed of 47 places in 609 ms of which 6 ms to minimize.
[2024-05-22 16:05:40] [INFO ] Deduced a trap composed of 47 places in 523 ms of which 5 ms to minimize.
[2024-05-22 16:05:40] [INFO ] Deduced a trap composed of 55 places in 474 ms of which 5 ms to minimize.
[2024-05-22 16:05:41] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 5 ms to minimize.
[2024-05-22 16:05:41] [INFO ] Deduced a trap composed of 56 places in 450 ms of which 5 ms to minimize.
[2024-05-22 16:05:42] [INFO ] Deduced a trap composed of 53 places in 490 ms of which 5 ms to minimize.
[2024-05-22 16:05:42] [INFO ] Deduced a trap composed of 54 places in 481 ms of which 5 ms to minimize.
[2024-05-22 16:05:43] [INFO ] Deduced a trap composed of 49 places in 442 ms of which 5 ms to minimize.
[2024-05-22 16:05:43] [INFO ] Deduced a trap composed of 49 places in 443 ms of which 5 ms to minimize.
[2024-05-22 16:05:44] [INFO ] Deduced a trap composed of 48 places in 397 ms of which 4 ms to minimize.
[2024-05-22 16:05:44] [INFO ] Deduced a trap composed of 47 places in 388 ms of which 4 ms to minimize.
[2024-05-22 16:05:45] [INFO ] Deduced a trap composed of 47 places in 420 ms of which 5 ms to minimize.
[2024-05-22 16:05:45] [INFO ] Deduced a trap composed of 47 places in 402 ms of which 5 ms to minimize.
[2024-05-22 16:05:45] [INFO ] Deduced a trap composed of 47 places in 401 ms of which 5 ms to minimize.
[2024-05-22 16:05:46] [INFO ] Deduced a trap composed of 45 places in 375 ms of which 4 ms to minimize.
[2024-05-22 16:05:46] [INFO ] Deduced a trap composed of 54 places in 374 ms of which 4 ms to minimize.
[2024-05-22 16:05:47] [INFO ] Deduced a trap composed of 54 places in 341 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1896 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2024-05-22 16:05:47] [INFO ] Deduced a trap composed of 52 places in 354 ms of which 5 ms to minimize.
[2024-05-22 16:05:47] [INFO ] Deduced a trap composed of 51 places in 342 ms of which 5 ms to minimize.
[2024-05-22 16:05:48] [INFO ] Deduced a trap composed of 57 places in 383 ms of which 4 ms to minimize.
[2024-05-22 16:05:48] [INFO ] Deduced a trap composed of 53 places in 388 ms of which 5 ms to minimize.
[2024-05-22 16:05:49] [INFO ] Deduced a trap composed of 53 places in 379 ms of which 5 ms to minimize.
[2024-05-22 16:05:49] [INFO ] Deduced a trap composed of 50 places in 384 ms of which 4 ms to minimize.
[2024-05-22 16:05:49] [INFO ] Deduced a trap composed of 53 places in 376 ms of which 4 ms to minimize.
[2024-05-22 16:05:50] [INFO ] Deduced a trap composed of 51 places in 346 ms of which 4 ms to minimize.
[2024-05-22 16:05:50] [INFO ] Deduced a trap composed of 53 places in 341 ms of which 4 ms to minimize.
[2024-05-22 16:05:51] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 4 ms to minimize.
[2024-05-22 16:05:51] [INFO ] Deduced a trap composed of 47 places in 408 ms of which 4 ms to minimize.
[2024-05-22 16:05:51] [INFO ] Deduced a trap composed of 48 places in 318 ms of which 4 ms to minimize.
SMT process timed out in 95173ms, After SMT, problems are : Problem set: 0 solved, 18 unsolved
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 30 out of 1898 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 6630/6630 transitions.
Applied a total of 0 rules in 182 ms. Remains 1898 /1898 variables (removed 0) and now considering 6630/6630 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 1898/1898 places, 6630/6630 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1898/1898 places, 6630/6630 transitions.
Applied a total of 0 rules in 168 ms. Remains 1898 /1898 variables (removed 0) and now considering 6630/6630 (removed 0) transitions.
[2024-05-22 16:05:52] [INFO ] Invariant cache hit.
[2024-05-22 16:05:54] [INFO ] Implicit Places using invariants in 2027 ms returned []
[2024-05-22 16:05:54] [INFO ] Invariant cache hit.
[2024-05-22 16:05:55] [INFO ] State equation strengthened by 6411 read => feed constraints.
[2024-05-22 16:06:26] [INFO ] Performed 689/1898 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:06:56] [INFO ] Performed 1802/1898 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:06:58] [INFO ] Implicit Places using invariants and state equation in 64644 ms returned []
Implicit Place search using SMT with State Equation took 66671 ms to find 0 implicit places.
[2024-05-22 16:06:59] [INFO ] Redundant transitions in 675 ms returned []
Running 6590 sub problems to find dead transitions.
[2024-05-22 16:06:59] [INFO ] Invariant cache hit.
[2024-05-22 16:06:59] [INFO ] State equation strengthened by 6411 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1897 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6590 unsolved
SMT process timed out in 36916ms, After SMT, problems are : Problem set: 0 solved, 6590 unsolved
Search for dead transitions found 0 dead transitions in 36982ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104527 ms. Remains : 1898/1898 places, 6630/6630 transitions.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-040-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 16:07:36] [INFO ] Flatten gal took : 206 ms
[2024-05-22 16:07:37] [INFO ] Flatten gal took : 214 ms
[2024-05-22 16:07:37] [INFO ] Input system was already deterministic with 9840 transitions.
Support contains 86 out of 3683 places (down from 90) after GAL structural reductions.
Computed a total of 162 stabilizing places and 280 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 184 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:38] [INFO ] Flatten gal took : 177 ms
[2024-05-22 16:07:38] [INFO ] Flatten gal took : 195 ms
[2024-05-22 16:07:38] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 178 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:38] [INFO ] Flatten gal took : 169 ms
[2024-05-22 16:07:39] [INFO ] Flatten gal took : 184 ms
[2024-05-22 16:07:39] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 3683 transition count 9560
Reduce places removed 280 places and 0 transitions.
Iterating post reduction 1 with 280 rules applied. Total rules applied 560 place count 3403 transition count 9560
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 640 place count 3363 transition count 9520
Applied a total of 640 rules in 527 ms. Remains 3363 /3683 variables (removed 320) and now considering 9520/9840 (removed 320) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 528 ms. Remains : 3363/3683 places, 9520/9840 transitions.
[2024-05-22 16:07:40] [INFO ] Flatten gal took : 162 ms
[2024-05-22 16:07:40] [INFO ] Flatten gal took : 173 ms
[2024-05-22 16:07:40] [INFO ] Input system was already deterministic with 9520 transitions.
RANDOM walk for 26961 steps (62 resets) in 346 ms. (77 steps per ms) remains 0/1 properties
FORMULA CANInsertWithFailure-PT-040-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 186 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 186 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:41] [INFO ] Flatten gal took : 163 ms
[2024-05-22 16:07:41] [INFO ] Flatten gal took : 180 ms
[2024-05-22 16:07:41] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 178 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:42] [INFO ] Flatten gal took : 168 ms
[2024-05-22 16:07:42] [INFO ] Flatten gal took : 183 ms
[2024-05-22 16:07:42] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 180 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:42] [INFO ] Flatten gal took : 164 ms
[2024-05-22 16:07:43] [INFO ] Flatten gal took : 181 ms
[2024-05-22 16:07:43] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 180 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:43] [INFO ] Flatten gal took : 163 ms
[2024-05-22 16:07:44] [INFO ] Flatten gal took : 177 ms
[2024-05-22 16:07:44] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 274 transitions
Trivial Post-agglo rules discarded 274 transitions
Performed 274 trivial Post agglomeration. Transition count delta: 274
Iterating post reduction 0 with 274 rules applied. Total rules applied 274 place count 3683 transition count 9566
Reduce places removed 274 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 276 rules applied. Total rules applied 550 place count 3409 transition count 9564
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 552 place count 3407 transition count 9564
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 552 place count 3407 transition count 9563
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 554 place count 3406 transition count 9563
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 2 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 632 place count 3367 transition count 9524
Applied a total of 632 rules in 538 ms. Remains 3367 /3683 variables (removed 316) and now considering 9524/9840 (removed 316) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 538 ms. Remains : 3367/3683 places, 9524/9840 transitions.
[2024-05-22 16:07:45] [INFO ] Flatten gal took : 160 ms
[2024-05-22 16:07:45] [INFO ] Flatten gal took : 170 ms
[2024-05-22 16:07:45] [INFO ] Input system was already deterministic with 9524 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 180 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:46] [INFO ] Flatten gal took : 160 ms
[2024-05-22 16:07:46] [INFO ] Flatten gal took : 177 ms
[2024-05-22 16:07:46] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 179 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:46] [INFO ] Flatten gal took : 161 ms
[2024-05-22 16:07:47] [INFO ] Flatten gal took : 176 ms
[2024-05-22 16:07:47] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 179 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:47] [INFO ] Flatten gal took : 160 ms
[2024-05-22 16:07:48] [INFO ] Flatten gal took : 176 ms
[2024-05-22 16:07:48] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 179 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:48] [INFO ] Flatten gal took : 163 ms
[2024-05-22 16:07:48] [INFO ] Flatten gal took : 180 ms
[2024-05-22 16:07:49] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 197 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:49] [INFO ] Flatten gal took : 170 ms
[2024-05-22 16:07:49] [INFO ] Flatten gal took : 189 ms
[2024-05-22 16:07:50] [INFO ] Input system was already deterministic with 9840 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 279 transitions
Trivial Post-agglo rules discarded 279 transitions
Performed 279 trivial Post agglomeration. Transition count delta: 279
Iterating post reduction 0 with 279 rules applied. Total rules applied 279 place count 3683 transition count 9561
Reduce places removed 279 places and 0 transitions.
Iterating post reduction 1 with 279 rules applied. Total rules applied 558 place count 3404 transition count 9561
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 2 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 638 place count 3364 transition count 9521
Applied a total of 638 rules in 528 ms. Remains 3364 /3683 variables (removed 319) and now considering 9521/9840 (removed 319) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 529 ms. Remains : 3364/3683 places, 9521/9840 transitions.
[2024-05-22 16:07:51] [INFO ] Flatten gal took : 169 ms
[2024-05-22 16:07:51] [INFO ] Flatten gal took : 189 ms
[2024-05-22 16:07:51] [INFO ] Input system was already deterministic with 9521 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3683/3683 places, 9840/9840 transitions.
Applied a total of 0 rules in 176 ms. Remains 3683 /3683 variables (removed 0) and now considering 9840/9840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 177 ms. Remains : 3683/3683 places, 9840/9840 transitions.
[2024-05-22 16:07:51] [INFO ] Flatten gal took : 158 ms
[2024-05-22 16:07:52] [INFO ] Flatten gal took : 178 ms
[2024-05-22 16:07:52] [INFO ] Input system was already deterministic with 9840 transitions.
[2024-05-22 16:07:52] [INFO ] Flatten gal took : 170 ms
[2024-05-22 16:07:52] [INFO ] Flatten gal took : 179 ms
[2024-05-22 16:07:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-22 16:07:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3683 places, 9840 transitions and 26320 arcs took 35 ms.
Total runtime 390681 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running CANInsertWithFailure-PT-040
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 3683
TRANSITIONS: 9840
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.147s, Sys 0.013s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.029s, 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: 1034
MODEL NAME: /home/mcc/execution/411/model
3683 places, 9840 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716394654404
--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 785402116 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 1178103172 at storage/ct_typebased.h, line 1565
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="CANInsertWithFailure-PT-040"
export BK_EXAMINATION="CTLCardinality"
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 CANInsertWithFailure-PT-040, examination is CTLCardinality"
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-171620503800121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-040.tgz
mv CANInsertWithFailure-PT-040 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;