fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r311-tall-171662335700033
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for QuasiCertifProtocol-COL-22

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12433.983 3600000.00 6973665.00 6118.50 ??TT????F??TFFT? 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.r311-tall-171662335700033.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 QuasiCertifProtocol-COL-22, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662335700033
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.7K Apr 13 04:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 13 04:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 04:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 13 04:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K Apr 13 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 04:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Apr 13 04:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 104K May 18 16:43 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 QuasiCertifProtocol-COL-22-CTLCardinality-2024-00
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-01
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-02
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-03
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-04
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-05
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-06
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-07
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-08
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-09
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-10
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-11
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-12
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-13
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-14
FORMULA_NAME QuasiCertifProtocol-COL-22-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716647438145

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-22
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 14:30:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 14:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 14:30:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 14:30:39] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 14:30:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 671 ms
[2024-05-25 14:30:40] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 1966 PT places and 356.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
[2024-05-25 14:30:40] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 4 ms.
[2024-05-25 14:30:40] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40042 steps (1230 resets) in 1197 ms. (33 steps per ms) remains 58/97 properties
BEST_FIRST walk for 4004 steps (40 resets) in 41 ms. (95 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4008 steps (41 resets) in 40 ms. (97 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (39 resets) in 51 ms. (76 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4007 steps (68 resets) in 39 ms. (100 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (43 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 28 ms. (138 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (42 resets) in 19 ms. (200 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 32 ms. (121 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (26 resets) in 35 ms. (111 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (41 resets) in 49 ms. (80 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4009 steps (45 resets) in 48 ms. (81 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (40 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4015 steps (41 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (41 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (40 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (44 resets) in 20 ms. (190 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 21 ms. (181 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4013 steps (65 resets) in 20 ms. (191 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (28 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4006 steps (39 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (39 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (42 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 27 ms. (143 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (68 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (25 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4005 steps (41 resets) in 14 ms. (267 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4007 steps (40 resets) in 13 ms. (286 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4005 steps (41 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (67 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (41 resets) in 16 ms. (235 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 22 ms. (174 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (41 resets) in 24 ms. (160 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (43 resets) in 23 ms. (166 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (42 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 15 ms. (250 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (39 resets) in 14 ms. (266 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4007 steps (39 resets) in 17 ms. (222 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (68 resets) in 18 ms. (210 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4004 steps (40 resets) in 21 ms. (182 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4003 steps (40 resets) in 29 ms. (133 steps per ms) remains 58/58 properties
// Phase 1: matrix 26 rows 30 cols
[2024-05-25 14:30:41] [INFO ] Computed 5 invariants in 7 ms
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp83 is UNSAT
Problem AtomicPropp84 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
Problem AtomicPropp95 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 29 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 29 solved, 29 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp89 is UNSAT
Problem AtomicPropp90 is UNSAT
At refinement iteration 2 (OVERLAPS) 2/27 variables, 2/5 constraints. Problems are: Problem set: 43 solved, 15 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 43 solved, 15 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 4 (OVERLAPS) 26/53 variables, 27/32 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/32 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 3/56 variables, 3/35 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 53 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 53 solved, 5 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 53 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/22 variables, 5/5 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/48 variables, 22/27 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 2/29 constraints. Problems are: Problem set: 53 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 53 solved, 5 unsolved
Problem AtomicPropp55 is UNSAT
At refinement iteration 6 (OVERLAPS) 8/56 variables, 8/37 constraints. Problems are: Problem set: 54 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 2/39 constraints. Problems are: Problem set: 54 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/39 constraints. Problems are: Problem set: 54 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/39 constraints. Problems are: Problem set: 54 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 39 constraints, problems are : Problem set: 54 solved, 4 unsolved in 109 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 4/58 constraints, Known Traps: 0/0 constraints]
After SMT, in 592ms problems are : Problem set: 54 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 134 steps, including 0 resets, run visited all 4 properties in 5 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 9 ms.
Successfully simplified 54 atomic propositions for a total of 16 simplifications.
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:30:41] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-25 14:30:41] [INFO ] Flatten gal took : 19 ms
[2024-05-25 14:30:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-22-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 14:30:41] [INFO ] Flatten gal took : 4 ms
Domain [tsid(23), tsid(23)] of place n9 breaks symmetries in sort tsid
[2024-05-25 14:30:41] [INFO ] Unfolded HLPN to a Petri net with 1966 places and 356 transitions 4323 arcs in 27 ms.
[2024-05-25 14:30:41] [INFO ] Unfolded 9 HLPN properties in 1 ms.
Support contains 1943 out of 1966 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Applied a total of 0 rules in 14 ms. Remains 1966 /1966 variables (removed 0) and now considering 356/356 (removed 0) transitions.
// Phase 1: matrix 356 rows 1966 cols
[2024-05-25 14:30:42] [INFO ] Computed 1611 invariants in 83 ms
[2024-05-25 14:30:42] [INFO ] Implicit Places using invariants in 662 ms returned []
[2024-05-25 14:30:42] [INFO ] Invariant cache hit.
[2024-05-25 14:30:43] [INFO ] Implicit Places using invariants and state equation in 1218 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2024-05-25 14:30:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 51/1966 variables, 4/1082 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/1966 variables, 529/1611 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1966/2322 variables, and 1611 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1607/1607 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1915 variables, 1078/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1915 variables, 0/1078 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 51/1966 variables, 4/1082 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1966 variables, 529/1611 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1966 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (OVERLAPS) 356/2322 variables, 1966/3577 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2322 variables, 332/3909 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2322/2322 variables, and 3909 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1607/1607 constraints, State Equation: 1966/1966 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 0/0 constraints]
After SMT, in 60633ms problems are : Problem set: 0 solved, 332 unsolved
Search for dead transitions found 0 dead transitions in 60640ms
Finished structural reductions in LTL mode , in 1 iterations and 62566 ms. Remains : 1966/1966 places, 356/356 transitions.
Support contains 1943 out of 1966 places after structural reductions.
[2024-05-25 14:31:44] [INFO ] Flatten gal took : 132 ms
[2024-05-25 14:31:44] [INFO ] Flatten gal took : 103 ms
[2024-05-25 14:31:45] [INFO ] Input system was already deterministic with 356 transitions.
RANDOM walk for 40000 steps (1484 resets) in 3903 ms. (10 steps per ms) remains 57/65 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (11 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4000 steps (12 resets) in 36 ms. (108 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (9 resets) in 41 ms. (95 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (10 resets) in 40 ms. (97 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (10 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4001 steps (10 resets) in 65 ms. (60 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (10 resets) in 37 ms. (105 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (12 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (11 resets) in 39 ms. (100 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (10 resets) in 64 ms. (61 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (9 resets) in 31 ms. (125 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (10 resets) in 70 ms. (56 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (10 resets) in 50 ms. (78 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4000 steps (12 resets) in 42 ms. (93 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (9 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (11 resets) in 34 ms. (114 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (10 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (11 resets) in 33 ms. (117 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (9 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (10 resets) in 35 ms. (111 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (9 resets) in 48 ms. (81 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4000 steps (12 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (9 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4002 steps (9 resets) in 24 ms. (160 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (10 resets) in 25 ms. (153 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (10 resets) in 29 ms. (133 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 57/57 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 57/57 properties
[2024-05-25 14:31:46] [INFO ] Invariant cache hit.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp38 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1942 variables, 3/3 constraints. Problems are: Problem set: 20 solved, 37 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1942 variables, 1585/1588 constraints. Problems are: Problem set: 20 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1942 variables, 0/1588 constraints. Problems are: Problem set: 20 solved, 37 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
At refinement iteration 3 (OVERLAPS) 1/1943 variables, 1/1589 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1943 variables, 0/1589 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 23/1966 variables, 22/1611 constraints. Problems are: Problem set: 27 solved, 30 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1966/2322 variables, and 1611 constraints, problems are : Problem set: 27 solved, 30 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1607/1607 constraints, State Equation: 0/1966 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 27 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1916 variables, 2/2 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1916 variables, 1585/1587 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1916 variables, 0/1587 constraints. Problems are: Problem set: 27 solved, 30 unsolved
At refinement iteration 3 (OVERLAPS) 27/1943 variables, 2/1589 constraints. Problems are: Problem set: 27 solved, 30 unsolved
[2024-05-25 14:31:54] [INFO ] Deduced a trap composed of 6 places in 955 ms of which 97 ms to minimize.
[2024-05-25 14:31:55] [INFO ] Deduced a trap composed of 6 places in 874 ms of which 12 ms to minimize.
[2024-05-25 14:31:56] [INFO ] Deduced a trap composed of 5 places in 762 ms of which 13 ms to minimize.
[2024-05-25 14:31:57] [INFO ] Deduced a trap composed of 10 places in 794 ms of which 19 ms to minimize.
SMT process timed out in 10567ms, After SMT, problems are : Problem set: 27 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1916 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1965 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 1965 transition count 354
Applied a total of 3 rules in 64 ms. Remains 1965 /1966 variables (removed 1) and now considering 354/356 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 1965/1966 places, 354/356 transitions.
RANDOM walk for 40000 steps (1541 resets) in 3171 ms. (12 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 25 ms. (153 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 57 ms. (69 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 26 ms. (148 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 53 ms. (74 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 32 ms. (121 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 25 ms. (154 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (10 resets) in 45 ms. (87 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 30 ms. (129 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 48 ms. (81 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (11 resets) in 27 ms. (142 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (9 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (10 resets) in 27 ms. (143 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 24 ms. (160 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (12 resets) in 29 ms. (133 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 73 ms. (54 steps per ms) remains 30/30 properties
Interrupted probabilistic random walk after 279591 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :22 out of 30
Probabilistic random walk after 279591 steps, saw 48903 distinct states, run finished after 3004 ms. (steps per millisecond=93 ) properties seen :22
// Phase 1: matrix 354 rows 1965 cols
[2024-05-25 14:32:01] [INFO ] Computed 1611 invariants in 37 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 22/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 186/326 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/326 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 1634/1960 variables, 1586/1611 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1960 variables, 0/1611 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp52 is UNSAT
At refinement iteration 6 (OVERLAPS) 352/2312 variables, 1960/3571 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2312 variables, 0/3571 constraints. Problems are: Problem set: 4 solved, 4 unsolved
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 8 (OVERLAPS) 7/2319 variables, 5/3576 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2319 variables, 0/3576 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/2319 variables, 0/3576 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2319/2319 variables, and 3576 constraints, problems are : Problem set: 7 solved, 1 unsolved in 2012 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1608/1608 constraints, State Equation: 1965/1965 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 140/165 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-05-25 14:32:03] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 2 ms to minimize.
[2024-05-25 14:32:03] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 1 ms to minimize.
[2024-05-25 14:32:03] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-25 14:32:03] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 2 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 191 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 2 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
[2024-05-25 14:32:04] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 1 ms to minimize.
[2024-05-25 14:32:05] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 1 ms to minimize.
[2024-05-25 14:32:05] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 2 ms to minimize.
[2024-05-25 14:32:05] [INFO ] Deduced a trap composed of 8 places in 62 ms of which 1 ms to minimize.
[2024-05-25 14:32:05] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/22 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-05-25 14:32:05] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 1/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/234 variables, 1/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/24 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1587/1821 variables, 1541/1565 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-05-25 14:32:05] [INFO ] Deduced a trap composed of 9 places in 214 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1821 variables, 1/1566 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1821 variables, 0/1566 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 348/2169 variables, 1821/3387 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2169 variables, 0/3387 constraints. Problems are: Problem set: 7 solved, 1 unsolved
Problem AtomicPropp40 is UNSAT
After SMT solving in domain Int declared 2315/2319 variables, and 3527 constraints, problems are : Problem set: 8 solved, 0 unsolved in 3901 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1541/1608 constraints, State Equation: 1961/1965 constraints, PredecessorRefiner: 0/8 constraints, Known Traps: 22/22 constraints]
After SMT, in 5993ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 35 atomic propositions for a total of 9 simplifications.
[2024-05-25 14:32:07] [INFO ] Flatten gal took : 65 ms
[2024-05-25 14:32:07] [INFO ] Flatten gal took : 65 ms
[2024-05-25 14:32:07] [INFO ] Input system was already deterministic with 356 transitions.
Support contains 1895 out of 1966 places (down from 1919) after GAL structural reductions.
Computed a total of 1966 stabilizing places and 356 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1966 transition count 356
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 1918 transition count 356
Applied a total of 48 rules in 274 ms. Remains 1918 /1966 variables (removed 48) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 275 ms. Remains : 1918/1966 places, 356/356 transitions.
[2024-05-25 14:32:08] [INFO ] Flatten gal took : 51 ms
[2024-05-25 14:32:08] [INFO ] Flatten gal took : 52 ms
[2024-05-25 14:32:08] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 41 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 1916/1966 places, 356/356 transitions.
[2024-05-25 14:32:08] [INFO ] Flatten gal took : 44 ms
[2024-05-25 14:32:08] [INFO ] Flatten gal took : 45 ms
[2024-05-25 14:32:08] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 1940 transition count 356
Applied a total of 26 rules in 41 ms. Remains 1940 /1966 variables (removed 26) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 1940/1966 places, 356/356 transitions.
[2024-05-25 14:32:08] [INFO ] Flatten gal took : 43 ms
[2024-05-25 14:32:08] [INFO ] Flatten gal took : 45 ms
[2024-05-25 14:32:08] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 1916 transition count 356
Applied a total of 50 rules in 98 ms. Remains 1916 /1966 variables (removed 50) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 1916/1966 places, 356/356 transitions.
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 43 ms
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 44 ms
[2024-05-25 14:32:09] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1917 transition count 356
Applied a total of 49 rules in 44 ms. Remains 1917 /1966 variables (removed 49) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 1917/1966 places, 356/356 transitions.
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 41 ms
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 42 ms
[2024-05-25 14:32:09] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1939 transition count 356
Applied a total of 27 rules in 40 ms. Remains 1939 /1966 variables (removed 27) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 1939/1966 places, 356/356 transitions.
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 43 ms
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 42 ms
[2024-05-25 14:32:09] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1917 transition count 356
Applied a total of 49 rules in 79 ms. Remains 1917 /1966 variables (removed 49) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 1917/1966 places, 356/356 transitions.
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 39 ms
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 38 ms
[2024-05-25 14:32:09] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1965 transition count 356
Applied a total of 1 rules in 42 ms. Remains 1965 /1966 variables (removed 1) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 1965/1966 places, 356/356 transitions.
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 38 ms
[2024-05-25 14:32:09] [INFO ] Flatten gal took : 39 ms
[2024-05-25 14:32:09] [INFO ] Input system was already deterministic with 356 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 0 with 49 rules applied. Total rules applied 49 place count 1917 transition count 356
Applied a total of 49 rules in 69 ms. Remains 1917 /1966 variables (removed 49) and now considering 356/356 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 70 ms. Remains : 1917/1966 places, 356/356 transitions.
[2024-05-25 14:32:10] [INFO ] Flatten gal took : 37 ms
[2024-05-25 14:32:10] [INFO ] Flatten gal took : 39 ms
[2024-05-25 14:32:10] [INFO ] Input system was already deterministic with 356 transitions.
[2024-05-25 14:32:10] [INFO ] Flatten gal took : 40 ms
[2024-05-25 14:32:10] [INFO ] Flatten gal took : 39 ms
[2024-05-25 14:32:10] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-25 14:32:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1966 places, 356 transitions and 4323 arcs took 6 ms.
Total runtime 91002 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running QuasiCertifProtocol-COL-22

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: 1966
TRANSITIONS: 356
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.026s, Sys 0.000s]


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


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 663
MODEL NAME: /home/mcc/execution/411/model
1966 places, 356 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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:
++ 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 4194304 at unique_table.cc, line 313
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="QuasiCertifProtocol-COL-22"
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 QuasiCertifProtocol-COL-22, 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 r311-tall-171662335700033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-22.tgz
mv QuasiCertifProtocol-COL-22 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;