Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445000001.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PhilosophersDyn-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445000001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 8.2K Apr 11 14:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 14:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 11 14:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 11 14:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 11 14:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 11 14:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 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 31K 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 PhilosophersDyn-COL-03-CTLCardinality-2024-00
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-01
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-02
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-03
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-04
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-05
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-06
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-07
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-08
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-09
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-10
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-11
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-12
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-13
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-14
FORMULA_NAME PhilosophersDyn-COL-03-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716840662421

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 20:11:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-27 20:11:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:11:04] [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-27 20:11:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-27 20:11:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 572 ms
[2024-05-27 20:11:04] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 30 PT places and 87.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-05-27 20:11:04] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 4 ms.
[2024-05-27 20:11:04] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40000 steps (5448 resets) in 2102 ms. (19 steps per ms) remains 56/78 properties
BEST_FIRST walk for 4002 steps (101 resets) in 126 ms. (31 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (171 resets) in 50 ms. (78 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (77 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (260 resets) in 34 ms. (114 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (110 resets) in 29 ms. (133 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (172 resets) in 35 ms. (111 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (284 resets) in 24 ms. (160 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (198 resets) in 36 ms. (108 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (400 resets) in 30 ms. (129 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (102 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (128 resets) in 40 ms. (97 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (137 resets) in 22 ms. (174 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (134 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (172 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (349 resets) in 38 ms. (102 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (400 resets) in 25 ms. (153 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (170 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (212 resets) in 36 ms. (108 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (178 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (134 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (124 resets) in 13 ms. (285 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (217 resets) in 28 ms. (138 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (208 resets) in 19 ms. (200 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (154 resets) in 58 ms. (67 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (131 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (171 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (400 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (168 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (103 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (124 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (400 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (148 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (168 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (133 resets) in 18 ms. (210 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (172 resets) in 20 ms. (190 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (171 resets) in 12 ms. (307 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (142 resets) in 41 ms. (95 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (142 resets) in 25 ms. (154 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (88 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (131 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (131 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (103 resets) in 15 ms. (250 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4004 steps (170 resets) in 13 ms. (286 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (192 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (84 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4001 steps (172 resets) in 14 ms. (266 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (172 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4000 steps (400 resets) in 21 ms. (181 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4002 steps (135 resets) in 17 ms. (222 steps per ms) remains 56/56 properties
BEST_FIRST walk for 4003 steps (221 resets) in 16 ms. (235 steps per ms) remains 56/56 properties
// Phase 1: matrix 7 rows 8 cols
[2024-05-27 20:11:05] [INFO ] Computed 3 invariants in 4 ms
[2024-05-27 20:11:06] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp66 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 50 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 50 solved, 6 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp59 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp75 is UNSAT
After SMT solving in domain Real declared 15/15 variables, and 11 constraints, problems are : Problem set: 56 solved, 0 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 56/56 constraints, Known Traps: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 56 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 56 atomic propositions for a total of 14 simplifications.
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:06] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 16 ms
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-27 20:11:06] [INFO ] Flatten gal took : 2 ms
Domain [Philosopher(3), Philosopher(3)] of place Neighbourhood breaks symmetries in sort Philosopher
[2024-05-27 20:11:06] [INFO ] Unfolded HLPN to a Petri net with 30 places and 84 transitions 564 arcs in 14 ms.
[2024-05-27 20:11:06] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Running 78 sub problems to find dead transitions.
[2024-05-27 20:11:06] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2024-05-27 20:11:06] [INFO ] Computed 11 invariants in 6 ms
[2024-05-27 20:11:06] [INFO ] State equation strengthened by 36 read => feed constraints.
Problem TDEAD7 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD56 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 10/10 constraints. Problems are: Problem set: 20 solved, 58 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD48 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/87 variables, 0/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 87/87 variables, and 77 constraints, problems are : Problem set: 30 solved, 48 unsolved in 926 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 10/10 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 1/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 57/87 variables, 30/41 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 36/77 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 48/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/87 variables, 0/125 constraints. Problems are: Problem set: 30 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 87/87 variables, and 125 constraints, problems are : Problem set: 30 solved, 48 unsolved in 946 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 48/78 constraints, Known Traps: 0/0 constraints]
After SMT, in 1968ms problems are : Problem set: 30 solved, 48 unsolved
Search for dead transitions found 30 dead transitions in 1973ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2024-05-27 20:11:08] [INFO ] Computed 11 invariants in 2 ms
[2024-05-27 20:11:08] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 20:11:08] [INFO ] Invariant cache hit.
[2024-05-27 20:11:08] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-27 20:11:08] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2178 ms. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2024-05-27 20:11:08] [INFO ] Flatten gal took : 12 ms
[2024-05-27 20:11:08] [INFO ] Flatten gal took : 11 ms
[2024-05-27 20:11:08] [INFO ] Input system was already deterministic with 51 transitions.
RANDOM walk for 40000 steps (5730 resets) in 3575 ms. (11 steps per ms) remains 33/47 properties
BEST_FIRST walk for 4003 steps (91 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (118 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (100 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (170 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (92 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (117 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (198 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (117 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (116 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (248 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (120 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (248 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (114 resets) in 12 ms. (307 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (92 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (118 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (125 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (114 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (117 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (117 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (91 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (116 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (125 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (102 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (118 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (115 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (248 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (119 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (145 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (113 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (97 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (207 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (114 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (106 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
[2024-05-27 20:11:09] [INFO ] Invariant cache hit.
[2024-05-27 20:11:09] [INFO ] State equation strengthened by 30 read => feed constraints.
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 17 solved, 16 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp46 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/11 constraints. Problems are: Problem set: 28 solved, 5 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp31 is UNSAT
After SMT solving in domain Real declared 81/81 variables, and 41 constraints, problems are : Problem set: 33 solved, 0 unsolved in 171 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 0/30 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 212ms problems are : Problem set: 33 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 33 atomic propositions for a total of 9 simplifications.
[2024-05-27 20:11:10] [INFO ] Flatten gal took : 9 ms
[2024-05-27 20:11:10] [INFO ] Flatten gal took : 8 ms
[2024-05-27 20:11:10] [INFO ] Input system was already deterministic with 51 transitions.
Support contains 21 out of 30 places (down from 30) after GAL structural reductions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:10] [INFO ] Invariant cache hit.
[2024-05-27 20:11:10] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:10] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:12] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 4 ms to minimize.
[2024-05-27 20:11:12] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 2393ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 2394ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 2404 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:12] [INFO ] Flatten gal took : 20 ms
[2024-05-27 20:11:12] [INFO ] Flatten gal took : 18 ms
[2024-05-27 20:11:12] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:12] [INFO ] Invariant cache hit.
[2024-05-27 20:11:12] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:13] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 959 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:14] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 1 ms to minimize.
[2024-05-27 20:11:14] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1934ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1935ms
Finished structural reductions in LTL mode , in 1 iterations and 1936 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:14] [INFO ] Flatten gal took : 7 ms
[2024-05-27 20:11:14] [INFO ] Flatten gal took : 7 ms
[2024-05-27 20:11:14] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:14] [INFO ] Invariant cache hit.
[2024-05-27 20:11:14] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:15] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:16] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 1 ms to minimize.
[2024-05-27 20:11:16] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1978ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1979ms
Finished structural reductions in LTL mode , in 1 iterations and 1981 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:16] [INFO ] Flatten gal took : 8 ms
[2024-05-27 20:11:16] [INFO ] Flatten gal took : 8 ms
[2024-05-27 20:11:16] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:16] [INFO ] Invariant cache hit.
[2024-05-27 20:11:16] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:16] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 681 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:17] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:11:18] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1872ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1878ms
Finished structural reductions in LTL mode , in 1 iterations and 1879 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:18] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:18] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:18] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:18] [INFO ] Invariant cache hit.
[2024-05-27 20:11:18] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:18] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:19] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2024-05-27 20:11:19] [INFO ] Deduced a trap composed of 12 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1010 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1662ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1663ms
Finished structural reductions in LTL mode , in 1 iterations and 1665 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:20] [INFO ] Flatten gal took : 10 ms
[2024-05-27 20:11:20] [INFO ] Flatten gal took : 9 ms
[2024-05-27 20:11:20] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 6 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:20] [INFO ] Invariant cache hit.
[2024-05-27 20:11:20] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:20] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 708 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:21] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
[2024-05-27 20:11:21] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1742ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1743ms
Finished structural reductions in LTL mode , in 1 iterations and 1749 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:22] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:22] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:22] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:22] [INFO ] Invariant cache hit.
[2024-05-27 20:11:22] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:22] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:23] [INFO ] Deduced a trap composed of 13 places in 20 ms of which 1 ms to minimize.
[2024-05-27 20:11:23] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 983 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1571ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1571ms
Finished structural reductions in LTL mode , in 1 iterations and 1572 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:23] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:23] [INFO ] Flatten gal took : 5 ms
[2024-05-27 20:11:23] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:23] [INFO ] Invariant cache hit.
[2024-05-27 20:11:23] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:23] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 487 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:24] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-27 20:11:24] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1415ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1416ms
Finished structural reductions in LTL mode , in 1 iterations and 1417 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:25] [INFO ] Flatten gal took : 9 ms
[2024-05-27 20:11:25] [INFO ] Flatten gal took : 10 ms
[2024-05-27 20:11:25] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Running 48 sub problems to find dead transitions.
[2024-05-27 20:11:25] [INFO ] Invariant cache hit.
[2024-05-27 20:11:25] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:25] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/81 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 72 constraints, problems are : Problem set: 0 solved, 48 unsolved in 587 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/30 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (OVERLAPS) 51/81 variables, 30/42 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 30/72 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 48/120 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-27 20:11:26] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-27 20:11:26] [INFO ] Deduced a trap composed of 12 places in 32 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 122 constraints, problems are : Problem set: 0 solved, 48 unsolved in 1148 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 3/3 constraints]
After SMT, in 1776ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1777ms
Finished structural reductions in LTL mode , in 1 iterations and 1779 ms. Remains : 30/30 places, 51/51 transitions.
[2024-05-27 20:11:26] [INFO ] Flatten gal took : 5 ms
[2024-05-27 20:11:26] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:27] [INFO ] Input system was already deterministic with 51 transitions.
[2024-05-27 20:11:27] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:27] [INFO ] Flatten gal took : 4 ms
[2024-05-27 20:11:27] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-27 20:11:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 51 transitions and 321 arcs took 2 ms.
Total runtime 23142 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PhilosophersDyn-COL-03

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 30
TRANSITIONS: 51
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.002s, Sys 0.000s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 725
MODEL NAME: /home/mcc/execution/416/model
30 places, 51 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA PhilosophersDyn-COL-03-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716840688260

--------------------
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

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="PhilosophersDyn-COL-03"
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 PhilosophersDyn-COL-03, 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 r289-tajo-171654445000001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PhilosophersDyn-COL-03.tgz
mv PhilosophersDyn-COL-03 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 ;